Submission #134909


Source Code Expand

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int i,j;
int main(){
  int n;
  char s[30000][10];
  char c[3] = " -";
  char *num;
  int start[30000],end[30000];
  int ans[3000];
  int ans_st,ans_ed;
  scanf("%d",&n);

  for(i=0;i<3000;i++)
    ans[i]=0;
  for(i=0;i<n;i++){
    scanf("%s",s[i]);
    num=s[i];
    start[i]=atoi(strtok(s[i],c));
    end[i]=atoi(strtok(NULL,c));
  }

  //printf("\n");
  for(i=0;i<n;i++){
    if(start[i]%5==0){
    }else{
      start[i]=(start[i]/5)*5;
    }
    if(end[i]%5==0){
    }else{
      end[i]=(end[i]/5)*5+5;
      if(end[i]%100 == 60)
	end[i]+=40;
    }
  }
 
  for(i=0;i<n;i++){
    for(j=start[i];j<=end[i];j++){
      ans[j]=1;
    }
  }

  /*for(i=0;i<3000;i++)
    printf("%d",ans[i]);
    printf("\n");*/

  for(i=0;i<3000;i++){
    if(ans[i]==1 && (ans[i-1]==0 || i == 0)){
      ans_st=i;
      if(i<1000)
	printf("0");
      if(i<100)
	printf("0");
      if(i<10)
	printf("0");
      printf("%d-",ans_st);
    }
    if(ans[i]==1 && (ans[i+1]==0 || i == 3000)){
      ans_ed=i;
      if(i<1000)
	printf("0");
      if(i<100)
	printf("0");
      if(i<10)
	printf("0");
      printf("%d\n",ans_ed);
    }
  }

  return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User Tanix
Language C (GCC 4.6.4)
Score 100
Code Size 1260 Byte
Status AC
Exec Time 115 ms
Memory 1308 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:13:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:18:10: warning: ignoring return value of ‘scanf’, 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 23 ms 800 KB
00_sample_02.txt AC 22 ms 796 KB
00_sample_03.txt AC 22 ms 804 KB
cho_cho_chokudai.txt AC 115 ms 1256 KB
chokudai_ga_cho.txt AC 61 ms 1256 KB
test_01.txt AC 23 ms 792 KB
test_02.txt AC 23 ms 800 KB
test_03.txt AC 22 ms 796 KB
test_04.txt AC 22 ms 808 KB
test_05.txt AC 24 ms 736 KB
test_06.txt AC 24 ms 792 KB
test_07.txt AC 23 ms 752 KB
test_08.txt AC 23 ms 740 KB
test_09.txt AC 24 ms 800 KB
test_10.txt AC 23 ms 796 KB
test_11.txt AC 23 ms 796 KB
test_12.txt AC 25 ms 800 KB
test_13.txt AC 24 ms 800 KB
test_14.txt AC 26 ms 776 KB
test_15.txt AC 25 ms 728 KB
test_16.txt AC 26 ms 780 KB
test_17.txt AC 26 ms 764 KB
test_18.txt AC 23 ms 796 KB
test_19.txt AC 23 ms 752 KB
test_20.txt AC 26 ms 796 KB
test_21.txt AC 39 ms 1256 KB
test_22.txt AC 48 ms 1256 KB
test_23.txt AC 40 ms 1256 KB
test_24.txt AC 47 ms 1256 KB
test_25.txt AC 42 ms 1268 KB
test_26.txt AC 34 ms 1264 KB
test_27.txt AC 34 ms 1260 KB
test_28.txt AC 35 ms 1260 KB
test_29.txt AC 25 ms 728 KB
test_30.txt AC 22 ms 804 KB
test_31.txt AC 24 ms 884 KB
test_32.txt AC 23 ms 800 KB
test_33.txt AC 31 ms 1180 KB
test_34.txt AC 22 ms 804 KB
test_35.txt AC 23 ms 748 KB
test_36.txt AC 54 ms 1260 KB
test_37.txt AC 35 ms 1252 KB
test_38.txt AC 34 ms 1260 KB
test_39.txt AC 36 ms 1256 KB
test_40.txt AC 36 ms 1260 KB
test_41.txt AC 75 ms 1256 KB
test_42.txt AC 75 ms 1308 KB
test_43.txt AC 74 ms 1256 KB