Submission #2214248


Source Code Expand

H, W = map(int, input().split())


ans = []
for i in range(H):
    ans.append([])
    row = input()
    for j in row:
        ans[-1].append(j)

dxy = [(-1,-1),(-1,0),(-1,1),(0,-1),(0,1),(1,-1),(1,0),(1,1)]

for y in range(H):
    for x in range(W):
        if ans[y][x] == '#':
            continue
        c = 0
        for dx, dy in dxy:
            if x+dx<0 or x+dx>W-1 or y+dy<0 or y+dy>H-1:
                continue
            if ans[y+dy][x+dx] == '#':
                c += 1
            ans[y][x] = c
        
for row in ans:
    print(''.join(list(map(str, row))))

Submission Info

Submission Time
Task B - Minesweeper
User eagle_i
Language Python (3.4.3)
Score 0
Code Size 600 Byte
Status WA
Exec Time 31 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 3
AC × 14
WA × 1
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 17 ms 3064 KB
sample_02.txt AC 17 ms 3064 KB
sample_03.txt AC 17 ms 3064 KB
subtask_1_1.txt AC 25 ms 3064 KB
subtask_1_10.txt AC 31 ms 3064 KB
subtask_1_11.txt AC 18 ms 3064 KB
subtask_1_12.txt AC 17 ms 3064 KB
subtask_1_2.txt AC 17 ms 3064 KB
subtask_1_3.txt AC 20 ms 3064 KB
subtask_1_4.txt AC 17 ms 3064 KB
subtask_1_5.txt AC 17 ms 3064 KB
subtask_1_6.txt AC 17 ms 3064 KB
subtask_1_7.txt AC 17 ms 3064 KB
subtask_1_8.txt AC 18 ms 3064 KB
subtask_1_9.txt WA 17 ms 3064 KB