Submission #1239295

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239295		luser	Bouquet (EGOI24_bouquet)	C++20	24 / 100	19 ms	6648 KiB

Main

#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define endl "\n"
#define moo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
void solve()
{
    ll n,ans=0,i,j,ma=0;
    cin>>n;
    vector<pair<ll,ll>>v(n+1);
    for(i=1;i<=n;i++)
    cin>>v[i].f>>v[i].s;
    ll dp[n+1][2];
    dp[0][0]=0;
    dp[0][1]=0;
    ma=0;
    for(i=1;i<=n;i++)
    {
        dp[i][0]=ma;
        j=max(0LL,i-v[i].f-1);
        dp[i][1]=max(max(dp[j][0],dp[j][1])+1,ma);
        ma=max(ma,dp[i][1]);
    }
    cout<<ma;
}
//6 2
/*
x . . x . .
*/
int main()
{
    moo
    ll t=1;
    while(t--)
    solve();
}

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