Submission #3688015

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int allminute(int t){
	int h = t / 100;
	int m = t % 100;
	int res = 60 * h + m;
	return res;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int N; cin >> N;
	vector<int> st(N,0), ed(N,0);
	rep (i, N){
		string SE; cin >> SE;
		SE[4] = ' ';
		stringstream ss(SE);
		ss >> st[i] >> ed[i];
		st[i] = allminute(st[i]);
		ed[i] = allminute(ed[i]);
		st[i] /= 5;
		st[i] *= 5;
		if (ed[i] % 5 != 0){
			ed[i] = min(ed[i] + 5, 24 * 60);
			ed[i] /= 5;
			ed[i] *= 5;
		} // end if
	} // end rep

	vector<P> se(N);
	rep (i, N){
		se[i].first = st[i];
		se[i].second = ed[i];
	} // end rep

	sort(ALL(se));

	vector<P> res; res.clear();
	int l = se[0].first;
	int r = se[0].second;
	int i = 1;
	bool update = false;

	while(i < N){
		update = false;
		if (se[i].first <= r){
			r = max(r,se[i].second);
			++i;
		}else{
			res.push_back(P(l,r));
			update = true;
			l = se[i].first;
			r = se[i].second;
		} // end if
 	} // end while

	if (!update){
		res.push_back(P(l,r));
	} // end if	

	rep (i, (int)res.size()){
		int s = res[i].first;
		int t = res[i].second;
		cout << setw(2) << setfill('0') << (s / 60) << setw(2) << setfill('0') << (s % 60) << '-' << setw(2) << setfill('0') << (t / 60) << setw(2) << setfill('0') << (t % 60) << endl; 
	} // end rep

	return 0;
}

Submission Info

Judge Result