Submission #1360031

#TimeUsernameProblemLanguageResultExecution timeMemory
1360031biserailievaBouquet (EGOI24_bouquet)C++20
24 / 100
51 ms2600 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<pair<int,int>> seg;
    for(int i = 0; i < n; i++)
    {
        int l, r;
        cin >> l >> r;
        l = min(l, i);
        int L = i - l;   
        int R = i;      
        seg.push_back({L, R});
    }
    int last = -1; 
    int ans = 0;
    for(auto [L, R] : seg)
    {
        if(L > last)
        {
            ans++;      
            last = R;   
        }
    }
    cout << ans << "\n";
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...