Submission #108668


Source Code Expand

Copy
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
int main()
{
	int n;
	cin >> n;
	vector<P> vec;
	for(int i=0;i<n;i++)
	{
		string s;
		cin >> s;
		int a=0,b=0;
		for(int i=3;i>=0;i--)
		{
			a+=(s[i]-'0')*((int)pow(10,3-i));
			b+=(s[i+5]-'0')*((int)pow(10,3-i));
		}
		a-=a%5;
		if(5-b%5!=5)
		{
			b+=5-b%5;
		}
		if(b%100==60)
		{
			b-=60;
			b+=100;
		}
		vec.pb(P(a,b));
	}
	SORT(vec);
	vec.erase(unique(vec.begin(),vec.end()),vec.end());
	vector<P> ans;
	ans.pb(vec[0]);
	for(int i=1;i<vec.size();i++)
	{
		if(ans[ans.size()-1].sec>=vec[i].fi)
		{
			ans[ans.size()-1].sec=max(vec[i].sec,ans[ans.size()-1].sec);
		}
		else
		{
			ans.pb(vec[i]);
		}
	}
	for(int i=0;i<ans.size();i++)
	{
		int p=ans[i].fi,q=ans[i].sec;
		//cout << p <<' '<<q;
		for(int i=4;i>0;i--)
		{
			cout << (p%((int)pow(10,i))-p%((int)pow(10,i-1)))/((int)pow(10,i-1));
		}
		cout << '-' ;
		for(int i=4;i>0;i--)
		{
			cout << (q%((int)pow(10,i))-q%((int)pow(10,i-1)))/((int)pow(10,i-1));
		}
		cout << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User okura
Language C++ (G++ 4.6.4)
Score 100
Code Size 1720 Byte
Status
Exec Time 75 ms
Memory 1196 KB

Judge Result

Set Name Score / Max Score Test Cases
all 100 / 100 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt 22 ms 924 KB
00_sample_02.txt 21 ms 740 KB
00_sample_03.txt 20 ms 680 KB
cho_cho_chokudai.txt 70 ms 1188 KB
chokudai_ga_cho.txt 75 ms 1124 KB
test_01.txt 24 ms 808 KB
test_02.txt 23 ms 804 KB
test_03.txt 24 ms 800 KB
test_04.txt 23 ms 808 KB
test_05.txt 23 ms 688 KB
test_06.txt 23 ms 932 KB
test_07.txt 22 ms 792 KB
test_08.txt 24 ms 756 KB
test_09.txt 23 ms 800 KB
test_10.txt 23 ms 808 KB
test_11.txt 22 ms 804 KB
test_12.txt 23 ms 808 KB
test_13.txt 23 ms 812 KB
test_14.txt 22 ms 928 KB
test_15.txt 24 ms 732 KB
test_16.txt 22 ms 800 KB
test_17.txt 23 ms 932 KB
test_18.txt 23 ms 760 KB
test_19.txt 21 ms 848 KB
test_20.txt 25 ms 796 KB
test_21.txt 71 ms 1192 KB
test_22.txt 72 ms 1184 KB
test_23.txt 75 ms 1196 KB
test_24.txt 74 ms 1188 KB
test_25.txt 75 ms 1192 KB
test_26.txt 74 ms 1064 KB
test_27.txt 72 ms 1188 KB
test_28.txt 73 ms 1140 KB
test_29.txt 22 ms 732 KB
test_30.txt 22 ms 804 KB
test_31.txt 29 ms 812 KB
test_32.txt 22 ms 748 KB
test_33.txt 56 ms 1188 KB
test_34.txt 23 ms 928 KB
test_35.txt 21 ms 800 KB
test_36.txt 73 ms 1196 KB
test_37.txt 75 ms 1128 KB
test_38.txt 74 ms 1188 KB
test_39.txt 73 ms 1184 KB
test_40.txt 73 ms 1188 KB
test_41.txt 69 ms 1184 KB
test_42.txt 72 ms 1064 KB
test_43.txt 74 ms 1184 KB