| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 382978 | Alexandra | Baloni (COCI15_baloni) | Cpython 3 | 2094 ms | 104700 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())
h = input().split()
h = list(map(int, h))
resp = 0
rotos = []
try:
    for i in range (len(h)):
      rotos = []
      target = min(h)
      arrow = target + 1
      o = h.index(target)
      h.pop(o)
      resp += 1
      if h.index(min(h)) < o:
        for j in range (o-1, -1, -1):
          if h[j] == arrow:
            arrow += 1
            rotos.append(j)
        rotos.sort(reverse=True)
        for j in range (len(rotos)):
          h.pop(rotos[j])
    print (str(resp))
except:
    print (str(resp))
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
