Submission #5440762

---

Source Code Expand

#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>


ll n, s[3000];
vector <ll> ans;

void p(ll a) {
	if ((a - 60) % 100 == 0) a += 40;
	string now = to_string(a);
	REP(i, 4 - now.size()) cout << 0;
	cout << now;
}
int main() {
	cin >> n;
	REP(i, n) {
		ll a, b;
		char c;
		cin >> a >> c >> b;
		b += 4;
		s[a - a % 5]++;
		if ((b - b % 5 - 60) % 100 == 0)b += 40;
		s[b - b % 5]--;
	}
	REP(i, 2500)s[i + 1] += s[i];
	REP(i, 2500) {
		if (i == 0 and s[i] > 0)ans.push_back(0);
		if(s[i] > 0 and s[i + 1] == 0)ans.push_back(i + 1);
		if(s[i] == 0 and s[i + 1] > 0)ans.push_back(i + 1);
	}
	for (int i = 0; i < ans.size(); i += 2) {
		p(ans[i]);
		cout << "-";
		p(ans[i + 1]);
		cout << endl;
	}
}

Submission Info

Judge Result