Submission #1170556

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170556		FZ_Laabidi	Bouquet (EGOI24_bouquet)	C++20	24 / 100	55 ms	2772 KiB

Main

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

int main() {
    int n; cin >> n;
    vector<int> flowers(n+1);
    vector<int> dp(n, 1), prf(n+1, 0);
    int k=0;
    for(int i = 0; i < n; i++)cin >> flowers[i] >> k ;
    for (int i=0; i<n; i++) {
        if (i>flowers[i])dp[i] = max(1, prf[i-flowers[i]]+1);
        prf[i+1] = max(prf[i], dp[i]);
    }

    cout <<  *max_element(dp.begin(), dp.end())<< endl;;
}

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