Submission #7070089

---

Source Code Expand

#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x)  cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;

const int a[] = {36000, 3600, 600, 60};

int second(string &s, bool start) {
	int ret = 0;
	rep(i,3) ret += (int)(s[i]-'0')*a[i];
	if (start) {
		if ((int)(s[3]-'0') <= 4) ret += 60*0;
		else ret += 60*5;
	}
	else {
		if ((int)(s[3]-'0') == 0) ret += 60*0;
		else if ((int)(s[3]-'0') <= 5) ret += 60*5;
		else ret += 60*10;
	}
	return ret;
}

string output(int x) {
	string ret;
	rep(i,4) {
		int tmp = x/a[i];
		ret.push_back((char)(tmp+'0'));
		x -= (tmp*a[i]);
	}
	return ret;
}

int main(int argc, char const *argv[]) {
	int n; cin>>n;
	vector<int> imos(114514);
	rep(i,n) {
		string s,t,u; cin>>s;
		rep(j,4) t.push_back(s[j]);
		rep(j,4) u.push_back(s[j+5]);
		imos[second(t,true)+1]++; imos[second(u,false)+1]--;
	}

	rep(i,114513) imos[i+1] += imos[i];
	
	vector<int> ans;
	for (int i = 0; i < 114514-1; ++i) {
		if (ans.size()%2==0) {
			if (imos[i]==0 && imos[i+1]!=0) ans.push_back(i+1-1);
		}
		else {
			if (imos[i]!=0 && imos[i+1]==0) ans.push_back(i+1-1);
		}
	}
	for (int i = 0; i < ans.size(); i+=2) {
		cout<<output(ans[i])<<"-"<<output(ans[i+1])<<endl;
	}
	return 0;
}

Submission Info

Judge Result