Submission #1813723

---

Source Code Expand

#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)

typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;

struct edge {
	int to,cost;
	edge(int t,ll c):to(t),cost(c) {}
};

int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1};

//-----------------------------------------------------------------------------

int n;
int s[30000],e[30000];
vector<P> ans,tim;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n;
	REP(i,n) {
		string tmp;
		cin>>tmp;
		s[i]=stoi(tmp.substr(0,4)),e[i]=stoi(tmp.substr(5,4));
		if(s[i]%5!=0) {
			if(s[i]%10<5) s[i]=s[i]-(s[i]%10);
			else s[i]=s[i]-(s[i]%10)+5;
			if(s[i]%100>=60) {
				s[i]=s[i]-(s[i]%100)+100;
			}
		}
		if(e[i]%5!=0) {
			if(e[i]%10<5) e[i]=e[i]-(e[i]%10)+5;
			else e[i]=e[i]-(e[i]%10)+10;
			if(e[i]%100>=60) {
				e[i]=e[i]-(e[i]%100)+100;
			}
		}
		tim.pb(P(s[i],e[i]));
	}

	sort(ALL(tim));

	int pos=0;
	REP(i,n) {
		if(i==0) ans.pb(P(tim[i].fi,tim[i].se)),pos++;
		else if(ans[pos-1].se>=tim[i].fi) {
			if(ans[pos-1].se<tim[i].se)ans[pos-1].se=tim[i].se;
		}
		else ans.pb(tim[i]),pos++;
	}

	REP(i,pos) printf("%04d-%04d\n",ans[i].fi,ans[i].se);

	return 0;
}

Submission Info

Judge Result