Submission #11652358
Source Code Expand
import math n, m = map(int, input().split()) ns, ms = range(n), range(m) students = [] for i in ns: a, b = map(int, input().split()) students.append([a, b]) checkpoints = [] for i in ms: c, d = map(int, input().split()) checkpoints.append([c, d]) for i in ns: ans = [0, float('inf')] for j in ms: dist = abs(students[i][0] - checkpoints[j][0]) + abs(students[i][1] - checkpoints[j][1]) if dist < ans[1]: ans = [j + 1, dist] print(ans[0])
Submission Info
Submission Time | |
---|---|
Task | B - Checkpoints |
User | tatyam |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 514 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 | 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 |