Submission #6513990

---

Source Code Expand

import sys
sys.setrecursionlimit(1000000)
def input():
    return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from math import sqrt

R, C, D = map(int, input().split())
A = [list(map(int, input().split())) for i in range(R)]
q = deque()
q.append((0, 0))
visit = [[1] * C for i in range(R)]
visit[0][0] = 0
d = [[0] * C for i in range(R)]
Dy, Dx = [1, 0, -1, 0], [0, 1, 0, -1]
while q:
    y, x = q.popleft()
    for dy, dx in zip(Dy, Dx):
        ny, nx = y+dy, x+dx
        if 0 <= ny < R and 0 <= nx < C and visit[ny][nx]:
            q.append((ny, nx))
            visit[ny][nx] = 0
            d[ny][nx] = d[y][x]+1
ans = 0
for i in range(R):
    for j in range(C):
        t = D - d[i][j]
        if t >= 0 and t % 2 == 0:
            ans = max(ans, A[i][j])
print(ans)

Submission Info

Judge Result