Submission #2371800

Source Code Expand

import bisect
N, C, K =map(int, input().split())
T = sorted([int(input()) for i in range(N)])

ans = 0
front = 0
while front < N:
    standard = T[front] + K
    front = min(bisect.bisect_right(T, standard), front+C)
    ans += 1
print(ans)

Submission Info

Submission Time
Task A - Airport Bus
User AT274
Language Python (3.4.3)
Score 300
Code Size 250 Byte
Status AC
Exec Time 306 ms
Memory 8284 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 12
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 23 ms 3188 KB
in2.txt AC 217 ms 8284 KB
in3.txt AC 306 ms 8276 KB
in4.txt AC 298 ms 8280 KB
in5.txt AC 21 ms 3060 KB
in6.txt AC 230 ms 8280 KB
in7.txt AC 181 ms 7532 KB
in8.txt AC 213 ms 8280 KB
sample1.txt AC 17 ms 2940 KB
sample2.txt AC 17 ms 2940 KB