Submission #232373

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#include <iomanip>

#define INF 100000000
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef list<pii>::iterator lpite;
const double PI = acos(-1.0);

void rain_merge(vector<pii> &v)
{
	vector<pii> tmp;

	int s, f;
	s = v[0].first;
	f = v[0].second;
	FOR(i,1,v.size()) {
		if (v[i].first <= f) {
			f = max(f, v[i].second);
		} else {
			tmp.push_back(pii(s, f));
			s = v[i].first;
			f = v[i].second;

		}
	}
	tmp.push_back(pii(s,f));

	v = tmp;
}

int main()
{
	ios::sync_with_stdio(false);

	int N;
	vector<pii> v;

	cin >> N;
	FOR(i,0,N){
		int s, f;
		cin >> s >> f;
		f = -f;
		pii r;
		r.first = (s/100)*60 + s%100;
		r.first -= r.first%5;
		r.second = (f/100)*60 + f%100;
		if (r.second%5){
			r.second += 5-r.second%5;
		}

		v.push_back(r);
	}
	sort(v.begin(), v.end());

	rain_merge(v);

	FOR(i,0,v.size()) {
		int s, f;
		s = v[i].first, f = v[i].second;
		cout << setw(2) << setfill('0') << s/60;
		cout << setw(2) << setfill('0') << s%60;
		cout << '-';
		cout << setw(2) << setfill('0') << f/60;
		cout << setw(2) << setfill('0') << f%60 << '\n';
	}

	return 0;
}

Submission Info

Judge Result