Submission #9114356


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 eval(a, x, y):
    if a == 0:
        return 0
    v = 0
    for dx, dy in dire:
        if 0<=x+dx<N and 0<=y+dy<N:
            if A[x+dx][y+dy] == a:
                v+=1
    return v

def search(a, x, y):
    if a == 0:

        return
    candidate = []
    for dx, dy in dire:
        if 0<=x+dx<N and 0<=y+dy<N:
            if A[x+dx][y+dy] == a:
                candidate.append((eval(a-1, x+dx, y+dy), x+dx, y+dy))
    if not candidate:
        return
    v, x, y = max(candidate)
    print(x+1, y+1)
    search(a-1, x, y)
    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

Submission Time
Task A - 高橋君の山崩しゲーム
User masayoshi64
Language PyPy3 (2.4.0)
Score 0
Code Size 1094 Byte
Status WA
Exec Time 680 ms
Memory 75608 KB

Judge Result

Set Name test_01 test_02 test_03 test_04 test_05 test_06 test_07 test_08 test_09 test_10
Score / Max Score 0 / 100000 0 / 100000 0 / 100000 0 / 100000 0 / 100000 0 / 100000 0 / 100000 0 / 100000 0 / 100000 0 / 100000
Status
WA × 1
WA × 1
WA × 1
WA × 1
WA × 1
WA × 1
WA × 1
WA × 1
WA × 1
WA × 1
Set Name Test Cases
test_01 subtask_01_01.txt
test_02 subtask_01_02.txt
test_03 subtask_01_03.txt
test_04 subtask_01_04.txt
test_05 subtask_01_05.txt
test_06 subtask_01_06.txt
test_07 subtask_01_07.txt
test_08 subtask_01_08.txt
test_09 subtask_01_09.txt
test_10 subtask_01_10.txt
Case Name Status Exec Time Memory
subtask_01_01.txt WA 645 ms 72664 KB
subtask_01_02.txt WA 655 ms 73688 KB
subtask_01_03.txt WA 649 ms 73944 KB
subtask_01_04.txt WA 665 ms 73944 KB
subtask_01_05.txt WA 631 ms 72664 KB
subtask_01_06.txt WA 671 ms 75224 KB
subtask_01_07.txt WA 659 ms 75352 KB
subtask_01_08.txt WA 638 ms 72536 KB
subtask_01_09.txt WA 658 ms 75228 KB
subtask_01_10.txt WA 680 ms 75608 KB