Submission #3622511


Source Code Expand

import copy
H, W = map(int, input().split())
S = [input() for i in range(H)]
dd = ((-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1), (1, 0), (1, 1), (0, 1))
T = copy.deepcopy(S)
count = 0
for i in range(H):
    for j in range(W):
        if S[i][j] == '#':
            continue
        for dx, dy in dd:
            nx = j + dx; ny = i + dy
            if 0 <= nx < W and 0 <= ny < H:
                if S[ny][nx] == '#':
                    count += 1
        T[i] = list(T[i])
        T[i][j] = str(count)
        T[i] = "".join(T[i])
        count = 0
for k in range(len(T)):
    print(T[k])

Submission Info

Submission Time
Task B - Minesweeper
User yosho
Language Python (3.4.3)
Score 200
Code Size 614 Byte
Status AC
Exec Time 37 ms
Memory 3440 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 23 ms 3440 KB
sample_02.txt AC 22 ms 3440 KB
sample_03.txt AC 22 ms 3440 KB
subtask_1_1.txt AC 30 ms 3440 KB
subtask_1_10.txt AC 37 ms 3440 KB
subtask_1_11.txt AC 22 ms 3440 KB
subtask_1_12.txt AC 22 ms 3440 KB
subtask_1_2.txt AC 22 ms 3440 KB
subtask_1_3.txt AC 25 ms 3440 KB
subtask_1_4.txt AC 22 ms 3440 KB
subtask_1_5.txt AC 22 ms 3440 KB
subtask_1_6.txt AC 22 ms 3440 KB
subtask_1_7.txt AC 22 ms 3440 KB
subtask_1_8.txt AC 24 ms 3440 KB
subtask_1_9.txt AC 22 ms 3440 KB