Submission #2737053


Source Code Expand

N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(N)]
cd = [list(map(int, input().split())) for i in range(M)]
for ab_i in ab:
    min_j = -1
    min_manh = float('inf')
    for j, cd_j in enumerate(cd):
        if min_manh > abs(ab_i[0]-cd_j[0])+abs(ab_i[1]-cd_j[1]):
            min_manh = abs(ab_i[0]-cd_j[0])+abs(ab_i[1]-cd_j[1])
            min_j = j+1
    print(min_j)

Submission Info

Submission Time
Task B - Checkpoints
User a_key_bako
Language Python (3.4.3)
Score 200
Code Size 428 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 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 18 ms 3064 KB
subtask_1_4.txt AC 17 ms 3064 KB
subtask_1_5.txt AC 18 ms 3064 KB
subtask_1_6.txt AC 17 ms 3064 KB
subtask_1_7.txt AC 19 ms 3064 KB