Submission #108238


Source Code Expand

#include <cstdio>
#include <map>
#include <algorithm>

using namespace std;

int res[111111] = {};
int main(void)
{
  int n,s,e;
  pair<int,int> a[33333];
  scanf("%d",&n);
  for( int i = 0; i < n; i++ ) {
    scanf("%d-%d",&s,&e);
    s = s/100*60*60+s%100*60;
    s -= s%300;
    e = e/100*60*60+e%100*60;
    e += 299;
    e -= e%300;
    //printf("%d %d\n",s,e);
    //printf("%d:%d %d:%d\n",s/3600,s%3600/60,e/3600,e%3600/60);
    a[i] = make_pair(s,e);
  }
  for( int i = 0; i < n; i++ ) {
    /*
    for( int j = a[i].first; j <= a[i].second; j++ ) {
      res[j] = 1;
    }
    */
    res[a[i].first] += 1;
    res[a[i].second+1] += -1;
  }
  for( int i = 0; i <= 86400; i++ ) {
    res[i+1] += res[i];
  }
  for( int i = 0; i <= 86400; i++ ) {
    if( res[i] ) {
      int t = i;
      while( res[i] ) i++;
      printf("%02d%02d-%02d%02d\n",t/3600,t%3600/60,(i-1)/3600,(i-1)%3600/60);
    }
  }
  return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User roxion1377
Language C++ (G++ 4.6.4)
Score 100
Code Size 963 Byte
Status AC
Exec Time 32 ms
Memory 1444 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:14:25: 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 21 ms 1316 KB
00_sample_02.txt AC 20 ms 1436 KB
00_sample_03.txt AC 20 ms 1316 KB
cho_cho_chokudai.txt AC 29 ms 1308 KB
chokudai_ga_cho.txt AC 30 ms 1248 KB
test_01.txt AC 20 ms 1312 KB
test_02.txt AC 22 ms 1248 KB
test_03.txt AC 21 ms 1316 KB
test_04.txt AC 22 ms 1316 KB
test_05.txt AC 22 ms 1316 KB
test_06.txt AC 20 ms 1436 KB
test_07.txt AC 20 ms 1312 KB
test_08.txt AC 22 ms 1188 KB
test_09.txt AC 22 ms 1268 KB
test_10.txt AC 20 ms 1248 KB
test_11.txt AC 21 ms 1312 KB
test_12.txt AC 22 ms 1192 KB
test_13.txt AC 21 ms 1440 KB
test_14.txt AC 22 ms 1316 KB
test_15.txt AC 20 ms 1444 KB
test_16.txt AC 20 ms 1444 KB
test_17.txt AC 20 ms 1440 KB
test_18.txt AC 21 ms 1320 KB
test_19.txt AC 21 ms 1436 KB
test_20.txt AC 22 ms 1188 KB
test_21.txt AC 31 ms 1324 KB
test_22.txt AC 30 ms 1324 KB
test_23.txt AC 31 ms 1308 KB
test_24.txt AC 31 ms 1312 KB
test_25.txt AC 28 ms 1308 KB
test_26.txt AC 31 ms 1312 KB
test_27.txt AC 30 ms 1248 KB
test_28.txt AC 31 ms 1320 KB
test_29.txt AC 21 ms 1316 KB
test_30.txt AC 21 ms 1316 KB
test_31.txt AC 23 ms 1320 KB
test_32.txt AC 24 ms 1320 KB
test_33.txt AC 27 ms 1308 KB
test_34.txt AC 22 ms 1320 KB
test_35.txt AC 22 ms 1324 KB
test_36.txt AC 31 ms 1204 KB
test_37.txt AC 29 ms 1316 KB
test_38.txt AC 30 ms 1320 KB
test_39.txt AC 31 ms 1312 KB
test_40.txt AC 31 ms 1304 KB
test_41.txt AC 32 ms 1248 KB
test_42.txt AC 31 ms 1316 KB
test_43.txt AC 30 ms 1324 KB