Submission #28839873
Source Code Expand
N, Q = map(int, input().split()) points = [tuple(map(int, input().split())) for _ in range(N)] u, v = [], [] for x, y in points: u.append(x + y) v.append(x - y) u_min = min(u) u_max = max(u) v_min = min(v) v_max = max(v) for _ in range(Q): i = int(input()) - 1 print(max(abs(u[i] - u_min), abs(u[i] - u_max), abs(v[i] - v_min), abs(v[i] - v_max)))
Submission Info
| Submission Time | |
|---|---|
| Task | 036 - Max Manhattan Distance(★5) |
| User | magurofly |
| Language | Python (3.8.2) |
| Score | 5 |
| Code Size | 373 Byte |
| Status | AC |
| Exec Time | 690 ms |
| Memory | 30260 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 5 / 5 | ||||
| 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_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 24 ms | 8880 KiB |
| sample_02.txt | AC | 18 ms | 8892 KiB |
| sample_03.txt | AC | 16 ms | 8780 KiB |
| subtask_1_01.txt | AC | 18 ms | 8772 KiB |
| subtask_1_02.txt | AC | 20 ms | 8884 KiB |
| subtask_1_03.txt | AC | 19 ms | 8928 KiB |
| subtask_1_04.txt | AC | 18 ms | 8884 KiB |
| subtask_1_05.txt | AC | 22 ms | 8968 KiB |
| subtask_1_06.txt | AC | 404 ms | 27444 KiB |
| subtask_1_07.txt | AC | 26 ms | 9028 KiB |
| subtask_1_08.txt | AC | 23 ms | 8856 KiB |
| subtask_1_09.txt | AC | 31 ms | 9144 KiB |
| subtask_1_10.txt | AC | 74 ms | 10132 KiB |
| subtask_1_11.txt | AC | 22 ms | 9088 KiB |
| subtask_1_12.txt | AC | 306 ms | 23900 KiB |
| subtask_1_13.txt | AC | 54 ms | 9716 KiB |
| subtask_1_14.txt | AC | 153 ms | 17192 KiB |
| subtask_1_15.txt | AC | 24 ms | 8892 KiB |
| subtask_1_16.txt | AC | 679 ms | 30128 KiB |
| subtask_1_17.txt | AC | 680 ms | 30260 KiB |
| subtask_1_18.txt | AC | 690 ms | 30108 KiB |
| subtask_1_19.txt | AC | 688 ms | 30120 KiB |
| subtask_1_20.txt | AC | 681 ms | 30200 KiB |
| subtask_1_21.txt | AC | 29 ms | 9024 KiB |
| subtask_1_22.txt | AC | 655 ms | 30228 KiB |
| subtask_1_23.txt | AC | 89 ms | 10756 KiB |
| subtask_1_24.txt | AC | 659 ms | 30220 KiB |