Submission #1355867

#TimeUsernameProblemLanguageResultExecution timeMemory
1355867yyc000123Infinite Race (EGOI24_infiniterace2)C++20
29 / 100
40 ms10432 KiB
#include<bits/stdc++.h>
using namespace std ;
const int N = 2e5+5 ;
const int Q = 2e5+5 ;
int n , q , x , arr[N] , last , ans ;
set<int> st ;

int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0) ;
    cin >> n >> q ;
    while(q--){
        cin >> x ;
        if(x<0){
            if(arr[-x]==0) arr[-x]=1 ;
            if(st.find(-x)!=st.end()) st.erase(-x) ;
        }
        else if(arr[x]==0){
            st.insert(x) ; arr[x]=1 ;
        }
        else{
            if(st.find(x)!=st.end()) ans++ ;
            st.clear() ;
            st.insert(x) ;
        }
    }
    cout << ans << '\n' ;
    return 0 ;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...