Submission #990806

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>

#define REP(i,n) for(int i=0;i<n;++i)
#define RREP(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define RFOR(i,m,n) for(int i=m-1;i>=n;--i)
#define ALL(v) v.begin(),v.end()
#define PB(a) push_back(a)
#define INF 1000000001
#define MOD 1000000007

using namespace std;


int main() {
	int n;
	vector<pair<int, int> > v, ans;
	cin >> n;
	REP(i, n) {
		int a, b;
		cin >> a;
		a = a / 5 * 5;
		cin.ignore();
		cin >> b;
		b = (b + 4) / 5 * 5;
		if (b%100 == 60) b += 40;
		v.PB(make_pair(a, b));
	}

	sort(ALL(v));
	int ini = v[0].first, cmax = v[0].second;
	REP(i, n) {
		if (i == n - 1) {
			ans.PB(make_pair(ini, max(cmax, v[i].second)));
		}
		else {
			if (cmax >= v[i + 1].first) {
				cmax = max(cmax, v[i + 1].second);
			}
			else {
				ans.PB(make_pair(ini, cmax));
				ini = v[i + 1].first;
				cmax = v[i + 1].second;

			}
		}
	}
	REP(i, ans.size()) {
		cout << setw(4) << setfill('0') << ans[i].first << "-" << setw(4) << setfill('0') << ans[i].second << endl;
	}
	return 0;
}

Submission Info

Judge Result