Submission #1047194

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047194		EntityPlantt	Bouquet (EGOI24_bouquet)	C++17	16 / 100	15 ms	1240 KiB

Main

#include <iostream>
#include <cassert>
using namespace std;

const int N = 2e5 + 5;
int dp[N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	for (int i = 0, l, r; i < n; i++) {
		cin >> l >> r;
		assert(r == 0);
		if (i) dp[i] = dp[i - 1];
		else dp[i] = 1;
		if (i > l) dp[i] = max(dp[i], dp[i - l - 1] + 1);
	}
	cout << dp[n - 1];
	return 0;
}

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