Submission #4178463
Source Code Expand
using namespace std;
#include<bits/stdc++.h>
#define BEGIN ios_base::sync_with_stdio(0);cin.tie(0);
#define END return EXIT_SUCCESS;
#define FOR(I,A,B) for((I)=(A);(I)<(B);(I)++)
#define REP(I,N) FOR((I),0,(N))
#define UP(I,A,B) for((I)=(A);(I)<=(B);(I)++)
#define DW(I,A,B) for((I)=(A);(I)>=(B);(I)--)
#define IN(P) cin>>(P)
#define IN2(P1,P2) cin>>(P1)>>(P2)
#define IN3(P1,P2,P3) cin>>(P1)>>(P2)>>(P3)
#define INS(I,N,V) REP((I),(N)) cin>>V[I]
#define INS2(I,N,V1,V2) REP((I),(N)) cin>>V1[I]>>V2[I];
#define INS3(I,N,V1,V2,V3) REP((I),(N)) cin>>V1[I]>>V2[I]>>V3[I];
#define OUT(P) cout<<(P)<<endl
#define OUT2(P1,P2) cout<<(P1)<<" "<<(P2)<<endl
#define OUT3(P1,P2,P3) cout<<(P1)<<" "<<(P2)<<" "<<(P3)<<endl
#define OUTS(I,N,V) REP((I),(N)) cout<<(V[i])<<endl
#define ALL(C) (C).begin(),(C).end()
#define RALL(C) (C).rbegin(),(C).rend()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
template<class T>inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
template<class T>inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T>inline T lcm(T a,T b){return a*b/gcd(b,a%b);}
long N,i,s,e,p,n,t;
string S;
vector<pair<long,long> > v,vv,vvv;
inline void solve(){
IN(N);
REP(i,N){
IN(S);
p=S.find("-");
s=stoi(S.substr(0,p));
e=stoi(S.substr(p+1,S.size()));
s=s-((s%100)%5);
t=(e%100)%5;
if(t)e=e+5-t;
if(e%100==60)e=(e/100+1)*100;
v.pb(mp(s,e));
}
sort(ALL(v));
n=v.size();
REP(i,n-1){
if(v[i].f!=v[i+1].f||v[i].s!=v[i+1].s)vv.pb(v[i]);
}
vv.pb(v[n-1]);
// cout<<endl;
// for(auto e:vv)cout<<e.f<<" "<<e.s<<endl;
// cout<<endl;
n=vv.size();
REP(i,n-1){
if(vv[i].s>=vv[i+1].f){
vv[i+1].f=vv[i].f;
if(vv[i].s>=vv[i+1].s){
vv[i+1].s=vv[i].s;
}
}else{
vvv.pb(vv[i]);
}
}
vvv.pb(vv[n-1]);
n=vvv.size();
REP(i,n){
printf("%04ld-%04ld\n",vvv[i].f,vvv[i].s);
}
}
int main(int argc,char**argv){
BEGIN
solve();
END
}
Submission Info
Submission Time |
|
Task |
D - 感雨時刻の整理 |
User |
hryshtk |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2195 Byte |
Status |
AC |
Exec Time |
15 ms |
Memory |
1528 KB |
Judge Result
Set Name |
all |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
all |
00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01.txt |
AC |
1 ms |
256 KB |
00_sample_02.txt |
AC |
1 ms |
256 KB |
00_sample_03.txt |
AC |
1 ms |
256 KB |
cho_cho_chokudai.txt |
AC |
12 ms |
892 KB |
chokudai_ga_cho.txt |
AC |
13 ms |
1528 KB |
test_01.txt |
AC |
1 ms |
256 KB |
test_02.txt |
AC |
1 ms |
256 KB |
test_03.txt |
AC |
1 ms |
256 KB |
test_04.txt |
AC |
1 ms |
256 KB |
test_05.txt |
AC |
1 ms |
256 KB |
test_06.txt |
AC |
1 ms |
256 KB |
test_07.txt |
AC |
1 ms |
256 KB |
test_08.txt |
AC |
1 ms |
256 KB |
test_09.txt |
AC |
1 ms |
256 KB |
test_10.txt |
AC |
2 ms |
256 KB |
test_11.txt |
AC |
1 ms |
256 KB |
test_12.txt |
AC |
1 ms |
256 KB |
test_13.txt |
AC |
1 ms |
256 KB |
test_14.txt |
AC |
2 ms |
256 KB |
test_15.txt |
AC |
2 ms |
256 KB |
test_16.txt |
AC |
1 ms |
256 KB |
test_17.txt |
AC |
2 ms |
256 KB |
test_18.txt |
AC |
1 ms |
256 KB |
test_19.txt |
AC |
1 ms |
256 KB |
test_20.txt |
AC |
1 ms |
256 KB |
test_21.txt |
AC |
14 ms |
1144 KB |
test_22.txt |
AC |
15 ms |
1272 KB |
test_23.txt |
AC |
14 ms |
1144 KB |
test_24.txt |
AC |
14 ms |
1272 KB |
test_25.txt |
AC |
14 ms |
1272 KB |
test_26.txt |
AC |
13 ms |
892 KB |
test_27.txt |
AC |
12 ms |
892 KB |
test_28.txt |
AC |
13 ms |
892 KB |
test_29.txt |
AC |
1 ms |
256 KB |
test_30.txt |
AC |
1 ms |
256 KB |
test_31.txt |
AC |
3 ms |
512 KB |
test_32.txt |
AC |
1 ms |
256 KB |
test_33.txt |
AC |
9 ms |
892 KB |
test_34.txt |
AC |
1 ms |
256 KB |
test_35.txt |
AC |
1 ms |
256 KB |
test_36.txt |
AC |
14 ms |
1528 KB |
test_37.txt |
AC |
13 ms |
892 KB |
test_38.txt |
AC |
13 ms |
892 KB |
test_39.txt |
AC |
14 ms |
892 KB |
test_40.txt |
AC |
13 ms |
892 KB |
test_41.txt |
AC |
11 ms |
892 KB |
test_42.txt |
AC |
13 ms |
892 KB |
test_43.txt |
AC |
12 ms |
892 KB |