oj.uz

Submission #118670

# Submission time Handle Problem Language Result Execution time Memory
118670 2019-06-19T10:42:28 Z onjo0127 Cop and Robber (BOI14_coprobber) C++11
0 / 100
 2 ms 512 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;

int now, n, D[MAX_N][MAX_N][2], deg[MAX_N][MAX_N], p = -1;
bool adj[MAX_N][MAX_N], vs[MAX_N][MAX_N];

void go(int c, int r, int t) {
	if(D[c][r][t] == 0) return;
	if(c != r && t == 1 && --deg[c][r] > 0) return;
	D[c][r][t] = 0;
	if(t == 0) {
		for(int i=0; i<n; i++) {
			if(adj[r][i]) go(c, i, 1);
		}
	}
	else {
		go(c, r, 0);
		for(int i=0; i<n; i++) {
			if(adj[c][i]) go(i, r, 0);
		}
	}
}

int start(int N, bool A[MAX_N][MAX_N]) {
	n = N;
	for(int i=0; i<n; i++) for(int j=0; j<n; j++) D[i][j][0] = D[i][j][1] = 1;
	for(int i=0; i<n; i++) for(int j=0; j<n; j++) adj[i][j] = A[i][j], deg[0][i] += A[i][j];
	for(int i=1; i<n; i++) for(int j=0; j<n; j++) deg[i][j] = deg[0][j];
	for(int i=0; i<n; i++) {go(i, i, 0); go(i, i, 1);}
	for(int i=0; i<n; i++) {
		bool fl = 1;
		for(int j=0; j<n; j++) if(D[i][j][0] == 1) fl = 0;
		if(fl) {
			return now = i;
		}
	}
	return -1;
}

bool chk(int v, int R) {
	for(int i=0; i<n; i++) if(adj[R][i] && vs[v][i]) return 0;
	return 1;
}

int nextMove(int R) {
	vs[now][R] = 1;
	if(D[now][R][1] == 0 && chk(now, R)) return now;
	for(int i=0; i<n; i++) {
		if(adj[now][i] && D[i][R][1] == 0 && chk(i, R)) return now = i;
	}
	return -1;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Incorrect 2 ms 512 KB nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one
4 Halted 0 ms 0 KB -