Submission #317170


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<set>
#include<map>
#include<queue>
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cmath>
#include<ctime>
#include<cstring>
#include<cctype>
#include<cassert>
#include<limits>
#include<bitset>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
const int INF = 100000000;
const int MAX_N = 30000;
using namespace std;

typedef pair<int, int> P;
int N,S,E;
int time_s[MAX_N],time_e[MAX_N];

void init(){
  memset(time_s,0,MAX_N);
  memset(time_e,0,MAX_N);
}
int main(){
  int s_t,cnt;
  cin >> N;
  init();
  for(int i=0;i<N;i++){
    scanf("%d-%d",&S,&E);
    int rs = S % 5;
    int re = E % 5;
    S -= rs;
    E += (re==0) ? 0 : 5 - re;
    if(E%100==60){
      E +=40;
    }
    time_s[S]++;
    time_e[E]++;
  }
  cnt = 0;
  s_t = -1;
  for(int i=0;i<=2400;i++){
    if(cnt==0&&time_s[i]>0)s_t = i;
    cnt+=time_s[i]-time_e[i];
    if(cnt==0&&s_t!=-1){
      printf("%04d-%04d\n",s_t,i);
      s_t=-1;
    }
  }
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User yino
Language C++ (G++ 4.6.4)
Score 100
Code Size 1226 Byte
Status AC
Exec Time 39 ms
Memory 1136 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39: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 31 ms 1136 KB
00_sample_02.txt AC 26 ms 984 KB
00_sample_03.txt AC 28 ms 1024 KB
cho_cho_chokudai.txt AC 36 ms 948 KB
chokudai_ga_cho.txt AC 36 ms 956 KB
test_01.txt AC 27 ms 996 KB
test_02.txt AC 27 ms 1056 KB
test_03.txt AC 27 ms 956 KB
test_04.txt AC 26 ms 952 KB
test_05.txt AC 28 ms 952 KB
test_06.txt AC 26 ms 952 KB
test_07.txt AC 26 ms 1040 KB
test_08.txt AC 28 ms 952 KB
test_09.txt AC 27 ms 948 KB
test_10.txt AC 27 ms 956 KB
test_11.txt AC 28 ms 1052 KB
test_12.txt AC 29 ms 1048 KB
test_13.txt AC 28 ms 952 KB
test_14.txt AC 26 ms 952 KB
test_15.txt AC 28 ms 988 KB
test_16.txt AC 29 ms 1052 KB
test_17.txt AC 26 ms 1044 KB
test_18.txt AC 27 ms 1052 KB
test_19.txt AC 27 ms 1000 KB
test_20.txt AC 27 ms 1064 KB
test_21.txt AC 35 ms 988 KB
test_22.txt AC 37 ms 956 KB
test_23.txt AC 37 ms 996 KB
test_24.txt AC 36 ms 1052 KB
test_25.txt AC 37 ms 980 KB
test_26.txt AC 35 ms 948 KB
test_27.txt AC 36 ms 1040 KB
test_28.txt AC 37 ms 1040 KB
test_29.txt AC 26 ms 952 KB
test_30.txt AC 28 ms 1056 KB
test_31.txt AC 28 ms 948 KB
test_32.txt AC 27 ms 1052 KB
test_33.txt AC 34 ms 1008 KB
test_34.txt AC 28 ms 1060 KB
test_35.txt AC 27 ms 956 KB
test_36.txt AC 36 ms 952 KB
test_37.txt AC 35 ms 988 KB
test_38.txt AC 36 ms 956 KB
test_39.txt AC 39 ms 1128 KB
test_40.txt AC 36 ms 988 KB
test_41.txt AC 36 ms 1048 KB
test_42.txt AC 37 ms 1068 KB
test_43.txt AC 36 ms 1044 KB