| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1235176 | ceresna | Infinite Race (EGOI24_infiniterace2) | C++20 | 14 ms | 1864 KiB |
#include<bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
long long n, q;
cin >> n >> q;
vector<long long> bezci(n, -1); // 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]--;
else if (bezci[a] == lap)
{
bezci[a]++;
lap++;
}
else bezci[a] = lap;
}
cout << lap << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
