Submission #3681464

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N;
	cin >> N;

	int A[289] = {};
	int B[289] = {};

	rep(i, N) {
		string S;
		cin >> S;

		int X = 12 * stoi(S.substr(0, 2)) + stoi(S.substr(2, 2)) / 5;
		int Y = 12 * stoi(S.substr(5, 2)) + (stoi(S.substr(7, 2)) + 4) / 5;
		A[X]++;
		A[Y]--;
	}
	rep(i, 288) B[i + 1] = B[i] + A[i];
	int hutteru = 0;
	rep(i, 288) {
		if (hutteru == 0) {
			if (B[i + 1]) {
				hutteru = 1;
				int h = i / 12;
				int m = (i % 12) * 5;
				cout << setfill('0') << setw(2) << h << setw(2) << m << "-";
			}
		}
		else {
			if (B[i + 1] == 0) {
				hutteru = 0;
				int h = i / 12;
				int m = (i % 12) * 5;
				cout << setfill('0') << setw(2) << h << setw(2) << m << endl;
			}
		}
	}
	if (hutteru) {
		int h = 24;
		int m = 0;
		cout << setfill('0') << setw(2) << h << setw(2) << m << endl;
	}

	Would you please return 0;
}

Submission Info

Judge Result