Submission #161443

#TimeUsernameProblemLanguageResultExecution timeMemory
161443boolodifjenulaRasvjeta (COCI17_rasvjeta)Cpython 3
25 / 50
35 ms3492 KiB
N=int(input())
M=int(input())
K=int(input())
O=[i+1 for i in range (N)]
for i in range(M):
    P=int(input())
    for i in range(P-K-1,P+K):
        if -1<i<len(O):
            O[i]=0
k=0
p=0
s=0
for i in range(N):
    if O[i]:
        k+=1
    elif k:
        p+=1
    if k and k+p==K+1:
        s+=1
        k=-K
        p=-K
    if i==N-1 and s==0 and k:
        s+=1
print(s)
#Verdict Execution timeMemoryGrader output
Fetching results...