Submission #4509344

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define double long double
#define endre getchar();getchar();return 0
#define moder (int)(1e9+7)
#define inf (int)(5*1e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define all(v) v.begin(),v.end()
#define prique(T) priority_queue<T,vector<T>,greater<T>>
#define vecunique(vec) sort(vec.begin(), vec.end());decltype(vec)::iterator result = std::unique(vec.begin(), vec.end());vec.erase(result, vec.end())
using namespace std;

bool prime(int n) {
	for (int i = 2; i <= sqrt(n); i++) {
		if (n%i == 0)return false;
	}
	return n != 1;
}
int gcd(int x, int y) {
	if (y == 0)return x;
	return gcd(y, x%y);
}
int lcm(int x, int y) {
	return x * y / gcd(x, y);
}
int mod_pow(int x, int y, int mod) {
	int res = 1;
	while (y > 0) {
		if (y & 1) {
			res = res * x%mod;
		}
		x = x * x%mod;
		y >>= 1;
	}
	return res;
}
int kai(int x) {
	if (x == 0)return 1;
	return (kai(x - 1)*x) % moder;
}
int comb(int x, int y) {
	return kai(x)*mod_pow(kai(x - y), moder - 2, moder) % moder*mod_pow(kai(y), moder - 2, moder) % moder;
}
struct edge { int to, cost; };
int dx[5] = { 0,1,0,-1 }, dy[5] = { 1,0,-1,0 };
map<int, int>factor(int x) {
	map<int, int>res;
	for (int i = 2; i*i <= x; i++) {
		while (x%i == 0) {
			x /= i;
			res[i]++;
		}
	}
	if (x != 1)res[x]++;
	return res;
}
/*--------Library Zone!--------*/

int n;
vector<P>vec;
signed main() {
	cin >> n;
	rep(i, n) {
		string s;
		cin >> s;
		P p = { stoi(s.substr(0,2)) * 60 + stoi(s.substr(2,2)),stoi(s.substr(5,2)) * 60 + stoi(s.substr(7,2)) };
		p.first = p.first / 5 * 5;
		p.second = (p.second - 1) / 5 * 5 + 5;
		vec.push_back({ p.first, p.second });
	}
	sort(all(vec));
	rep(i, 2 - to_string(vec[0].first / 60).size())cout << 0;
	cout << vec[0].first / 60;
	rep(i, 2 - to_string(vec[0].first % 60).size())cout << 0;
	cout << vec[0].first % 60;
	int memo = vec[0].second;
	REP(i, vec.size()) {
		if (memo >= vec[i].first) {
			memo = max(memo, vec[i].second);
		}
		else {
			cout << "-";
			rep(j, 2 - to_string(memo / 60).size())cout << 0;
			cout << memo / 60;
			rep(j, 2 - to_string(memo % 60).size())cout << 0;
			cout << memo % 60 << endl;
			rep(j, 2 - to_string(vec[i].first / 60).size())cout << 0;
			cout << vec[i].first / 60;
			rep(j, 2 - to_string(vec[i].first % 60).size()) {
				cout << 0;
			}
			cout << vec[i].first % 60;
			memo = vec[i].second;
		}
	}
	cout << "-";
	rep(i, 2 - to_string(memo / 60).size())cout << 0;
	cout << memo / 60;
	rep(i, 2 - to_string(memo % 60).size())cout << 0;
	cout << memo % 60 << endl;
	endre;

}

Submission Info

Judge Result