Submission #21947931

Source Code Expand

from bisect import bisect


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)]
    for x in b:
        i = bisect(a, x)
        print(min(a[i] - x, x - a[i - 1]))


if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task 007 - CP Classes（★3）
User riantkb
Language PyPy3 (7.3.0)
Score 3
Code Size 324 Byte
Status AC
Exec Time 647 ms
Memory 132352 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 3 / 3
Status
AC × 4
AC × 15
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 432 ms 95112 KiB
max.txt AC 497 ms 131028 KiB
max_dense00.txt AC 619 ms 132352 KiB
max_dense01.txt AC 627 ms 131020 KiB
max_dense02.txt AC 620 ms 131624 KiB
max_random00.txt AC 635 ms 126128 KiB
max_random01.txt AC 647 ms 127248 KiB
max_random02.txt AC 641 ms 127244 KiB
random00.txt AC 384 ms 107932 KiB
random01.txt AC 168 ms 88872 KiB
random02.txt AC 299 ms 89636 KiB
sample01.txt AC 50 ms 61980 KiB
sample02.txt AC 51 ms 62032 KiB
sample03.txt AC 51 ms 62060 KiB
sample04.txt AC 52 ms 62384 KiB