Submission #2238239


Source Code Expand

N, M = map(int, input().split())

stu_list = []
cp_list = []

for i in range(N):
    stu_list.append(list(map(int, input().split())))

for j in range(M):
    cp_list.append(list(map(int, input().split())))

for i in range(len(stu_list)):
    min_cp = 0
    min_d = 10**9
    for j in range(len(cp_list)):
        d = abs(stu_list[i][0] - cp_list[j][0]) + abs(stu_list[i][1] - cp_list[j][1])

        if min_d > d:
            min_cp = j + 1
            min_d = d

    print(min_cp)

Submission Info

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