# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162369 | boolodifjenula | Baloni (COCI15_baloni) | Cpython 3 | 2070 ms | 95252 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())
L=list(map(int,input().split()))
s=0
g1=L[0]
m=sum(L)
while m:
s+=1
g=g1
g1=0
for i in range(len(L)):
if g==L[i]:
g-=1
m-=L[i]
L[i]=0
elif g1==0:
g1=L[i]
if g<1 and g1:
break
print(s)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |