| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 161891 | boolodifjenula | Rasvjeta (COCI17_rasvjeta) | Cpython 3 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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 k:
s+=1
print(s)