結果

問題 No.2731 Two Colors
ユーザー flygon
提出日時 2024-04-19 21:51:51
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,074 ms / 3,000 ms
コード長 1,340 bytes
コンパイル時間 215 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 113,280 KB
最終ジャッジ日時 2024-10-11 14:49:53
合計ジャッジ時間 20,866 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd
h,w = map(int,input().split())
a = [list(map(int,input().split())) for i in range(h)]
col = [[-1]*(w) for i in range(h)]
r = [(a[0][0],0*w+0)]
b = [(a[-1][-1],(h-1)*w+(w-1))]
dx = [1,-1,0,0]
dy = [0,0,1,-1]
for i in range(h*w+10):
if i % 2 == 0:
while r:
num, crr = heappop(r)
x, y = crr//w, crr%w
if col[x][y] == -1:
col[x][y] = 1
break
for j in range(4):
nx = x+dx[j]
ny = y+dy[j]
if not (0<=nx<h and 0<=ny<w):continue
if col[nx][ny] == 0:
print(i-1)
exit()
heappush(r, (a[nx][ny],nx*w+ny))
else:
while b:
num, crr = heappop(b)
x, y = crr//w, crr%w
if col[x][y] == -1:
col[x][y] = 0
break
for j in range(4):
nx = x+dx[j]
ny = y+dy[j]
if not (0<=nx<h and 0<=ny<w):continue
if col[nx][ny] == 1:
print(i-1)
exit()
heappush(b, (a[nx][ny], nx*w+ny))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0