Submission #530147

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#include <complex>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)
#define EPS (1e-14)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef complex<double> Complex;
typedef vector< vector<int> > Mat;

int N;
PII T[30005];

int convert_head(int x) {
	int h = x / 100;
	int m = x % 100;
	m -= m % 5;
	return h * 100 + m;
}

int convert_tail(int x) {
	int h = x / 100;
	int m = x % 100;
	if (m % 5 > 0) {
		m += 5 - m % 5;
	}
	h += m / 60;
	m %= 60;
	return h * 100 + m;
}

void solve() {
	sort(T, T + N);
#if 0
	rep(i, N) {
		cout << T[i].first << " " << T[i].second << endl;
	}
#endif
	int prev_head = -1;
	int prev_tail = -1;
	rep(i, N) {
		int head = convert_head(T[i].first);
		int tail = convert_tail(T[i].second);
		if (prev_head == -1) {
			prev_head = head;
			prev_tail = tail;
		}
		if (prev_tail < head) {
			printf("%04d-%04d\n", prev_head, prev_tail);
			prev_head = head;
		}
		prev_tail = max(prev_tail, tail);
	}
	printf("%04d-%04d\n", prev_head, prev_tail);
}

int main() {
	char c;
	cin >> N;
	rep(i, N) {
		cin >> T[i].first >> c >> T[i].second;
	}
	solve();
	return 0;
}

Submission Info

Judge Result