Submission #1158439

#TimeUsernameProblemLanguageResultExecution timeMemory
1158439The_SamuraiGame (APIO22_game)C++20
0 / 100
0 ms408 KiB
#include "game.h"
#include "bits/stdc++.h"
using namespace std;
const int inf = 1e9;

int n, k;
vector<vector<int>> g;
vector<int> vis;
bool found;

void init(int _n, int _k) {
    n = _n, k = _k;
    g.assign(n, vector<int>());
    found = false;
    for (int i = 1; i < k; i++) g[i - 1].emplace_back(i);
}

int dfs(int u) {
    vis[u] = 1;
    for (int v: g[u]) {
        if (v < k and vis[v] == 1) return 1;
        if (!vis[v]) {
            if (dfs(v)) return 1;
        }
    }
    vis[u] = 2;
    return 0;
}

int add_teleporter(int u, int v) {
    found |= u >= v;
    return found;
    g[u].emplace_back(v);
    vis = vector(n, 0);
    return dfs(0);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...