| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1206983 | trimkus | Infinite Race (EGOI24_infiniterace2) | C++20 | 31 ms | 1984 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int q;
cin >> n >> q;
vector<int> over(n + 1), cnt(n + 1);
for (int i = 0; i < q; ++i) {
int x;
cin >> x;
if (x < 0) {
x = -x;
over[x] = -1;
} else {
if (over[x] == 1) {
cnt[x]++;
} else {
over[x] = 1;
}
}
}
cout << *max_element(begin(cnt), end(cnt)) << "\n";
}
| # | 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... | ||||
