Submission #1351402

#	Time	Username	Problem	Language	Result	Execution time	Memory
1351402		trigon	Bouquet (EGOI24_bouquet)	C++20	24 / 100	19 ms	2628 KiB

Main

#include<bits/stdc++.h>
using namespace std;
int solve(int i,vector<int> &dp,vector<int> &l){
    if(i==0) return dp[i]=1;
    if(i<0) return 0;
    if(dp[i]!=-1) return dp[i];
    //Take
    int option1 = 1 + solve(i-l[i]-1,dp,l);
    //NotTake
    int option2 = solve(i-1,dp,l);
    return dp[i] = max(option1,option2);
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<int> l(n);
    vector<int> r(n);
    int ans=0;
    vector<int> dp(n,-1);
    for(int i=0;i<n;i++){
        cin >> l[i] >> r[i];

    }
    for(int i=0;i<n;i++){
        ans = max(ans,solve(i,dp,l));
    }

    cout<<ans<<"\n";
}

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