Submission #1166258

#TimeUsernameProblemLanguageResultExecution timeMemory
1166258uranhishigInfinite Race (EGOI24_infiniterace2)C++20
100 / 100
224 ms19016 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define all(a) (a).begin(),(a).end() #define rep(i, n) for(int i = 0; i < (n); i++) #define rep1(i, n) for(int i = 1; i <= (n); i++) const int mod = 1000000007; map<int, int> mp; int O = 0; signed main(){ int n, q; cin >> n >> q; int cur = 1, ans = 0; while (q--) { int x; cin >> x; mp[x]++; if (x < 0) { mp[-x] = 0; } else { if (mp[x] > cur) { ans++; cur++; } mp[x] = cur; } } cout << ans << endl; 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...