Submission #1237565

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237565		clemmy14	Bouquet (EGOI24_bouquet)	C++20	24 / 100	56 ms	2756 KiB

Main

#include<bits/stdc++.h>
using namespace std;

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

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