Submission #1235155

#TimeUsernameProblemLanguageResultExecution timeMemory
1235155ceresnaInfinite Race (EGOI24_infiniterace2)C++20
29 / 100
32 ms1864 KiB
#include<bits/stdc++.h> using namespace std; int main() { long long n, q; cin >> n >> q; vector<long long> bezci(n, false); // false ak su pred, true ak su za long long lap = 0; for (long long i = 0; i < q; i++) { long long a; cin >> a; if (a < 0) bezci[-a] = false; else if (bezci[a]) { bezci.resize(n, false); bezci[a] = true; lap++; } else bezci[a] = true; } cout << lap << '\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...