Submission #1331625

---

Source Code Expand

#include <iostream>
using namespace std;

int main()
{
	int N;
	int frm, aft;
	int tabel[24 * 12 + 1] = {0};
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> frm >> aft;
		aft *= -1;
		int index_s, index_e;
		int eh, em;
		int sh, sm;
		sh = frm / 100; sm = frm % 100; sm /= 5;
		index_s = sh * 12 + sm;
		eh = aft / 100; em = aft % 100; em += 4;
	
		

		index_e = eh * 60 + em;
		index_e /= 5;

		tabel[index_s] += 1;
		tabel[index_e] += -1;
	}

//	int count = 0;
//	int flag = -1;
//	for (int i = 0; i < 24 * 12 + 1; i++) {
//		count += tabel[i];
//
//		if (count > 0) {
//			if (flag < 0) {
//				printf("%02d%02d-", i / 12, (i % 12) * 5);
//				flag = i;
//			}
//		}
//		else {
//			if (flag >= 0) {
//				printf("%02d%02d\n", i / 12, (i % 12) * 5);
//				flag = -1;
//			}
//		}
//	}
//
//	return 0;
//}
#define M 288
#define p tabel
	for (int i = 1; i <= M; i++) {
		p[i] += p[i - 1];
	}
	
	int s = -1;
	for (int i = 0; i <= M; i++) {
		if (p[i] > 0) {
			if (s < 0) {
				s = i;
				printf("%02d%02d-", i / 12, (i % 12) * 5);
			}
		}
		else {
			if (s >= 0) {
				printf("%02d%02d\n", i / 12, (i % 12) * 5);
				s = -1;
			}
		}
	}

	return 0;
}

Submission Info

Judge Result