Submission #3782093

Source Code Expand

N,M,X = [int(i) for i in input().split()]
gates = [int(i) for i in input().split()]

fare = 0

# 減少方向
for i in range(X) :
    if (i in gates) :
        fare += 1

min_fare = fare
fare = 0
for i in range(X,N+1) :
    if (i in gates) :
        fare += 1

if (min_fare > fare) :
    min_fare = fare

print(min_fare)

Submission Info

Submission Time
Task B - Toll Gates
User meniscus
Language Python (3.4.3)
Score 200
Code Size 339 Byte
Status AC
Exec Time 18 ms
Memory 3064 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 18 ms 2940 KB
2.txt AC 18 ms 3064 KB
3.txt AC 18 ms 3064 KB
4.txt AC 18 ms 3060 KB
5.txt AC 18 ms 3064 KB
6.txt AC 18 ms 3060 KB
7.txt AC 18 ms 3064 KB
8.txt AC 18 ms 3064 KB
sample1.txt AC 18 ms 3064 KB
sample2.txt AC 18 ms 2940 KB
sample3.txt AC 18 ms 3064 KB