Submission #10343524


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 and j+p < h and i+q >= 0 and i+q < w:
                        x = j+p
                        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 200
Code Size 521 Byte
Status AC
Exec Time 33 ms
Memory 3188 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
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 26 ms 3064 KB
subtask_1_10.txt AC 33 ms 3188 KB
subtask_1_11.txt AC 18 ms 3060 KB
subtask_1_12.txt AC 17 ms 3064 KB
subtask_1_2.txt AC 17 ms 3064 KB
subtask_1_3.txt AC 21 ms 3060 KB
subtask_1_4.txt AC 17 ms 3060 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 19 ms 3064 KB
subtask_1_9.txt AC 17 ms 3064 KB