Submission #21947425

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 Python (3.8.2)
Score 3
Code Size 324 Byte
Status AC
Exec Time 866 ms
Memory 46320 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 532 ms 20668 KiB
max.txt AC 663 ms 42980 KiB
max_dense00.txt AC 850 ms 46320 KiB
max_dense01.txt AC 846 ms 46280 KiB
max_dense02.txt AC 850 ms 46140 KiB
max_random00.txt AC 866 ms 42532 KiB
max_random01.txt AC 857 ms 42660 KiB
max_random02.txt AC 862 ms 42664 KiB
random00.txt AC 451 ms 38976 KiB
random01.txt AC 95 ms 25492 KiB
random02.txt AC 297 ms 21452 KiB
sample01.txt AC 18 ms 8832 KiB
sample02.txt AC 23 ms 8836 KiB
sample03.txt AC 20 ms 8836 KiB
sample04.txt AC 20 ms 9012 KiB