Submission #1680031


Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;

int r, c, d;
int a[1010][1010];

int main() {
    cin >> r >> c >> d;
    imfor(i, r) {
        imfor(j, c) {
            cin >> a[i][j];
        }
    }
    int ans = -1;
    int rr = min(r, d + 1);
    int cc = min(c, d + 1);
    imfor(i, rr) {
        imfor(j, cc - i) {
            if (d % 2 == 0) {
                if ((i + j) % 2 == 0) {
                    ans = max(ans, a[i][j]);
                }
            }
            else {
                if ((i + j) % 2 != 0) {
                    ans = max(ans, a[i][j]);
                }
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task B - 謎の人物X
User imaizumi14
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1053 Byte
Status WA
Exec Time 262 ms
Memory 4224 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 60 0 / 40
Status
AC × 3
AC × 13
WA × 5
AC × 27
WA × 6
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 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt WA 2 ms 640 KB
subtask1_04.txt AC 4 ms 640 KB
subtask1_05.txt AC 2 ms 256 KB
subtask1_06.txt AC 2 ms 384 KB
subtask1_07.txt WA 4 ms 640 KB
subtask1_08.txt AC 3 ms 640 KB
subtask1_09.txt AC 4 ms 640 KB
subtask1_10.txt WA 4 ms 640 KB
subtask1_11.txt WA 4 ms 640 KB
subtask1_12.txt AC 4 ms 640 KB
subtask1_13.txt WA 4 ms 640 KB
subtask1_14.txt AC 4 ms 640 KB
subtask1_15.txt AC 4 ms 640 KB
subtask2_01.txt AC 2 ms 256 KB
subtask2_02.txt WA 4 ms 4224 KB
subtask2_03.txt AC 83 ms 2048 KB
subtask2_04.txt AC 3 ms 256 KB
subtask2_05.txt AC 12 ms 640 KB
subtask2_06.txt AC 44 ms 1152 KB
subtask2_07.txt AC 175 ms 4224 KB
subtask2_08.txt AC 261 ms 4224 KB
subtask2_09.txt AC 253 ms 4224 KB
subtask2_10.txt AC 257 ms 4224 KB
subtask2_11.txt AC 212 ms 4224 KB
subtask2_12.txt AC 262 ms 4224 KB
subtask2_13.txt AC 256 ms 4224 KB
subtask2_14.txt AC 262 ms 4224 KB
subtask2_15.txt AC 257 ms 4224 KB