Submission #21947593
Source Code Expand
def main():
_ = int(input())
a = sorted(map(int, input().split()))
a = [-10**9] + a + [2 * 10**9]
q = int(input())
b = [int(input()) for _ in range(q)]
idx = sorted(range(q), key=lambda i: b[i])
ans = [-1 for _ in range(q)]
j = 0
for i in idx:
while a[j] < b[i]:
j += 1
ans[i] = min(b[i] - a[j - 1], a[j] - b[i])
print(*ans, sep='\n')
if __name__ == "__main__":
main()
Submission Info
| Submission Time | |
|---|---|
| Task | 007 - CP Classes(★3) |
| User | riantkb |
| Language | Python (3.8.2) |
| Score | 3 |
| Code Size | 445 Byte |
| Status | AC |
| Exec Time | 983 ms |
| Memory | 63036 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 3 / 3 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample01.txt, sample02.txt, sample03.txt, sample04.txt |
| All | handmade.txt, max.txt, max_dense00.txt, max_dense01.txt, max_dense02.txt, max_random00.txt, max_random01.txt, max_random02.txt, random00.txt, random01.txt, random02.txt, sample01.txt, sample02.txt, sample03.txt, sample04.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| handmade.txt | AC | 765 ms | 48996 KiB |
| max.txt | AC | 633 ms | 54960 KiB |
| max_dense00.txt | AC | 934 ms | 54020 KiB |
| max_dense01.txt | AC | 925 ms | 53968 KiB |
| max_dense02.txt | AC | 933 ms | 53948 KiB |
| max_random00.txt | AC | 982 ms | 62912 KiB |
| max_random01.txt | AC | 980 ms | 62820 KiB |
| max_random02.txt | AC | 983 ms | 63036 KiB |
| random00.txt | AC | 489 ms | 38824 KiB |
| random01.txt | AC | 107 ms | 25652 KiB |
| random02.txt | AC | 322 ms | 27512 KiB |
| sample01.txt | AC | 19 ms | 9072 KiB |
| sample02.txt | AC | 22 ms | 8864 KiB |
| sample03.txt | AC | 23 ms | 8952 KiB |
| sample04.txt | AC | 21 ms | 8948 KiB |