Submission #1201528

#TimeUsernameProblemLanguageResultExecution timeMemory
1201528adiyerGame (APIO22_game)C++20
2 / 100
6 ms12156 KiB
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 5e5 + 11;

int n, ok;
int was[MAXN];

vector < int > g[MAXN];

void dfs(int v){
    was[v] = 1;
    for(int u : g[v]){
        if(!was[u]) dfs(u);
        else if(was[u] == 1) ok = 1;
    }
    was[v] = 2;
}

void init(int _n, int k) {
    n = _n;
    for(int i = 0; i < k - 1; 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 < n; i++) was[i] = 0;
    dfs(1);
    return ok;
}
#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...