제출 #1043195

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

Main

import bisect
import heapq

N = int(input())
L, R = zip(*(map(int, input().split()) for _ in range(N)))

best = [0]
available = []
for n in range(N):
    l = min(L[n], n)
    r = min(R[n], N-1-n)
    i = bisect.bisect_right(best, n-l)
    heapq.heappush(available, (n+r, i, n+1))
    while available and available[0][0] == n:
        _, i, m = heapq.heappop(available)
        if i == len(best):
            best.append(m)
        else:
            best[i] = min(best[i], m)

print(len(best) - 1)

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