Submission #741873

#TimeUsernameProblemLanguageResultExecution timeMemory
741873vjudge1Game (APIO22_game)C++17
60 / 100
1014 ms32048 KiB

#include "game.h"
#include<bits/stdc++.h>
using namespace std;
int n, m, i, k;
bool vis[1010][30100];
vector<int> v[30001];
bool ans;
void init(int N, int K) {
	n = N;
	k = K;
	for(i = 0; i < k; i++)
        vis[i][i]=1;
}
void dfs(int x){
	if(ans) return;
	if(x <= i){
		ans=1;
		return;
	}
	if(vis[i][x]) return;
	vis[i][x] = 1;
	for(int it: v[x]) dfs(it);
}
int add_teleporter(int u, int p){
	v[u].push_back(p);
	for(i=0;i<k;i++){
		if(vis[i][u]){
			dfs(p);
		}
	}
	return ans;
}
#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...