Submission #1171231

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171231		FZ_Laabidi	Bouquet (EGOI24_bouquet)	C++20	18 / 100	40 ms	2968 KiB

Main

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n; cin >> n;
    vector<pair<int, int>> flowers(n+1, {INT_MAX, INT_MAX});
    vector<int> dp(n, 1);
    for(int i = 0; i < n; i++)
        cin >> flowers[i].first >> flowers[i].second;
    for (int i=0; i<n; i++) {
        for (int j=max(0,i-5); j<i; j++) {
                if (j+max(flowers[j].second, flowers[i].first)<i) 
                    dp[i]= max(dp[i], dp[j]+1);
                
            }
        }
        cout << *max_element(dp.begin(), dp.end())<< endl;
    
}

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