| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1146277 | FZ_Laabidi | Infinite Race (EGOI24_infiniterace2) | C++20 | 20 ms | 1864 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, q;
vector<int> x;
signed main() {
cin >> n >> q;
x.resize(q);
for (int i=0; i<q; i++)cin >> x[i];
if (n==2) {
int val = -1;
int count =0;
for (int i=0; i<q; i++) {
if (x[i]==1) {
if (val == -1)val = 0;
else count++;
}
if (x[i]==-1)val = -1;
}
cout << count << endl;
}
}| # | 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... | ||||
