Submission #10086655
Source Code Expand
n, m = map(int, input().split()) students = [] for _ in range(n): s, t = map(int, input().split()) students.append((s, t)) xy = [] for _ in range(m): x, y = map(int, input().split()) xy.append((x, y)) # O(nm) for s, t in students: MIN = float('infinity') checkpoint = 0 for i in range(len(xy)): x, y = xy[i] distance = abs(s - x) + abs(t - y) if distance < MIN: MIN = distance checkpoint = i print(checkpoint + 1)
Submission Info
Submission Time | |
---|---|
Task | B - Checkpoints |
User | tiruka |
Language | PyPy3 (2.4.0) |
Score | 200 |
Code Size | 518 Byte |
Status | AC |
Exec Time | 176 ms |
Memory | 39280 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 | 162 ms | 38256 KB |
sample_02.txt | AC | 159 ms | 38256 KB |
sample_03.txt | AC | 162 ms | 38336 KB |
subtask_1_1.txt | AC | 163 ms | 38256 KB |
subtask_1_2.txt | AC | 169 ms | 38640 KB |
subtask_1_3.txt | AC | 162 ms | 38256 KB |
subtask_1_4.txt | AC | 160 ms | 38256 KB |
subtask_1_5.txt | AC | 163 ms | 38256 KB |
subtask_1_6.txt | AC | 162 ms | 38256 KB |
subtask_1_7.txt | AC | 176 ms | 39280 KB |