Submission #10167383
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)] for i in range(n): mn=100000000 ans=0 for j in range(m): d=abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1]) if d<mn: mn=d ans=j+1 print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - Checkpoints |
User | potagashi |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 313 Byte |
Status | WA |
Exec Time | 21 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 19 ms | 3064 KB |
sample_02.txt | AC | 19 ms | 3064 KB |
sample_03.txt | AC | 19 ms | 3064 KB |
subtask_1_1.txt | AC | 20 ms | 3060 KB |
subtask_1_2.txt | AC | 21 ms | 3064 KB |
subtask_1_3.txt | AC | 20 ms | 3064 KB |
subtask_1_4.txt | WA | 19 ms | 3060 KB |
subtask_1_5.txt | WA | 20 ms | 3060 KB |
subtask_1_6.txt | AC | 20 ms | 3060 KB |
subtask_1_7.txt | AC | 21 ms | 3064 KB |