Submission #109816


Source Code Expand

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include <iostream>
#include <cmath>
#include <algorithm>

#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>

using namespace std;

typedef long long ll;

#define M (30010)

int n;

inline void printTime(int t){
  printf("%02d%02d", t/60, t%60);
}

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

  scanf("%d", &n);
  char s[10];
  vector< pair<int, int> > a(n);
  for(int o = 0; o < n; o++){
    scanf("%s", s);
    int sh = (s[0] - '0') * 10 + s[1] - '0';
    int sm = (s[2] - '0') * 10 + s[3] - '0';
    if(sm % 5)sm -= sm % 5;
    int eh = (s[5] - '0') * 10 + s[6] - '0';
    int em = (s[7] - '0') * 10 + s[8] - '0';
    if(em % 5)em += 5 - (em % 5);
    if(em == 60){
      em = 0; eh++;
    }
    a[o] = make_pair(sh*60+sm, eh*60+em);
  }
  sort(a.begin(), a.end());
  //for(int i = 0; i < n; i++){printTime(a[i].first); printf("-"); printTime(a[i].second); puts("");}
  for(int i = 0; i < n;){
    printTime(a[i].first); printf("-");
    int et = a[i].second;
    //int eh = a[i].second / 60;
    //int em = a[i].second % 60;
    i++;
    while(i < n){
      if(et >= a[i].first){
        et = max(et, a[i].second);
        i++;
      }else{
        break;
      }
    }
    printTime(et); printf("\n");
  }

  return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User chronotable
Language C++ (G++ 4.6.4)
Score 100
Code Size 1427 Byte
Status AC
Exec Time 33 ms
Memory 1064 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:36:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 22 ms 800 KB
00_sample_02.txt AC 23 ms 792 KB
00_sample_03.txt AC 19 ms 796 KB
cho_cho_chokudai.txt AC 24 ms 1044 KB
chokudai_ga_cho.txt AC 29 ms 1052 KB
test_01.txt AC 21 ms 792 KB
test_02.txt AC 19 ms 720 KB
test_03.txt AC 21 ms 796 KB
test_04.txt AC 20 ms 796 KB
test_05.txt AC 19 ms 920 KB
test_06.txt AC 19 ms 916 KB
test_07.txt AC 22 ms 872 KB
test_08.txt AC 21 ms 800 KB
test_09.txt AC 21 ms 924 KB
test_10.txt AC 22 ms 808 KB
test_11.txt AC 19 ms 920 KB
test_12.txt AC 21 ms 800 KB
test_13.txt AC 19 ms 796 KB
test_14.txt AC 22 ms 924 KB
test_15.txt AC 21 ms 924 KB
test_16.txt AC 22 ms 796 KB
test_17.txt AC 22 ms 812 KB
test_18.txt AC 22 ms 800 KB
test_19.txt AC 22 ms 792 KB
test_20.txt AC 21 ms 796 KB
test_21.txt AC 30 ms 1052 KB
test_22.txt AC 28 ms 1056 KB
test_23.txt AC 28 ms 1056 KB
test_24.txt AC 28 ms 1052 KB
test_25.txt AC 29 ms 1052 KB
test_26.txt AC 27 ms 1048 KB
test_27.txt AC 26 ms 1040 KB
test_28.txt AC 27 ms 1044 KB
test_29.txt AC 22 ms 796 KB
test_30.txt AC 21 ms 796 KB
test_31.txt AC 25 ms 868 KB
test_32.txt AC 21 ms 800 KB
test_33.txt AC 25 ms 944 KB
test_34.txt AC 22 ms 796 KB
test_35.txt AC 20 ms 920 KB
test_36.txt AC 27 ms 1052 KB
test_37.txt AC 28 ms 1052 KB
test_38.txt AC 28 ms 940 KB
test_39.txt AC 28 ms 1052 KB
test_40.txt AC 27 ms 1052 KB
test_41.txt AC 27 ms 1048 KB
test_42.txt AC 33 ms 1064 KB
test_43.txt AC 27 ms 1044 KB