| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1235163 | ceresna | Infinite Race (EGOI24_infiniterace2) | C++20 | 1096 ms | 1864 KiB |
#include<bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
long long n, q;
cin >> n >> q;
vector<long long> bezci(n, false); // 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] = false;
else if (bezci[a])
{
bezci.clear();
bezci.resize(n, false);
bezci[a] = true;
lap++;
}
else bezci[a] = true;
}
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... | ||||
