Submission #2548561
Source Code Expand
H, W = map(int, input().split()) field = [] mines = [] for ridx in range(H): row = list(input()) field.append([]) for cidx in range(W): is_mine = row[cidx] == '#' field[-1].append('#' if is_mine else 0) if is_mine: mines.append((ridx, cidx)) for m in mines: for i in range(-1, 2): for j in range(-1, 2): if m[0] + i >= 0 and m[0] + i < H and m[1] + j >= 0 and m[1] + j < W and isinstance(field[m[0] + i][m[1] + j], int): field[m[0] + i][m[1] + j] += 1 for r in field: print(''.join([str(e) for e in r]))
Submission Info
Submission Time | |
---|---|
Task | B - Minesweeper |
User | savio |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 618 Byte |
Status | AC |
Exec Time | 39 ms |
Memory | 3188 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 | 18 ms | 3064 KB |
sample_03.txt | AC | 18 ms | 3064 KB |
subtask_1_1.txt | AC | 30 ms | 3064 KB |
subtask_1_10.txt | AC | 18 ms | 3064 KB |
subtask_1_11.txt | AC | 39 ms | 3188 KB |
subtask_1_12.txt | AC | 18 ms | 3064 KB |
subtask_1_2.txt | AC | 17 ms | 3064 KB |
subtask_1_3.txt | AC | 22 ms | 3064 KB |
subtask_1_4.txt | AC | 17 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 | 20 ms | 3064 KB |
subtask_1_9.txt | AC | 17 ms | 3064 KB |