AtCoder Beginner Contest 001

Submission #1152407

Source codeソースコード

#include <stdio.h>
////////////////////////
//たぶん考察と例外処理//
////////////////////////

void MergeSort( int n, int x[], int buffer[] ){
  
  int i, j;
  int k, m;
  
  //ブロックの大きさが1になるまでわける
  if( n <= 1 ){
    return;
  }
  
  //ブロックを2つに分ける
  m = n / 2;
  
  MergeSort(m, x, buffer);
  MergeSort(n - m, x + m, buffer);
  //ブロックを2つに分け終わる
  
  
  //buffer[0~m-1]にx[0~m-1]の値をコピー
  for( i = 0; i < m; i++ ){
     buffer[i] = x[i];
  }
  
  j = m;
  i = k = 0;
  
  while( i < m && j < n ){
    //buffer[0~m-1]とx[m~n-1]の先頭の値を比較し小さい方をx[k]に代入
    
    if( buffer[i] <= x[j]){//buffer[]の方が小さければx[k]に代入
       x[k] = buffer[i];
       k++;
       i++;//buffer[]を1つ進める
    }
    
    else{//x[]の方が小さければx[k]に代入
      x[k] = x[j];
      k++;
      j++;//x[]を1つ進める
    }
    
  }
  
  while( i < m ){
     x[k] = buffer[i];
     k++;
     i++;
  }
  
}



int main(void){
  
  int N;
  int i;
  
  
  scanf("%d", &N );
  
  int s[N];
  int e[N];
  char c;
  
  int buffer[N];
  int sort[N];
  
  for( i = 0; i < N; i++ ){
    scanf("%d%c%d", s+i, &c, e+i );
    if( s[i] % 5 ) s[i] -= s[i]%5;
    if( e[i] % 5 ) e[i] += (5 - (e[i]%5));
    if( e[i] % 100 == 60 ) e[i] += 40;
    sort[i] = 10000*s[i]+e[i];
  }
  
  MergeSort(N, sort, buffer);
  
  for( i = 0; i < N; i++ ){
    s[i] = sort[i]/10000;
    e[i] = sort[i]%10000;
  }
  
  int idx = 0;
  
  int ans[N];
  
  ans[idx] = s[0]*10000;
  
  int max = 0;
  
  for( i = 1; i < N; i++ ){ 
    
    if( e[i-1] > max ) max = e[i-1];
    
    if( s[i] > max ){
      ans[idx] += max;
      idx++;
      ans[idx] = s[i]*10000;
      max = 0;
    }
    
  }
  
  if( max < e[N-1] ) max = e[N-1];
  ans[idx] += max;
  
  /*for( i = 0; i < N; i++ )
    printf("%d-%d\n", s[i], e[i]);
  */
  
  for( i = 0; i <= idx; i++ ){
    
    if( !( (ans[i]/10000)/10) )  printf("0");
    if( !( (ans[i]/10000)/100) ) printf("0");
    if( !( (ans[i]/10000)/1000) )printf("0");
    printf("%d-", ans[i]/10000 );
    if( !( (ans[i]%10000)/10) )  printf("0");
    if( !( (ans[i]%10000)/100) ) printf("0");
    if( !( (ans[i]%10000)/1000) )printf("0");
    printf("%d\n", ans[i]%10000);
  }
  
  return 0;
  
}

Submission

Task問題 D - 感雨時刻の整理
User nameユーザ名 ゆうき
Created time投稿日時
Language言語 C (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 2475 Byte
File nameファイル名
Exec time実行時間 9 ms
Memory usageメモリ使用量 640 KB

Compiler messageコンパイルメッセージ

./Main.c: In function ‘main’:
./Main.c:65:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &N );
^
./Main.c:75:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%c%d", s+i, &c, e+i );
^

Test case

Set

Set name Score得点 / Max score Cases
all 100 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_sample_01.txt AC 1 ms 128 KB
00_sample_02.txt AC
00_sample_03.txt AC 1 ms 128 KB
cho_cho_chokudai.txt AC 7 ms 640 KB
chokudai_ga_cho.txt AC 7 ms 640 KB
test_01.txt AC 1 ms 128 KB
test_02.txt AC 1 ms 128 KB
test_03.txt AC 1 ms 128 KB
test_04.txt AC 1 ms 128 KB
test_05.txt AC 1 ms 128 KB
test_06.txt AC 1 ms 128 KB
test_07.txt AC 1 ms 128 KB
test_08.txt AC 1 ms 128 KB
test_09.txt AC 1 ms 128 KB
test_10.txt AC 1 ms 128 KB
test_11.txt AC 1 ms 128 KB
test_12.txt AC 1 ms 128 KB
test_13.txt AC 1 ms 128 KB
test_14.txt AC 1 ms 128 KB
test_15.txt AC 1 ms 128 KB
test_16.txt AC 1 ms 128 KB
test_17.txt AC 1 ms 128 KB
test_18.txt AC 1 ms 128 KB
test_19.txt AC 1 ms 128 KB
test_20.txt AC 1 ms 128 KB
test_21.txt AC 9 ms 640 KB
test_22.txt AC 9 ms 640 KB
test_23.txt AC 9 ms 640 KB
test_24.txt AC 9 ms 640 KB
test_25.txt AC 9 ms 640 KB
test_26.txt AC 9 ms 512 KB
test_27.txt AC 7 ms 512 KB
test_28.txt AC 9 ms 640 KB
test_29.txt AC 1 ms 128 KB
test_30.txt AC 1 ms 128 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC
test_33.txt AC 6 ms 384 KB
test_34.txt AC
test_35.txt AC 1 ms 128 KB
test_36.txt AC 9 ms 640 KB
test_37.txt AC 9 ms 512 KB
test_38.txt AC 9 ms 640 KB
test_39.txt AC 9 ms 640 KB
test_40.txt AC 9 ms 640 KB
test_41.txt AC 7 ms 640 KB
test_42.txt AC 8 ms 640 KB
test_43.txt AC 7 ms 512 KB