Submission #255049

#	Time	Username	Problem	Language	Result	Execution time	Memory
255049		super_j6	Cop and Robber (BOI14_coprobber)	C++14	16 / 100	187 ms	3704 KiB

coprobber

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

const int inf = 0x3f3f3f3f;
const int mxn = 500;
int n, c;
int g[mxn][mxn], d[mxn][mxn];

int start(int N, bool G[mxn][mxn]){
	n = N;
	
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		d[i][j] = !(g[i][j] = G[i][j]) * (inf - 1) + 1; 
	}
	
	for(int l = 0; l < n; l++)
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		d[i][j] = min(d[i][j], d[i][l] + d[l][j]);
	}
	
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
		if(d[i][j] == inf) return -1;
	}
	
	return c = 0;
}

int nextMove(int r){
	int ret = c;
	for(int i = 0; i < n; i++){
		if(g[c][i] && d[i][r] < d[ret][r]) ret = i;
	}
	for(int i = 0, j = 0; i < n; i++){
		j += g[c][i] && d[i][r] == ret;
		if(j > 1) return c;
	}
	return c = ret;
}

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