| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1363198 | fv3 | Game (IOI14_game) | C++20 | 134 ms | 20324 KiB |
#include "game.h"
#include <bits/stdc++.h>
std::vector<int> adj[1500];
int cnt[1500], good[1500], sz = 1;
void initialize(int n) {
good[0] = 1;
}
int hasEdge(int u, int v) {
for (int _ = 2; _--; ) {
adj[v].push_back(u);
if (good[u] && ++cnt[v] == sz) {
sz++;
for (int e : adj[v]) cnt[e]++;
return good[v] = 1;
}
std::swap(u, v);
}
return 0;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
