제출 #647080

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
647080	2022-10-01 14:33:01	beaconmc	The Kingdom of JOIOI (JOI17_joioi)	Pypy 3	0 / 100	49 ms	19476 KiB

joioi

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
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):
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 15
• Subtask 2: 0 / 45
• Subtask 3: 0 / 40