Submission #109380

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <vector>

#define rep2(x,from,to) for(int (x)=(from);(x)<(to);(x)++)
#define rep(x,to) rep2((x),0,(to))
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define FS first
#define SC second

using namespace std;
typedef long long ll;
typedef pair<string,string> pss;


int main()
{
	int n, res=0;
	vector<pss> vp;
	cin >> n;
	string st;
	rep(i,n){
		cin >>st;
		if(st[3]>'0' && st[3]<'5') st[3]='0';
		else if(st[3]>='5' && st[3]<='9') st[3]='5';
		if(st[8]>='1' && st[8]<='5') st[8]='5';
		else if(st[8]>='6' && st[8]<='9'){
			st[8]='0', st[7]+=1;
			if(st[7]=='6' ) st[6]+=1, st[7]='0';
			if(st[6]>'9' )  st[5]+=1, st[6]='0';
		}
		vp.push_back(pss(st.substr(0,4), st.substr(5,4)));
	}

	sort(all(vp));
	string w1=vp[0].FS, w2=vp[0].SC;
	if(n==1){ cout << w1 +"-"+ w2 << endl; return 0;}
	rep2(i,1,n){
		if(vp[i].FS>w2 ){
			cout << w1 +"-"+ w2 << endl;
			w1=vp[i].FS, w2=vp[i].SC;
		}else{
			w2 = max(w2, vp[i].SC);
		}
	}
	cout << w1 +"-"+ w2 << endl;
	
//	for_each(all(vp),[](pss x){cout<<x.FS<<" "<<x.SC<<", ";}); puts("");

	return 0;
}

Submission Info

Judge Result