Submission #31069571

Source Code Expand

import bisect
d = int(input())
n = int(input())
m = int(input())
x = [0] + sorted([int(input()) for i in range(n - 1)]) + [d]
answer = 0
for i in range(m):
    k = int(input())
    t = bisect.bisect_right(x, k)
    answer += min(x[t] - k, k - x[t - 1])
print(answer)

Submission Info

Submission Time
Task B - ピザ
User Pro_ktmr
Language Python (3.8.2)
Score 20
Code Size 276 Byte
Status AC
Exec Time 178 ms
Memory 13948 KiB

Judge Result

Set Name set01 set02 set03 set04 set05 set06 set07 set08 set09 set10
Score / Max Score 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
set01 data1
set02 data2
set03 data3
set04 data4
set05 data5
set06 data6
set07 data7
set08 data8
set09 data9
set10 data10
Case Name Status Exec Time Memory
data1 AC 23 ms 8964 KiB
data10 AC 178 ms 13948 KiB
data2 AC 24 ms 8872 KiB
data3 AC 22 ms 9048 KiB
data4 AC 50 ms 9248 KiB
data5 AC 145 ms 13180 KiB
data6 AC 143 ms 13000 KiB
data7 AC 159 ms 13480 KiB
data8 AC 158 ms 13652 KiB
data9 AC 176 ms 13836 KiB