Submission #398945

#	Time	Username	Problem	Language	Result	Execution time	Memory
398945		shrimb	Cop and Robber (BOI14_coprobber)	C++17	0 / 100	151 ms	262148 KiB

coprobber

#include"bits/stdc++.h"
using namespace std;
#define MAX_N 500
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 == 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;
	}
}

// don't modify the main function
// int main() {
//     int N;
//     cin >> N;
//     bool A[MAX_N][MAX_N];
//     for (int i = 0; i < N; i++) {
//         for (int j = 0; j < N; j++) {
//             cin >> A[i][j];
//         }
//     }
//     int P = start(N,A);
//     cout << P << endl;
//     int R;
//     cin >> R;
//     while (true) {
//         if (P == R) break;
//         P = nextMove(R);
//         cout << P << endl;
//         if (P == R) break;
//         cin >> R;
//     }
// }

Compilation message (stderr)

coprobber.cpp: In function 'int nextMove(int)':
coprobber.cpp:30:1: warning: control reaches end of non-void function [-Wreturn-type]
   30 | }
      | ^

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