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