Submission #8832971
Source Code Expand
h,w=map(int,input().split()) l=list(map(list,[input() for i in range(h)])) for i in range(h): for j in range(w): if l[i][j]=="#": continue num=0 if i!=0 and j!=0 and l[i-1][j-1]=="#": num+=1 if i!=0 and l[i-1][j]=="#": num+=1 if i!=0 and j!=w-1 and l[i-1][j+1]=="#": num+=1 if j!=0 and l[i][j-1]=="#": num+=1 if j!=w-1 and l[i][j+1]=="#": num+=1 if i!=h-1 and j!=0 and l[i+1][j-1]=="#": num+=1 if i!=h-1 and l[i+1][j]=="#": num+=1 if i!=h-1 and j!=w-1 and l[i+1][j+1]=="#": num+=1 l[i][j]=str(num) print("".join(l[i]))
Submission Info
Submission Time | |
---|---|
Task | B - Minesweeper |
User | hase |
Language | PyPy3 (2.4.0) |
Score | 200 |
Code Size | 752 Byte |
Status | AC |
Exec Time | 193 ms |
Memory | 40300 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 | 165 ms | 38256 KB |
sample_02.txt | AC | 162 ms | 38256 KB |
sample_03.txt | AC | 167 ms | 38256 KB |
subtask_1_1.txt | AC | 193 ms | 40300 KB |
subtask_1_10.txt | AC | 181 ms | 39920 KB |
subtask_1_11.txt | AC | 167 ms | 38512 KB |
subtask_1_12.txt | AC | 168 ms | 38256 KB |
subtask_1_2.txt | AC | 164 ms | 38256 KB |
subtask_1_3.txt | AC | 169 ms | 38256 KB |
subtask_1_4.txt | AC | 165 ms | 38256 KB |
subtask_1_5.txt | AC | 170 ms | 38256 KB |
subtask_1_6.txt | AC | 169 ms | 38256 KB |
subtask_1_7.txt | AC | 168 ms | 38256 KB |
subtask_1_8.txt | AC | 168 ms | 38256 KB |
subtask_1_9.txt | AC | 167 ms | 38256 KB |