Submission #1265474

#TimeUsernameProblemLanguageResultExecution timeMemory
1265474tgirolami09Bouquet (EGOI24_bouquet)Pypy 3
24 / 100
527 ms77748 KiB
n = int(input()) lst = [] for i in range(n): a,b = map(int,input().split()) lst.append((b+i,i-a,i)) lst.sort() rightMost = - (10**9) count = 0 for ele in lst: # print(f"Looking at interval {ele[1]}-{ele[0]} {ele[2]}-th") if (ele[1] > rightMost): rightMost = ele[2] # print(f"Rightmost is now {rightMost}") count +=1 print(count)

Compilation message (stdout)

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 21%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...