Submission #9030476

Source Code Expand

import bisect

n, d = map(int, input().split())
x = list(map(int, input().split()))

ans = 0
for i in range(n):
    j = bisect.bisect_right(x, x[i] + d)
    ans += (j-i-1) * (n-j)
    k = bisect.bisect_left(x, x[i] - d)
    ans -= (i-k) * (n-j)

print(ans)

Submission Info

Submission Time
Task C - 徒歩圏内
User ophelia
Language Python (3.4.3)
Score 400
Code Size 270 Byte
Status AC
Exec Time 214 ms
Memory 14480 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 16
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Case Name Status Exec Time Memory
01.txt AC 214 ms 14480 KiB
02.txt AC 192 ms 14480 KiB
03.txt AC 200 ms 14480 KiB
04.txt AC 205 ms 14480 KiB
05.txt AC 200 ms 14480 KiB
06.txt AC 197 ms 14480 KiB
07.txt AC 198 ms 13420 KiB
08.txt AC 182 ms 12972 KiB
09.txt AC 19 ms 3060 KiB
10.txt AC 199 ms 14052 KiB
11.txt AC 201 ms 14252 KiB
12.txt AC 206 ms 14480 KiB
sample-01.txt AC 17 ms 2940 KiB
sample-02.txt AC 17 ms 3060 KiB
sample-03.txt AC 17 ms 3060 KiB
sample-04.txt AC 17 ms 2940 KiB