Submission #7945342
Source Code Expand
#include <iostream> #include <cstdio> #include <algorithm> #include <cmath> #include <vector> #include <list> #include <set> #include <map> #include <queue> #include <stack> #include <cctype> #include <climits> #include <string> #include <bitset> #include <cfloat> using namespace std; typedef long double ld; typedef long long int ll; typedef unsigned long long int ull; typedef vector<int> vi; typedef vector<char> vc; typedef vector<double> vd; typedef vector<string> vs; typedef vector<ll> vll; typedef vector<pair<int,int> > vpii; typedef vector<vector<int> > vvi; typedef vector<vector<char> > vvc; typedef vector<vector<string> > vvs; typedef vector<vector<ll> > vvll; #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define fin(ans) cout<<(ans)<<endl #define STI(s) atoi(s.c_str()) #define mp(p,q) make_pair(p,q) #define pb(n) push_back(n) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define Sort(a) sort(a.begin(),a.end()) #define Rort(a) sort(a.rbegin(),a.rend()) #define MATHPI acos(-1) template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;} template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;} struct io{io(){ios::sync_with_stdio(false);cin.tie(0);};}; const int MOD = 1000000007; const int INF = INT_MAX; const ll LLINF = 1LL<<60; int main(void){ int n; cin>>n; string s; vector<pair<int,int> > v; rep(i,n){ cin>>s; int a=STI(s.substr(0,4)); int b=STI(s.substr(5,4)); if(a%10>5){ a/=10; a*=10; a+=5; } else if(a%10>0&&a%10!=5){ a/=10; a*=10; } if(b%10>5){ b/=10; b*=10; b+=10; } else if(b%10>0&&b%10!=5){ b/=10; b*=10; b+=5; } if(b%100==60){ b+=40; } v.push_back(mp(a,b)); } Sort(v); // cout<<"---------"<<endl; // for(int i=0;i<v.size();i++){ // cout<<v[i].first<<" "<<v[i].second<<endl; // } // cout<<"---------"<<endl; for(int i=0;i<v.size()-1;i++){ if(v[i].second>=v[i+1].first){ v[i+1].first=v[i].first; v[i+1].second=max(v[i].second,v[i+1].second); v.erase(v.begin()+i); i--; } } for(int i=0;i<v.size();i++){ printf("%04d-%04d\n",v[i].first,v[i].second); } }
Submission Info
Submission Time | |
---|---|
Task | D - 感雨時刻の整理 |
User | xryuseix |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2653 Byte |
Status | AC |
Exec Time | 364 ms |
Memory | 640 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 | 360 ms | 640 KB |
chokudai_ga_cho.txt | AC | 362 ms | 640 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 | 2 ms | 256 KB |
test_10.txt | AC | 2 ms | 256 KB |
test_11.txt | AC | 2 ms | 256 KB |
test_12.txt | AC | 2 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 | 2 ms | 256 KB |
test_20.txt | AC | 2 ms | 256 KB |
test_21.txt | AC | 364 ms | 640 KB |
test_22.txt | AC | 363 ms | 640 KB |
test_23.txt | AC | 363 ms | 640 KB |
test_24.txt | AC | 363 ms | 640 KB |
test_25.txt | AC | 363 ms | 640 KB |
test_26.txt | AC | 362 ms | 640 KB |
test_27.txt | AC | 361 ms | 640 KB |
test_28.txt | AC | 361 ms | 640 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 12 ms | 384 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_33.txt | AC | 161 ms | 640 KB |
test_34.txt | AC | 1 ms | 256 KB |
test_35.txt | AC | 1 ms | 256 KB |
test_36.txt | AC | 363 ms | 640 KB |
test_37.txt | AC | 361 ms | 640 KB |
test_38.txt | AC | 362 ms | 640 KB |
test_39.txt | AC | 364 ms | 640 KB |
test_40.txt | AC | 362 ms | 640 KB |
test_41.txt | AC | 360 ms | 640 KB |
test_42.txt | AC | 362 ms | 640 KB |
test_43.txt | AC | 361 ms | 640 KB |