Submission #1187981

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187981		ofoz	Bouquet (EGOI24_bouquet)	Pypy 3	24 / 100	364 ms	63748 KiB

Main

def solve():
    n = int(input())
    segments = []
    for _ in range(n):
        l, r = map(int, input().split(" "))
        segments.append((l, r))
    

    dp = [0] * n
    for i in range(n):
        l, r = segments[i]
        dp[i] = max(dp[i-1], 1)
        for j in range(i-l-1, -1, -1):
            if j < 0: continue
            l2, r2 = segments[j]
            if j + r2 < i:
                dp[i] = max(dp[i], dp[j] + 1)
                break
            
    print(max(dp))

# let dp[i] be the maximum amount of tulips we can pick up in the i-th point, if we have boundaries l, r. then we can see that dp[i] = max(dp[i-1], dp[j] + 1)
# for some j < i such that i-j >= l and i-j >= r_j
# so now we just need to find the first tulip j in point 0, i-l such that 

solve()

Compilation message (stdout)

Compiling 'Main.py'...

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

=======

• Subtask 1: 8 / 8
• Subtask 2: 16 / 16
• Subtask 3: 0 / 28
• Subtask 4: 0 / 18
• Subtask 5: 0 / 30