Submission #171491


Source Code Expand

Copy
#include <cstdio>
#include <algorithm>

using namespace std;

int main(void)
{
  int h,w,d,a;
  int res = 0;
  scanf("%d%d%d",&h,&w,&d);
  for( int i = 0; i < h; i++ ) {
    for( int j = 0; j < w; j++ ) {
      scanf("%d",&a);
      if( d%2 == (i+j)%2 && i+j <= d ) {
        res = max(res,a);
      }
    }
  }
  printf("%d\n",res);
  return 0;
}

Submission Info

Submission Time
Task B - 謎の人物X
User roxion1377
Language C++ (G++ 4.6.4)
Score 100
Code Size 369 Byte
Status AC
Exec Time 160 ms
Memory 804 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:13:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, 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 23 ms 788 KB
sample_02.txt AC 23 ms 680 KB
sample_03.txt AC 19 ms 784 KB
subtask1_01.txt AC 19 ms 696 KB
subtask1_02.txt AC 22 ms 688 KB
subtask1_03.txt AC 19 ms 788 KB
subtask1_04.txt AC 20 ms 796 KB
subtask1_05.txt AC 20 ms 792 KB
subtask1_06.txt AC 20 ms 788 KB
subtask1_07.txt AC 21 ms 680 KB
subtask1_08.txt AC 20 ms 788 KB
subtask1_09.txt AC 20 ms 792 KB
subtask1_10.txt AC 20 ms 712 KB
subtask1_11.txt AC 20 ms 784 KB
subtask1_12.txt AC 22 ms 788 KB
subtask1_13.txt AC 20 ms 788 KB
subtask1_14.txt AC 20 ms 788 KB
subtask1_15.txt AC 19 ms 736 KB
subtask2_01.txt AC 18 ms 792 KB
subtask2_02.txt AC 34 ms 664 KB
subtask2_03.txt AC 64 ms 792 KB
subtask2_04.txt AC 18 ms 788 KB
subtask2_05.txt AC 23 ms 780 KB
subtask2_06.txt AC 41 ms 796 KB
subtask2_07.txt AC 137 ms 788 KB
subtask2_08.txt AC 156 ms 792 KB
subtask2_09.txt AC 149 ms 788 KB
subtask2_10.txt AC 157 ms 720 KB
subtask2_11.txt AC 146 ms 792 KB
subtask2_12.txt AC 160 ms 792 KB
subtask2_13.txt AC 155 ms 788 KB
subtask2_14.txt AC 154 ms 788 KB
subtask2_15.txt AC 153 ms 804 KB