| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357365 | kawhiet | Game (APIO22_game) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
int n, k;
vector<vector<int>> g;
vector<bool> vis;
void dfs(int u) {
for (auto v : g[u]) {
if (!vis[v]) {
vis[v] = true;
dfs(v);
}
}
}
void init(int _n, int _k) {
n = _n;
k = _k;
g.resize(n);
vis.resize(n);
for (int i = 0; i <= k - 2; i++) {
g[i].push_back(i + 1);
}
}
int add_teleporter(int u, int v) {
if (u >= v) {
return 1;
} else {
return 0;
}
g[u].push_back(v);
for (int i = 0; i < k; i++) {
fill(vis.begin(), vis.end(), false);
dfs(i);
if (vis[i]) {
return 1;
}
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
