Submission #1323018

#TimeUsernameProblemLanguageResultExecution timeMemory
1323018JohanInfinite Race (EGOI24_infiniterace2)C++20
63 / 100
137 ms9672 KiB
#include<bits/stdc++.h> using namespace std; int main(){ int n, q, cnt = 0; cin >> n >> q; map < int , int > is; for(int _ = 0; _ < q; _++){ int x; cin >> x; if(x >= 0){ if(is[x] == cnt)cnt++; is[x] = cnt; } else { is[abs(x)] = max(is[abs(x)] - 1, 0); } } cout << cnt - 1 << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...