Submission #109159

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <functional>
#include <ctime>
 
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define REV(s) (s).rbegin(), (s).rend()
#define MP make_pair
#define X first
#define Y second
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> P;
 
template <class T> T sq(T a){return a*a;}

const int INF = 1<<29;

P rain[30001];
bool invalid[30001];

int enc(int x){
	return x/100*60+x%100;
}

int dec(int x){
	return x/60*100+x%60;
}

int main(){
	int N;
	cin >> N;
	rep(i, N){
		char c;
		cin >> rain[i].first >> c >> rain[i].second;
		rain[i].first = enc(rain[i].first)/5*5;
		rain[i].second = (enc(rain[i].second)+4)/5*5;
	}

	sort(rain, rain+N);
	int idx = 0;
	FOR(i, 1, N){
		if(rain[idx].second >= rain[i].first){
			rain[idx].second = max(rain[idx].second, rain[i].second);
			invalid[i] = true;
		}else{
			idx = i;
		}
	}
	rep(i, N){
		if(invalid[i]) continue;
		printf("%04d-%04d\n", dec(rain[i].first), dec(rain[i].second));
	}

	return 0;
}

Submission Info

Judge Result