Submission #1221458

#TimeUsernameProblemLanguageResultExecution timeMemory
1221458gry3125Infinite Race (EGOI24_infiniterace2)C++20
0 / 100
30 ms2628 KiB
#include <bits/stdc++.h> #define f0r(i,n) for(int i=0;i<n;i++) typedef long long int ll; using namespace std; int main() { int n, q, ans = 0; cin >> n >> q; vector<int> a(q), cnt(n), cur(n); f0r(i,q) cin >> a[i]; for (int i = 0; i < q; i++) { if (cur[a[i]] == 0) { if (a[i] > 0) cur[a[i]] = 1; else cur[a[i]] = -1; continue; } if (a[i] > 0 && cur[a[i]] == 1) cnt[a[i]]++; if (a[i] > 0) cur[a[i]] = 1; else cur[a[i]] = -1; } for (int i = 0; i < n; i++) { ans = max(ans, cnt[i]); } cout << ans; 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...