Submission #1514348
Source Code Expand
//#define _GRIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; #define int long long int field[2001][2001]; signed main() { int r, c, d; cin >> r >> c >> d; for(int i=0; i<r; ++i) for(int j=0; j<c; ++j) cin >> field[i][j]; bool is_odd = d%2 ? true : false; int ans = -1; for(int i=0; i<d; ++i) { for(int j=0; j<d; ++j) { if(is_odd&&(i+j)%2!=0) ans = max(ans, field[i][j]); else if(!is_odd&&(i+j)%2==0) ans = max(ans, field[i][j]); } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 謎の人物X |
User | noconocolib |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 591 Byte |
Status | WA |
Exec Time | 223 ms |
Memory | 16128 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 60 | 0 / 40 | ||||||||||||
Status |
|
|
|
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 | WA | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | WA | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 640 KB |
subtask1_04.txt | AC | 3 ms | 640 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | WA | 2 ms | 512 KB |
subtask1_07.txt | AC | 3 ms | 640 KB |
subtask1_08.txt | AC | 3 ms | 768 KB |
subtask1_09.txt | WA | 3 ms | 768 KB |
subtask1_10.txt | AC | 4 ms | 768 KB |
subtask1_11.txt | AC | 3 ms | 768 KB |
subtask1_12.txt | AC | 4 ms | 768 KB |
subtask1_13.txt | AC | 4 ms | 768 KB |
subtask1_14.txt | AC | 3 ms | 768 KB |
subtask1_15.txt | AC | 4 ms | 768 KB |
subtask2_01.txt | AC | 2 ms | 256 KB |
subtask2_02.txt | AC | 5 ms | 15104 KB |
subtask2_03.txt | AC | 68 ms | 7680 KB |
subtask2_04.txt | AC | 3 ms | 384 KB |
subtask2_05.txt | WA | 10 ms | 896 KB |
subtask2_06.txt | AC | 40 ms | 3456 KB |
subtask2_07.txt | AC | 153 ms | 16128 KB |
subtask2_08.txt | WA | 211 ms | 16128 KB |
subtask2_09.txt | WA | 223 ms | 16128 KB |
subtask2_10.txt | WA | 214 ms | 16128 KB |
subtask2_11.txt | AC | 179 ms | 16128 KB |
subtask2_12.txt | AC | 209 ms | 16128 KB |
subtask2_13.txt | AC | 212 ms | 16128 KB |
subtask2_14.txt | AC | 216 ms | 16128 KB |
subtask2_15.txt | AC | 212 ms | 16128 KB |