Submission #1171168

---

Source Code Expand

#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
#include <fstream>
#include <cstdint>
#include <cmath>
#include <algorithm>
#include <utility>
#include <numeric>
#include <functional>
using namespace std;

constexpr int INF       = 1000000000;/* 1e+9a */
constexpr int MODULO    = 1000000007;

typedef int64_t ll;


int main()
{
	cin.tie(0);
    ios::sync_with_stdio(false);
	int N;
	map<int,int> rain;
	cin >> N;
	for(int i = 0; i < N; ++i){
		string str;
		cin >> str;
		int s = stoi(str.substr(0, 4));
		int e = stoi(str.substr(5, 4));
		if(s % 10 >= 5) {
			s /= 10;
			s = s*10 + 5;
		}
		else{
			s /=10;
			s *= 10;
		}
		if(e % 10 > 5){
			e /= 10;
			e = e*10 + 10;
		}
		else if(e % 10 > 0){
			e /= 10;
			e = e*10 + 5;
		}
		if(s % 100 >= 60) {
			s /= 100;
			s++;
			s *= 100;
		}
		if(e % 100 >= 60) {
			e /= 100;
			e++;
			e *= 100;
		}
		rain[s] = max(rain[s],e);
	}

	int s,e; s = rain.begin()->first; e = rain.begin()->second;
	vector<pair<int,int>> v;
	for (auto&& t : rain) {
		if(t.first <= e){
			e = max(e, t.second);
		}
		else{
			v.push_back({s,e});
			s = t.first;
			e = t.second;
		}
	}
	if(v.size() == 0 || s != v.back().first || e != v.back().second)
		v.push_back({s,e});

	/* cout << v.size() << '\n'; */
	for (auto t : v) {
		cout << setfill('0') << setw(4) << t.first << '-'  << setfill('0') << setw(4) << t.second << '\n';
	}


}

Submission Info

Judge Result