| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1313670 | shirokito | Game (IOI14_game) | C++20 | 162 ms | 7076 KiB |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
using ll = long long;
const int N = 2e5 + 24;
int cnt[N];
void initialize(int n) {
for (int i = 0; i < n; i++) cnt[i] = i;
}
int hasEdge(int u, int v) {
return --cnt[max(u, v)] == 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... | ||||
