Submission #21947265

Source Code Expand

import numpy as np
from numba import njit


@njit('void(int64[:], int64[:])', cache=True)
def solve(a, b):
    a.sort()
    idx = np.searchsorted(a, b)
    for x, i in zip(b, idx):
        print(min(a[i] - x, x - a[i - 1]))


def main():
    _ = int(input())
    a = np.array(list(map(int, input().split())) + [-10**9, 2 * 10**9])
    q = int(input())
    b = np.array([int(input()) for _ in range(q)])
    solve(a, b)


if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task 007 - CP Classes（★3）
User riantkb
Language Python (3.8.2)
Score 3
Code Size 459 Byte
Status AC
Exec Time 1137 ms
Memory 144060 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 980 ms 121480 KiB
max.txt AC 1046 ms 140732 KiB
max_dense00.txt AC 1116 ms 143240 KiB
max_dense01.txt AC 1113 ms 143960 KiB
max_dense02.txt AC 1115 ms 144060 KiB
max_random00.txt AC 1137 ms 139756 KiB
max_random01.txt AC 1130 ms 140612 KiB
max_random02.txt AC 1127 ms 140620 KiB
random00.txt AC 823 ms 135900 KiB
random01.txt AC 559 ms 123104 KiB
random02.txt AC 706 ms 119140 KiB
sample01.txt AC 497 ms 106320 KiB
sample02.txt AC 495 ms 107072 KiB
sample03.txt AC 498 ms 107204 KiB
sample04.txt AC 498 ms 106352 KiB