Submission #1680042

---

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) {
            if (i + j > d) {
                continue;
            }
            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

Judge Result