제출 #1043196

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1043196		model_code	Bouquet (EGOI24_bouquet)	Pypy 3	28 / 100	3081 ms	48468 KiB

Main

#!/usr/bin/env python3
#@EXPECTED_GRADES@ TLE TLE AC TLE TLE

n = int(input())
r = [0]*n
delayed = [[] for i in range(n)]
for i in range(n):
  l, r[i] = [int(i) for i in input().split()]
  if i-l >= 0:
    delayed[i-l].append(i)

dp = [0]*n
active = []
for i in reversed(range(n)):
  for j in active:
    if i+r[i] < j:
      dp[i] = max(dp[i], dp[j])
  dp[i] += 1
  active += delayed[i]

print(max(dp))

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