Submission #1233293

#TimeUsernameProblemLanguageResultExecution timeMemory
1233293yixuan19Bouquet (EGOI24_bouquet)C++20
24 / 100
63 ms2492 KiB
#include <iostream>
#include <utility>
#include <vector>
using namespace std;

int main(){
    int N, l, r;
    cin >> N;
    int skipped = 0;
    int ans = 0;
    vector<pair<int,int> > tulips;
    for (int i = 0; i < N; ++i){
        cin >> l >> r;
        tulips.push_back(make_pair(l,r));
    }
    ans++;
    for (int i = 1; i < N; ++i){
        if (tulips[i].first <= skipped){
            ans++;
            skipped = 0;
        }else{
            skipped++;
        }
    }
    cout<<ans<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...