제출 #1226522

#제출 시각아이디문제언어결과실행 시간메모리
1226522gry3125Infinite Race (EGOI24_infiniterace2)C++20
100 / 100
39 ms1984 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; int idx = 0, cur = 0; vector<int> a(q), mp(n); f0r(i,q) cin >> a[i]; f0r(i,n) mp[i] = -1; for (int i = 0; i < q; i++) { if (a[i] > 0 && mp[a[i]] >= idx) { ans++; idx = i; } if (a[i] < 0) mp[-a[i]] = -1; else mp[a[i]] = 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...