Submission #2309371

---

Source Code Expand

#define _USE_MATH_DEFINES

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <utility>
#include <climits>
#include <vector>
#include <map>
#include <queue>
#include <set>
using namespace std;

#define ll long long
const int MOD = 1000000007;//10^9+7
const string SPACE = " ";

ll powsur(ll a, ll b, ll p) {

	if (b == 0) {

		return 1;

	}
	else if (b % 2 == 0) {

		ll d = powsur(a, b / 2, p);
		return ((d%p)*(d%p)) % p;

	}
	else {

		return ((a%p)*powsur(a, b - 1, p) % p) % p;

	}

}
//pは素数,aのb乗をpで割った余り

ll CMOD(ll n, ll r, ll p) {

	ll a = 1, b = 1, c = 1, re;
	for (int i = 1; i <= n; i++) {

		a *= i;
		a = a%p;

	}
	for (int i = 1; i <= r; i++) {

		b *= i;
		b = b%p;

	}
	for (int i = 1; i <= n - r; i++) {

		c *= i;
		c = c%p;

	}
	b = powsur(b, p - 2, p);
	c = powsur(c, p - 2, p);
	re = ((a%p)*(b%p)) % p;
	re = ((re%p)*c%p) % p;

	return re;

}
//pは素数,(nCr)%p

ll gcd(ll a, ll b) {

	if (a > b) {

		ll tmp = a;
		a = b;
		b = tmp;

	}
	ll r;
	r = b%a;
	if (r == 0)return a;
	else return gcd(r, a);

}
//最大公約数

ll lcm(ll a, ll b) {

	return (a / gcd(a, b))*b;

}
//最小公倍数

ll MAX(ll a, ll b) {

	if (a > b)return a;
	else return b;

}
//MAX

ll MIN(ll a, ll b) {

	if (a < b)return a;
	else return b;

}
//MIN

bool p_judge(ll p) {

	if (p == 1)return false;
	else if (p == 2)return true;
	else {

		bool flag = true;
		for (int i = 2; i <= sqrt(p); i++) {

			if (p%i == 0) {

				flag = false;
				break;

			}

		}
		return flag;

	}

}
//素数判定,素数=true,合成数=false

int main() {

	int N;
	pair<int, int> P[30005];

	cin >> N;

	for (int i = 0; i < N; i++) {

		string str;
		cin >> str;
		int m = stoi(str.substr(0, 2));
		P[i] = make_pair(stoi(str.substr(0, 2)) * 60 + stoi(str.substr(2, 2)), stoi(str.substr(5, 2)) * 60 + stoi(str.substr(7, 2)));
		P[i].first = P[i].first - P[i].first % 5;
		if (P[i].second % 5 != 0)P[i].second = P[i].second - P[i].second % 5 + 5;

	}

	int line[1500];
	for (int i = 0; i < 1500; i++)line[i] = 0;
	for (int i = 0; i < N; i++) {

		line[P[i].first]++;
		line[P[i].second]--;

	}
	for (int i = 1; i < 1500; i++) {

		line[i] += line[i - 1];

	}
	
	bool flag = false;
	int tmp;
	for (int i = 0; i < 1500; i++) {

		if (line[i] > 0 && !flag) {

			flag = true;
			tmp = i;

		}
		else if (line[i] == 0 && flag) {

			flag = false;
			printf("%02d%02d-%02d%02d\n", (tmp - tmp % 60) / 60, tmp % 60, (i - i % 60) / 60, i % 60);

		}

	}

	return 0;
}

Submission Info

Judge Result