Submission #1357125


Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;

int R,C,D;
int A[1005][1005],d[1005][1005];

int main(){

cin>>R>>C>>D;

for(int i=0; i<R; i++){
    for(int j=0; j<C; j++){
        scanf("%d",&A[i][j]); d[i][j]=i+j;
    }
}

int ans=0;
for(int i=0; i<R; i++){
    for(int j=0; j<C; j++){
        if(d[i][j]==D) ans=max(ans,A[i][j]);
        if(d[i][j]<D){
            if((i+j)%2==D%2) ans=max(ans,A[i][j]);
        }
    }
}

cout<<ans<<endl;

}

Submission Info

Submission Time
Task B - 謎の人物X
User momotaro1303
Language C++14 (GCC 5.4.1)
Score 100
Code Size 502 Byte
Status AC
Exec Time 89 ms
Memory 8064 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&A[i][j]); d[i][j]=i+j;
                             ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 60 / 60 40 / 40
Status
AC × 3
AC × 18
AC × 33
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 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_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 2 ms 2304 KB
sample_02.txt AC 2 ms 2304 KB
sample_03.txt AC 2 ms 2304 KB
subtask1_01.txt AC 2 ms 2304 KB
subtask1_02.txt AC 2 ms 2304 KB
subtask1_03.txt AC 2 ms 4736 KB
subtask1_04.txt AC 3 ms 4736 KB
subtask1_05.txt AC 2 ms 2304 KB
subtask1_06.txt AC 2 ms 4480 KB
subtask1_07.txt AC 3 ms 4736 KB
subtask1_08.txt AC 3 ms 4736 KB
subtask1_09.txt AC 3 ms 4736 KB
subtask1_10.txt AC 3 ms 4736 KB
subtask1_11.txt AC 3 ms 4736 KB
subtask1_12.txt AC 3 ms 4736 KB
subtask1_13.txt AC 3 ms 4736 KB
subtask1_14.txt AC 3 ms 4736 KB
subtask1_15.txt AC 3 ms 4736 KB
subtask2_01.txt AC 2 ms 2304 KB
subtask2_02.txt AC 4 ms 8064 KB
subtask2_03.txt AC 29 ms 6144 KB
subtask2_04.txt AC 2 ms 2304 KB
subtask2_05.txt AC 6 ms 4736 KB
subtask2_06.txt AC 17 ms 5248 KB
subtask2_07.txt AC 81 ms 8064 KB
subtask2_08.txt AC 89 ms 8064 KB
subtask2_09.txt AC 87 ms 8064 KB
subtask2_10.txt AC 89 ms 8064 KB
subtask2_11.txt AC 84 ms 8064 KB
subtask2_12.txt AC 88 ms 8064 KB
subtask2_13.txt AC 88 ms 8064 KB
subtask2_14.txt AC 88 ms 8064 KB
subtask2_15.txt AC 88 ms 8064 KB