Submission #171687


Source Code Expand

Copy
#include <stdio.h>
#define R (1000)
#define C (1000)
//#define D (2000)
int main(){
  int i, j;
  int r, c, d;
  short tile[R][C];
  short max = -1;
  scanf("%d %d %d", &r, &c, &d);

  for(i=0; i<r; i++) {
    for(j=0; j<c; j++) {
      scanf(" %d", &(tile[i][j]));
      //printf("%3d ", tile[i][j]);
    }
    //putchar('\n');
  }

  for(i=0; i<r; i++) {
    for(j=0; j<c; j++) {
      if( (i+j<=d) && (d%2 == ((i+j)%2)) ){
        if(max < tile[i][j])
          max = tile[i][j];
      }
    }
  }
  printf("%d\n", max);
  return 0;
}

Submission Info

Submission Time
Task B - 謎の人物X
User kuzumin
Language C (GCC 4.6.4)
Score 100
Code Size 566 Byte
Status AC
Exec Time 167 ms
Memory 2712 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:14:7: warning: format ‘%d’ expects argument of type ‘int *’, but argument 2 has type ‘short int *’ [-Wformat]
./Main.c:10:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:14:12: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 60 / 60 40 / 40
Status
AC × 3
AC × 18
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 21 ms 792 KB
sample_02.txt AC 21 ms 792 KB
sample_03.txt AC 19 ms 788 KB
subtask1_01.txt AC 19 ms 792 KB
subtask1_02.txt AC 20 ms 792 KB
subtask1_03.txt AC 21 ms 924 KB
subtask1_04.txt AC 22 ms 924 KB
subtask1_05.txt AC 19 ms 792 KB
subtask1_06.txt AC 21 ms 916 KB
subtask1_07.txt AC 22 ms 920 KB
subtask1_08.txt AC 23 ms 908 KB
subtask1_09.txt AC 22 ms 804 KB
subtask1_10.txt AC 26 ms 920 KB
subtask1_11.txt AC 20 ms 916 KB
subtask1_12.txt AC 19 ms 912 KB
subtask1_13.txt AC 23 ms 920 KB
subtask1_14.txt AC 22 ms 920 KB
subtask1_15.txt AC 21 ms 924 KB
subtask2_01.txt AC 18 ms 792 KB
subtask2_02.txt AC 23 ms 2712 KB
subtask2_03.txt AC 65 ms 1596 KB
subtask2_04.txt AC 22 ms 788 KB
subtask2_05.txt AC 25 ms 924 KB
subtask2_06.txt AC 45 ms 1192 KB
subtask2_07.txt AC 143 ms 2600 KB
subtask2_08.txt AC 158 ms 2600 KB
subtask2_09.txt AC 161 ms 2608 KB
subtask2_10.txt AC 162 ms 2604 KB
subtask2_11.txt AC 151 ms 2596 KB
subtask2_12.txt AC 166 ms 2600 KB
subtask2_13.txt AC 166 ms 2604 KB
subtask2_14.txt AC 167 ms 2588 KB
subtask2_15.txt AC 160 ms 2596 KB