Submission #398954

#	Time	Username	Problem	Language	Result	Execution time	Memory
398954		shrimb	Cop and Robber (BOI14_coprobber)	C++17	16 / 100	57 ms	1716 KiB

coprobber

#include "coprobber.h"
#include "bits/stdc++.h"
using namespace std;

vector<int> adj[501];
int cur = 0, nig;

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]) adj[i].push_back(j);
		}
	}
	return 0;
}

bool check (int c, int p) {
	bool res = 0;
	for (int i : adj[c]) {
		if (i == p) continue;
		if (i == nig) return 1;
		res |= check(i, c);
	}
	return res;
}

int nextMove(int R) {
	nig = R;
	for (int i : adj[cur]) {
		if (i == R || check(i, cur)) return cur = i;
	}
	return -1;
}

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