Submission #9110398

---

Source Code Expand

import heapq
que = []
N = 30
A = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
    for j in range(N):
        heapq.heappush(que, (-A[i][j], i, j))
dire = [(0, 1), (1, 0), (0, -1), (-1, 0)]
def search(a, x, y):
    if a == 0:
        return
    for dx, dy in dire:
        if 0<=x+dx<N and 0<=y+dy<N:
            if A[x+dx][y+dy] == a:
                print(x+dx+1, y+dy+1)
                A[x+dx][y+dy]-=1
                search(a-1, x+dx, y+dy)
                return
    return

while que:
    a, i, j = heapq.heappop(que)
    a = -a
    if A[i][j] != a:
        if A[i][j]>0:
            heapq.heappush(que, (-A[i][j], i, j))
        continue
    print(i+1, j+1)
    a-=1
    A[i][j]-=1
    search(a, i, j)
    if a>0:
        heapq.heappush(que, (-a, i, j))

Submission Info

Judge Result