Submission #3604193

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
const int MAX_C = 100010;
void abcd() {
	int t[2411];
	int n;
	cin >> n;
	fill(t, t + 2411, -1);
	for (size_t i = 0; i < n; i++)
	{
		string s;
		cin >> s;
		int f = stoi(s.substr(0, 4));
		f -= f % 5;
		int to = stoi(s.substr(5, 4));
		to += (5 - ((to % 5) == 0 ? 5 : (to % 5)));
		if (to % 100 == 60) to += 40;
		int m = f;
		if (t[to] != -1) to = t[to];
		t[to] = to;
		while (m < to)
		{
			t[m] = to;
			m++;
		}
	}

	int from = -1;
	int to = -1;
	for (size_t i = 0; i <= 2410; i++)
	{
		if (t[i] == -1) {
			if (from != -1 && to != -1) {

				std::ostringstream oss;
				oss << std::setw(4) << std::setfill('0') << to_string(from);
				std::ostringstream oss2;
				oss2 << std::setw(4) << std::setfill('0') << to_string(to);
				cout << oss.str() << "-" << oss2.str() << endl;
			}
			from = -1;
			to = -1;
		}
		else if (from == -1) {
			from = i;
		}
		to = t[i];
	}

}
int main() {
	abcd();
	return 0;
}

Submission Info

Judge Result