Submission #1146288

#TimeUsernameProblemLanguageResultExecution timeMemory
1146288FZ_LaabidiInfinite Race (EGOI24_infiniterace2)C++20
0 / 100
75 ms11336 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, q;
vector<int> x;
signed main() {
    cin >> n >> q;
    x.resize(q);
    set<int> people, val;
    for (int i=0; i<q; i++) {
        cin >> x[i];
        people.insert(x[i]);
    }

    int count =0;
    for (int i=0; i<q; i++) {
        if (x[i] <0)
           people.insert(x[i]);
        if (x[i]>0) {
            if (people.find(x[i])!=people.end())people.erase(x[i]);
            else count++;
        }
    }
    cout << count << 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...