Submission #34428963
Source Code Expand
import sys
import collections
import math
import itertools
sys.setrecursionlimit(50000)
deb = 0
INF = 10**18
n , q= map(int,input().split())
points = []
points.append (None)
max_x = -1 * INF
min_x = INF
max_y = -1 * INF
min_y = INF
for i in range(n) :
a, b = map(int,input().split() )
#45度回転,√2倍拡大
_a = a - b
_b = a + b
points.append([_a,_b])
max_x = max(_a,max_x)
min_x = min(_a,min_x)
max_y = max(_b,max_y)
min_y = min(_b,min_y)
for i in range(q) :
cur = int(input())
a, b = points[cur]
maxdist = max(abs(max_x-a), abs(min_x - a), abs(max_y - b), abs(min_y - b))
print(maxdist)
Submission Info
| Submission Time | |
|---|---|
| Task | 036 - Max Manhattan Distance(★5) |
| User | ay24h |
| Language | PyPy3 (7.3.0) |
| Score | 5 |
| Code Size | 688 Byte |
| Status | AC |
| Exec Time | 618 ms |
| Memory | 90860 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 | 68 ms | 65052 KiB |
| sample_02.txt | AC | 58 ms | 65416 KiB |
| sample_03.txt | AC | 57 ms | 65204 KiB |
| subtask_1_01.txt | AC | 61 ms | 66216 KiB |
| subtask_1_02.txt | AC | 58 ms | 64980 KiB |
| subtask_1_03.txt | AC | 58 ms | 65084 KiB |
| subtask_1_04.txt | AC | 60 ms | 66420 KiB |
| subtask_1_05.txt | AC | 60 ms | 66064 KiB |
| subtask_1_06.txt | AC | 399 ms | 90024 KiB |
| subtask_1_07.txt | AC | 67 ms | 69748 KiB |
| subtask_1_08.txt | AC | 65 ms | 68108 KiB |
| subtask_1_09.txt | AC | 83 ms | 73784 KiB |
| subtask_1_10.txt | AC | 191 ms | 78768 KiB |
| subtask_1_11.txt | AC | 90 ms | 74172 KiB |
| subtask_1_12.txt | AC | 330 ms | 86312 KiB |
| subtask_1_13.txt | AC | 161 ms | 76324 KiB |
| subtask_1_14.txt | AC | 227 ms | 80920 KiB |
| subtask_1_15.txt | AC | 58 ms | 65056 KiB |
| subtask_1_16.txt | AC | 601 ms | 90860 KiB |
| subtask_1_17.txt | AC | 612 ms | 90672 KiB |
| subtask_1_18.txt | AC | 602 ms | 90780 KiB |
| subtask_1_19.txt | AC | 609 ms | 90160 KiB |
| subtask_1_20.txt | AC | 618 ms | 90844 KiB |
| subtask_1_21.txt | AC | 80 ms | 74056 KiB |
| subtask_1_22.txt | AC | 542 ms | 90288 KiB |
| subtask_1_23.txt | AC | 193 ms | 77260 KiB |
| subtask_1_24.txt | AC | 564 ms | 90588 KiB |