Submission #2893276


Source Code Expand

from bisect import bisect_left

n, m, x = map(int, input().split())
axs = [int(x) for x in input().split()]

i = bisect_left(axs, x)
print(min(i, len(axs) - i))

Submission Info

Submission Time
Task B - Toll Gates
User zehnpaard
Language Python (3.4.3)
Score 200
Code Size 166 Byte
Status AC
Exec Time 20 ms
Memory 3188 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 14
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt AC 20 ms 3188 KB
2.txt AC 17 ms 2940 KB
3.txt AC 17 ms 3060 KB
4.txt AC 18 ms 2940 KB
5.txt AC 17 ms 2940 KB
6.txt AC 18 ms 2940 KB
7.txt AC 17 ms 2940 KB
8.txt AC 17 ms 2940 KB
sample1.txt AC 17 ms 2940 KB
sample2.txt AC 17 ms 2940 KB
sample3.txt AC 17 ms 3060 KB