Submission #107732

---

Source Code Expand

//Oh...(Booklet)
//0完ナウwチーンw
//人権を得たい人生だった
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#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 pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
int main(){
	int n;
	cin >> n;
	vector<P>vec;
	for(int i=0;i<n;i++)
	{
		int a,b;
		char c;
		cin >> a >> c >> b;
		int d=a/5;
		a=d*5;
		if(b%100>55)
		{
			b/=100;
			b++;
			b*=100;
		}
		else
		{
			int e=(b+4)/5;
			b=e*5;
		}
		vec.pb(mp(a,b));
	}

	sort(vec.begin(),vec.end());

	int nowbegin=vec[0].first;
	int nowlast=vec[0].second;
	int ind=1;
	while(ind!=vec.size())
	{
		if(nowlast>=vec[ind].first)
		{
			nowlast=max(nowlast,vec[ind].second);
		}
		else
		{
			printf("%04d-%04d\n",nowbegin,nowlast);
			nowbegin=vec[ind].first;
			nowlast=vec[ind].second;
		}
		ind++;
	}
	printf("%04d-%04d\n",nowbegin,nowlast);
}

Submission Info

Judge Result