Submission #1303182
Source Code Expand
class Point: def __init__(self, x, y): self.x = x self.y = y def getDistance(self, to): return abs(self.x - to.x) + abs(self.y - to.y) def __repr__(self): return "({0}, {1})".format(self.x, self.y) N, M = [int(x) for x in input().split(" ")] a = [] c = [] for _ in range(N): x, y = [int(p) for p in input().split(" ")] a.append(Point(x, y)) for _ in range(M): x, y = [int(p) for p in input().split(" ")] c.append(Point(x, y)) for a_i in a: min_d = 250000000 min_i = 0 for i in range(len(c)): d = a_i.getDistance(c[i]) if d < min_d: min_d = d min_i = i print(min_i + 1)
Submission Info
Submission Time | |
---|---|
Task | B - Checkpoints |
User | sidebook37 |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 636 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 | 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 |