Submission #1240967

#TimeUsernameProblemLanguageResultExecution timeMemory
1240967aminabouakazInfinite Race (EGOI24_infiniterace2)C++20
0 / 100
17 ms328 KiB
#include <iostream>
#include <unordered_map>
using namespace std;

int main() {
    int n, q;
    cin >> n >> q;
    unordered_map<int,int> rp;
    int a = 0;
    for (int i = 0; i < q; ++i) {
        int x;
        cin >> x;
        if (x > 0) {
            if (rp[x] >= a) ++a;
            rp[x] = a - 1;
        } else {
            x = -x;
            if (rp[x] < a) rp[x] = a;
        }
    }
    cout << a << "\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...