제출 #647107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
647107		beaconmc	The Kingdom of JOIOI (JOI17_joioi)	C++14	컴파일 에러	0 ms	0 KiB

joioi

from copy import *
n,m = map(int, input().split())

grid = [list(map(int, input().split()))for i in range(n)]
grid2 = [[0 for i in range(m)]for i in range(n)]

mx = -1
for i in range(n):
    for j in range(m):
        mx = max(mx, grid[i][j])
        grid2[i][j] = grid[n-i-1][m-j-1]


minmaxl = [[[float("inf"), -1]for i in range(m)]for i in range(n)]
minmaxr = [[[float("inf"), -1]for i in range(m)]for i in range(n)]
def setup():
    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])

    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):

    mini = float("inf")
    maxi = -1
    for i in range(n):
        for j in range(m):
            if mx - minmaxl[i][j][0] > a:
                mini = min(mini, grid[i][j])
                maxi = max(maxi, grid[i][j])
    if maxi - mini <= a:
        return True
    

    mini = float("inf")
    maxi = -1
    for i in range(n):
        for j in range(m):
            if mx - minmaxr[i][j][0] > a:
                mini = min(mini, grid[i][j])
                maxi = max(maxi, grid[i][j])
    if maxi - mini <= a:
        return True
    return False

setup()
lo = 0
hi = 10000000000
while (lo<hi):
    mid = (lo+hi)//2
    if check(mid):
        hi = mid
    else:
        lo = mid+1
ans = lo
grid = deepcopy(grid2)

setup()
lo = 0
hi = 10000000000

while (lo<hi):
    mid = (lo+hi)//2
    if check(mid):
        hi = mid
    else:
        lo = mid+1
print(min(ans,lo))

    

컴파일 시 표준 에러 (stderr) 메시지

joioi.cpp:1:1: error: 'from' does not name a type
    1 | from copy import *
      | ^~~~