Submission #1793401


Source Code Expand

#入力
H, W = [int(i) for i in input().split()]
map = []
for i in range(H):
    line = input()
    map.append(line)

tmp = [[0 for i in range(W+2)] for j in range(H+2)]
for i in range(H):
    for j in range(W):
        if map[i][j]=='#':
            tmp[i][j]+=1
            tmp[i][j+1]+=1
            tmp[i][j+2]+=1
            tmp[i+1][j+2]+=1
            tmp[i+2][j+2]+=1
            tmp[i+2][j+1]+=1
            tmp[i+2][j]+=1
            tmp[i+1][j]+=1
            
for i in range(H):
    for j in range(W):
        if map[i][j]=='#':
            tmp[i+1][j+1]='#'
        print(str(tmp[i+1][j+1]), end='')
    print('\n')

Submission Info

Submission Time
Task B - Minesweeper
User muta
Language Python (3.4.3)
Score 200
Code Size 653 Byte
Status AC
Exec Time 25 ms
Memory 3444 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 18 ms 3064 KB
sample_02.txt AC 18 ms 3064 KB
sample_03.txt AC 18 ms 3064 KB
subtask_1_1.txt AC 23 ms 3444 KB
subtask_1_10.txt AC 22 ms 3444 KB
subtask_1_11.txt AC 25 ms 3444 KB
subtask_1_12.txt AC 18 ms 3064 KB
subtask_1_2.txt AC 18 ms 3064 KB
subtask_1_3.txt AC 20 ms 3188 KB
subtask_1_4.txt AC 18 ms 3064 KB
subtask_1_5.txt AC 18 ms 3064 KB
subtask_1_6.txt AC 18 ms 3064 KB
subtask_1_7.txt AC 18 ms 3064 KB
subtask_1_8.txt AC 19 ms 3188 KB
subtask_1_9.txt AC 18 ms 3064 KB