Submission #1166786

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166786		uranhishig	Bouquet (EGOI24_bouquet)	C++17	0 / 100	35 ms	5152 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)

const int mx = 2e5 + 9;

signed main(){
	int n;	cin >> n;
	vector<int> l(n);
	vector<int> r(n);
	for (int i = 0; i < n; i++) {
		cin >> l[i] >> r[i];
	}
	int dp[n + 1];
	for (int i = 0; i <= n; i++) {
		dp[i] = 1;
	}
	int ans = 0;
	for (int i = 1; i < n; i++) {
//		for (int j = 0; j < i - l[i]; j++) {
		if (r[0] < i - 0 and 0 < i - l[i]) {
			dp[i] = max(dp[i], dp[0] + 1);
		}
		if (r[1] < i - 1 and 1 < i - l[i]) {
			dp[i] = max(dp[i], dp[1] + 1);
		}
		if (r[2] < i - 2 and 2 < i - l[i]) {
			dp[i] = max(dp[i], dp[2] + 1);
		}
		ans = max(dp[i], ans);
	}
	cout << ans << endl;
	return 0;
}

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