Submission #10343463


Source Code Expand

h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]

for i in range(w):
    for j in range(h):
        if s[j][i] == ".":
            c = 0
            for p in range(-1, 2):
                for q in range(-1, 2):
                    if j+p < 0:
                        x = 0
                    elif j+p >= h:
                        x = h-1
                    else:
                        x = j+p
                    
                    if i+q < 0:
                        y = 0
                    elif i+q >= w:
                        y = w-1
                    else:
                        y = i+q
                    if s[x][y]=="#":
                        c += 1
            s[j][i] = str(c)
for i in s:
    print("".join(i))

Submission Info

Submission Time
Task B - Minesweeper
User kkiizz
Language Python (3.4.3)
Score 0
Code Size 784 Byte
Status WA
Exec Time 34 ms
Memory 3188 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 2
WA × 1
AC × 6
WA × 9
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 WA 17 ms 3064 KB
subtask_1_1.txt WA 27 ms 3064 KB
subtask_1_10.txt AC 34 ms 3188 KB
subtask_1_11.txt AC 18 ms 3064 KB
subtask_1_12.txt AC 17 ms 3064 KB
subtask_1_2.txt WA 17 ms 3064 KB
subtask_1_3.txt WA 21 ms 3064 KB
subtask_1_4.txt WA 18 ms 3064 KB
subtask_1_5.txt WA 17 ms 3064 KB
subtask_1_6.txt WA 18 ms 3064 KB
subtask_1_7.txt WA 17 ms 3064 KB
subtask_1_8.txt WA 19 ms 3064 KB
subtask_1_9.txt AC 17 ms 3064 KB