# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647080 | beaconmc | The Kingdom of JOIOI (JOI17_joioi) | Pypy 3 | 49 ms | 19476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
n,m = map(int, input().split())
grid = [list(map(int, input().split()))for i in range(n)]
minmaxl = [[[float("inf"), -1]for i in range(m)]for i in range(n)]
for i in range(n-1,-1,-1):
minmaxl[i][0] = [grid[i][0], grid[i][0]]
for j in range(1,m):
minmaxl[i][j][0] = min(minmaxl[i][j-1][0], grid[i][j])
minmaxl[i][j][1] = max(minmaxl[i][j-1][1], grid[i][j])
if i != n-1:
for j in range(m):
minmaxl[i][j][0] = min(minmaxl[i][j][0], minmaxl[i+1][j][0])
minmaxl[i][j][1] = max(minmaxl[i][j][1], minmaxl[i+1][j][1])
minmaxr = [[[float("inf"), -1]for i in range(m)]for i in range(n)]
for i in range(n-1,-1,-1):
minmaxr[i][m-1] = [grid[i][m-1], grid[i][m-1]]
for j in range(m-2,-1,-1):
minmaxr[i][j][0] = min(minmaxr[i][j+1][0], grid[i][j])
minmaxr[i][j][1] = max(minmaxr[i][j+1][1], grid[i][j])
if i != n-1:
for j in range(m-1,-1,-1):
minmaxr[i][j][0] = min(minmaxr[i][j][0], minmaxr[i+1][j][0])
minmaxr[i][j][1] = max(minmaxr[i][j][1], minmaxr[i+1][j][1])
def check(a):
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |