Submission #3228731
Source Code Expand
INF = float('inf') N,M = map(int,input().split()) b = [input() for i in range(N)] a = [[0 for i in range(M)] for i in range(N)] dx,dy = [0,-1,1,0],[-1,0,0,1] for j in range(1,N-1): for i in range(1,M-1): OK = True center = INF for k in range(4): if j+dy[k]<0 and N<=j+dy[k] and i+dx[k]<0 and M<=i+dx[k]: continue if b[j+dy[k]][i+dx[k]]=='0': OK = False break else: center = min(center,int(b[j+dy[k]][i+dx[k]])) if OK: a[j][i] = center for k in range(4): tmp = int(b[j+dy[k]][i+dx[k]])-center b[j+dy[k]] = b[j+dy[k]][:i+dx[k]]+str(tmp)+b[j+dy[k]][i+dx[k]+1:] for i in range(N): print(''.join(map(str,a[i])))
Submission Info
Submission Time | |
---|---|
Task | B - アメーバ |
User | mahiro346 |
Language | PyPy3 (2.4.0) |
Score | 100 |
Code Size | 829 Byte |
Status | AC |
Exec Time | 719 ms |
Memory | 51036 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
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, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 160 ms | 38384 KB |
sample_02.txt | AC | 162 ms | 38256 KB |
sample_03.txt | AC | 161 ms | 38256 KB |
subtask1_01.txt | AC | 160 ms | 38256 KB |
subtask1_02.txt | AC | 161 ms | 38256 KB |
subtask1_03.txt | AC | 247 ms | 46556 KB |
subtask1_04.txt | AC | 719 ms | 51036 KB |
subtask1_05.txt | AC | 487 ms | 50140 KB |
subtask1_06.txt | AC | 481 ms | 49244 KB |
subtask1_07.txt | AC | 485 ms | 49628 KB |
subtask1_08.txt | AC | 368 ms | 48348 KB |
subtask1_09.txt | AC | 606 ms | 51036 KB |
subtask1_10.txt | AC | 230 ms | 43500 KB |
subtask1_11.txt | AC | 228 ms | 42736 KB |
subtask1_12.txt | AC | 378 ms | 47196 KB |
subtask1_13.txt | AC | 340 ms | 45276 KB |
subtask1_14.txt | AC | 329 ms | 45148 KB |
subtask1_15.txt | AC | 357 ms | 46428 KB |
subtask1_16.txt | AC | 306 ms | 45020 KB |
subtask1_17.txt | AC | 272 ms | 43996 KB |
subtask1_18.txt | AC | 220 ms | 41584 KB |
subtask1_19.txt | AC | 242 ms | 43372 KB |
subtask1_20.txt | AC | 217 ms | 42860 KB |
subtask1_21.txt | AC | 343 ms | 45660 KB |
subtask1_22.txt | AC | 249 ms | 43612 KB |
subtask1_23.txt | AC | 384 ms | 45788 KB |
subtask1_24.txt | AC | 240 ms | 44764 KB |