Submission #1339364

#TimeUsernameProblemLanguageResultExecution timeMemory
1339364sallyInfinite Race (EGOI24_infiniterace2)C++20
100 / 100
106 ms9784 KiB
#include<iostream>
#include<set>
using namespace std;
int main() {
    int N, Q;
    cin>>N>>Q;
    int ans = 0;
    set<int> st;
    while(Q--) {
        int k;
        cin>>k;
        if(k<0) {
            if(st.find(-k)!=st.end()) st.erase(-k);
            continue;
        }
        else if(st.find(k)!=st.end()) {
            ans++;
            st.clear();
        }
        st.insert(k);
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...