Submission #11675051
Source Code Expand
N,M = map(int,input().split()) ab = [list(map(int,input().split())) for _ in range(N)] cd = [list(map(int,input().split())) for _ in range(M)] INF = 4*10**9+1 for i in range(N): ans,dist = 0,INF for j in range(M): if dist > abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1]): ans = j + 1 dist = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1]) print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - Checkpoints |
User | humancipher |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 416 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 3064 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_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
subtask_1_1.txt | AC | 18 ms | 3064 KB |
subtask_1_2.txt | AC | 18 ms | 3064 KB |
subtask_1_3.txt | AC | 17 ms | 3064 KB |
subtask_1_4.txt | AC | 17 ms | 3064 KB |
subtask_1_5.txt | AC | 17 ms | 3064 KB |
subtask_1_6.txt | AC | 17 ms | 3064 KB |
subtask_1_7.txt | AC | 19 ms | 3064 KB |