Submission #1351363

#TimeUsernameProblemLanguageResultExecution timeMemory
1351363trigonInfinite Race (EGOI24_infiniterace2)C++20
0 / 100
60 ms19900 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    vector<set<int>> occ(n);
    int q;
    vector<int> a;
    cin >> q;
    int ans=0;
    for(int i=0;i<q;i++){
        int x;
        cin >> x;
        occ[x].insert(i);
        a.push_back(x);
    }
    int idx = 0;
    while(idx<q){
        if(*prev(occ[a[idx]].end())>idx) {
            ans++;
            idx = *occ[a[idx]].upper_bound(idx);
        }
        else{
            idx++;
        }
    }

    cout<<ans<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...