Submission #1305805

#TimeUsernameProblemLanguageResultExecution timeMemory
1305805jojeonghoonGame (APIO22_game)C++20
0 / 100
2 ms332 KiB
#include <bits/stdc++.h>
#include "game.h"
using namespace std;

const int LM=300100;
int N,K;
vector<int>G[LM];

void init(int N_, int K_){
    N=N_;
    K=K_;
}

int D[LM];
int dfs(int x, int w){
    w+=x<K;
    if(D[x]) return D[x]<w;
    D[x]=w;
    for(int i:G[x]){
        if(dfs(i,w)) return 1;
    }
    
    return 0;
}

int add_teleporter(int u, int v){
    G[u].push_back(v);
    fill(D,D+N,0);
    D[u]=1;
    return dfs(v,1);
}
#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...