백준 2468 - 안전 영역

123456789101112131415161718192021222324252627282930313233from collections import dequeimport sys n = int(sys.stdin.readline())graph = [list(map(int,sys.stdin.readline().split())) for _ in range(n)] def bfs(i,j,k,visit): q = deque() q.append((k,j)) visit[j][k] = 1 while q: x,y = q.popleft() for dx,dy in (0,1),(0,-1),(1,0),(-1,0): nx, ny = x+dx, y+dy if nx < 0 or nx >= n or ny < 0 or ny >= n: continue if visit[ny][nx] == 0 and graph[ny][nx] > i: q.append((nx, ny)) visit[ny][nx] = 1 ans = []for i in range(max(map(max,graph))): cnt = 0 visit = [[0] * n for _ in range(n)] for j in ra..........

원문링크 : 백준 2468 - 안전 영역