Submission #1237602

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237602		clemmy14	Bouquet (EGOI24_bouquet)	C++20	0 / 100	38 ms	2632 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, 1); 
    for(int i=1; i<n; i++) {
        if(i > 2) dp[i]=max(dp[i], dp[i-3]+1);
            
        if(i > 1 && r[i-2] < 2 && l[i] < 2) dp[i]=max(dp[i], dp[i-2]+1);
        
        if(r[i-1] < 1 && l[i] < 1) dp[i]=max(dp[i], dp[i-1]+1);
        dp[i]=max(dp[i], dp[i-1]);
    }
    // int ans=0;
    // for(int i=0; i<n; i++) ans=max(ans, dp[i]);
    // cout << ans;
    cout << dp[n-1];
    return 0;
}

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