Submission #1368495
Source Code Expand
def calcManhattanDistance(student, checkpoint): return abs(student[0] - checkpoint[0]) + abs(student[1] - checkpoint[1]) if __name__ == "__main__": # input process N, M = map(int, input().split()) students = [list(map(int, input().split())) for i in range(N)] checkpoints = [list(map(int, input().split())) for i in range(M)] # calculation process for student in students: distance_list = [] for checkpoint in checkpoints: distance_list.append(calcManhattanDistance(student, checkpoint)) # print the first index(+1) of minimum value minval = min(distance_list) print(distance_list.index(minval) + 1) # END
Submission Info
Submission Time | |
---|---|
Task | A - Remaining Time |
User | antm |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 716 Byte |
Status | RE |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
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 | RE | 17 ms | 3060 KB |
sample_02.txt | RE | 17 ms | 3064 KB |
sample_03.txt | RE | 17 ms | 3056 KB |
subtask_1_1.txt | RE | 17 ms | 3064 KB |
subtask_1_2.txt | RE | 17 ms | 3060 KB |
subtask_1_3.txt | RE | 17 ms | 3064 KB |
subtask_1_4.txt | WA | 17 ms | 3064 KB |
subtask_1_5.txt | RE | 17 ms | 3064 KB |
subtask_1_6.txt | RE | 17 ms | 3060 KB |
subtask_1_7.txt | RE | 17 ms | 3060 KB |