from collections import deque import copy def solution(N, board): direction = ([-1, 0], [1, 0], [0, -1], [0, 1]) time = 5 queue = deque([[board, time]]) max = 0 while queue: cur, t = queue.popleft() if t == 0: for i in range(N): for j in range(N): if cur[i][j] > max: max = cur[i][j] continue for dx, dy in direction: diff = copy.deepcopy(cur) if dx == -1: for i in range(N): for j in range(N): if diff[i][j] > 0: ri, rj = i, j while True: if 0 <= ri + dx < N and 0 <= rj + dy < N: if diff[ri + dx][rj + dy] > 0: if diff[ri + dx][rj + dy] == diff[i][j]: diff[ri + dx][rj + dy] *= 2 diff[i][j] = 0 else: diff[ri][rj], diff[i][j] = diff[i][j], diff[ri][rj] break else: ri += dx rj += dy else: diff[ri][rj], diff[i][j] = diff[i][j], diff[ri][rj] break elif dx == 1: for i in range(N-1, -1, -1): for j in range(N): if diff[i][j] > 0: ri, rj = i, j while True: if 0 <= ri + dx < N and 0 <= rj + dy < N: if diff[ri + dx][rj + dy] > 0: if diff[ri + dx][rj + dy] == diff[i][j]: diff[ri + dx][rj + dy] *= 2 diff[i][j] = 0 else: diff[ri][rj], diff[i][j] = diff[i][j], diff[ri][rj] break else: ri += dx rj += dy else: diff[ri][rj], diff[i][j] = diff[i][j], diff[ri][rj] break elif dy == -1: for i in range(N): for j in range(N): if diff[j][i] > 0: ri, rj = i, j while True: if 0 <= rj + dx < N and 0 <= ri + dy < N: if diff[rj + dx][ri + dy] > 0: if diff[rj + dx][ri + dy] == diff[j][i]: diff[rj + dx][ri + dy] *= 2 diff[j][i] = 0 else: diff[rj][ri], diff[j][i] = diff[j][i], diff[rj][ri] break else: rj += dx ri += dy else: diff[rj][ri], diff[j][i] = diff[j][i], diff[rj][ri] break elif dy == 1: for i in range(N-1, -1, -1): for j in range(N): if diff[j][i] > 0: # print(j, i) ri, rj = i, j while True: if 0 <= rj + dx < N and 0 <= ri + dy < N: if diff[rj + dx][ri + dy] > 0: if diff[rj + dx][ri + dy] == diff[j][i]: diff[rj + dx][ri + dy] *= 2 diff[j][i] = 0 else: diff[rj][ri], diff[j][i] = diff[j][i], diff[rj][ri] break else: rj += dx ri += dy else: diff[rj][ri], diff[j][i] = diff[j][i], diff[rj][ri] break # print(diff) # print(t, diff) queue.append([diff, t - 1]) return max N = int(input()) board = [] for _ in range(N): board.append(list(map(int, input().split()))) print(solution(N, board))

제출 #57009

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: