Submission #613692

#	Time	Username	Problem	Language	Result	Execution time	Memory
613692		amunduzbaev	Cop and Robber (BOI14_coprobber)	C++17	0 / 100	2 ms	2512 KiB

coprobber

#include "coprobber.h"
#include "bits/stdc++.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif

const int M = 505;
vector<int> edges[M];
int par[M][M], v;
int used[M][M], a[M][M];

int start(int n, bool A[MAX_N][MAX_N]){
	memset(par, -1, sizeof par);
	
	int m = 0;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			a[i][j] = A[i][j];
			if(a[i][j]) edges[i].push_back(j), m++;
		}
	}
	assert(m == 2 * (n - 1));
	
	for(int i=0;i<n;i++){
		queue<int> q; q.push(i);
		par[i][i] = i;
		while(!q.empty()){
			int u = q.front(); q.pop();
			for(auto x : edges[u]){
				if(par[i][x] == -1){
					par[i][x] = u, q.push(x);
				}
			}
		}
	}
	v = 1;
	return 1;
}

int nextMove(int R){
	if(used[v][R]){
		assert(false);
	} else {
		used[v][R] = 1;
	}
	return par[R][v];
}

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