Submission #1368409

#TimeUsernameProblemLanguageResultExecution timeMemory
1368409faricaGame (APIO22_game)C++20
0 / 100
0 ms344 KiB

#include <bits/stdc++.h>

using namespace std;
using vi = vector<int>;
using pi = pair<int,int>;
using ll = long long;

int N, K;
vector<vi>adjL;

void init(int n, int k) {
    N = n, K = k;
    adjL.assign(n, vi());
}

vector<bool>vis;

bool dfs(int pos) {
    if(vis[pos] && !pos) return 1;
    else if(vis[pos]) return 0;
    vis[pos] = 1;
    bool ans = 0;
    for(int adj: adjL[pos]) ans = ans | dfs(adj);
    return ans;
}

int add_teleporter(int u, int v) {
    if(u < K && v < K) {
        if(v == u+1) return 0;
        return 1;
    }
    if(u < K) u = 0;
    if(v < K) v = 0;
    adjL[u].push_back(v);
    vis.assign(N, 0);
    return dfs(0);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...