Submission #10172894


Source Code Expand

[n,m]=list(map(int,input().split()))
ab=[]
for i in range(n):
    ab.append(list(map(int,input().split())))
cd=[]
for i in range(m):
    cd.append(list(map(int,input().split())))
ans=[]
for i in range(n):
    kyorimin=10**9
    for j in range(m):
        kyori=abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])
        if kyorimin>kyori:
            goal=j+1
            kyorimin=kyori
    ans.append(goal)
for i in range(len(ans)):
    print(ans[i])

Submission Info

Submission Time
Task B - Checkpoints
User appp
Language Python (3.4.3)
Score 200
Code Size 463 Byte
Status AC
Exec Time 19 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 10
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 16 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