Submission #591504


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef pair<int,int> P;
int main(){
  int n; cin >> n;
  vector<P> time;
  int cnt = 0;
  while(cnt != n){
    string str; cin >> str;
    int sh = (str[0]-'0')*10+(str[1]-'0');
    int sm = (str[2]-'0')*10;
    if(str[3]-'0' >= 5) sm += 5;
    if(sm == 60){
      sm = 0;
      sh++;
    }
    int eh = (str[5]-'0')*10+(str[6]-'0');
    int em = (str[7]-'0')*10;
    if(str[8]-'0' > 5) em += 10;
    else if(str[8]-'0' > 0) em += 5;
    if(em == 60){
      em = 0;
      eh++;
    }
    time.push_back(P(sh*100+sm,eh*100+em));
    cnt++;
  }
  sort(time.begin(),time.end());
  vector<P> ans;
  int ns=time[0].F,ne=time[0].S;
  for(int i=1;i<n;i++){
    if(ns<=time[i].F && time[i].F <= ne){
      ne = max(ne,time[i].S);
    }
    else {
      ans.push_back(P(ns,ne));
      ns = time[i].F;
      ne = time[i].S;
    }
  }
  ans.push_back(P(ns,ne));
  sort(ans.begin(),ans.end());
  for(int i=0;i<ans.size();i++){
    if(ans[i].F/10 == 0) cout << "000";
    else if(ans[i].F/100 == 0) cout << "00";
    else if(ans[i].F/1000 == 0) cout << "0";
    cout << ans[i].F << "-";
    if(ans[i].S/10 == 0) cout << "000";
    else if(ans[i].S/100 == 0) cout << "00";
    else if(ans[i].S/1000 == 0) cout << "0";
    cout << ans[i].S << endl;
  }
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User remtus
Language C++ (G++ 4.6.4)
Score 100
Code Size 1372 Byte
Status AC
Exec Time 69 ms
Memory 1216 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
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 27 ms 932 KB
00_sample_02.txt AC 24 ms 932 KB
00_sample_03.txt AC 26 ms 932 KB
cho_cho_chokudai.txt AC 63 ms 1216 KB
chokudai_ga_cho.txt AC 68 ms 1212 KB
test_01.txt AC 25 ms 808 KB
test_02.txt AC 25 ms 936 KB
test_03.txt AC 27 ms 932 KB
test_04.txt AC 25 ms 928 KB
test_05.txt AC 26 ms 928 KB
test_06.txt AC 25 ms 928 KB
test_07.txt AC 25 ms 932 KB
test_08.txt AC 24 ms 928 KB
test_09.txt AC 27 ms 932 KB
test_10.txt AC 24 ms 932 KB
test_11.txt AC 25 ms 924 KB
test_12.txt AC 24 ms 864 KB
test_13.txt AC 26 ms 932 KB
test_14.txt AC 25 ms 936 KB
test_15.txt AC 26 ms 928 KB
test_16.txt AC 26 ms 932 KB
test_17.txt AC 25 ms 936 KB
test_18.txt AC 27 ms 932 KB
test_19.txt AC 25 ms 924 KB
test_20.txt AC 26 ms 932 KB
test_21.txt AC 66 ms 1212 KB
test_22.txt AC 67 ms 1212 KB
test_23.txt AC 65 ms 1208 KB
test_24.txt AC 64 ms 1212 KB
test_25.txt AC 67 ms 1216 KB
test_26.txt AC 65 ms 1212 KB
test_27.txt AC 63 ms 1208 KB
test_28.txt AC 65 ms 1212 KB
test_29.txt AC 23 ms 924 KB
test_30.txt AC 23 ms 928 KB
test_31.txt AC 30 ms 1000 KB
test_32.txt AC 24 ms 928 KB
test_33.txt AC 51 ms 1212 KB
test_34.txt AC 25 ms 928 KB
test_35.txt AC 25 ms 928 KB
test_36.txt AC 67 ms 1212 KB
test_37.txt AC 65 ms 1208 KB
test_38.txt AC 65 ms 1212 KB
test_39.txt AC 65 ms 1212 KB
test_40.txt AC 65 ms 1208 KB
test_41.txt AC 67 ms 1212 KB
test_42.txt AC 65 ms 1212 KB
test_43.txt AC 69 ms 1212 KB