Submission #105617

#	Time	Username	Problem	Language	Result	Execution time	Memory
105617		thiago4532	Cop and Robber (BOI14_coprobber)	C++17	0 / 100	222 ms	262144 KiB

coprobber

#include <bits/stdc++.h>
#define MAX_N 500

using namespace std;
vector<int> grafo[MAX_N];
int dist[MAX_N], pai[MAX_N];

void dfs(int u, int p=0) {
	pai[u] = p;
	for(auto v : grafo[u]) {
		if(v == p) continue;
		dist[v] = dist[u] + 1;
		dfs(v, u);
	}
}

int start(int N, bool A[MAX_N][MAX_N]) {
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(A[i][j]) grafo[i].push_back(j);
		}
	}
	dfs(0);
	return 0;
}

int nextMove(int R) {
	return 0;
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 14
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40