oj.uz

Submission #853206

# Submission time Handle Problem Language Result Execution time Memory
853206 2023-09-23T16:04:24 Z mdobric Cop and Robber (BOI14_coprobber) C++11
0 / 100
 1 ms 2392 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAX_N 500

vector <int> v[505];
int dp[505][505][2];
int brojac[505][505];
int ans;
queue <pair <int, int> > q;
queue <int> red;

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] == true){
				v[i].push_back(j);
			}
			dp[i][j][0] = -1;
			dp[i][j][1] = -1;
		}
	}
	
	for (int i = 0; i < N; i++){
		dp[i][i][0] = 2;
		dp[i][i][1] = 2;
		q.push(make_pair(i, i));
		red.push(0);
		q.push(make_pair(i, i));
		red.push(1);
	}
	while (!q.empty()){
		int x = q.front().first;
		int y = q.front().second;
		int r = red.front();
		q.pop();
		red.pop();
		if (dp[x][y][r] == 2 and r == 1){
			for (int i = 0; i < v[x].size(); i++){
				if (dp[v[x][i]][y][0] == -1){
					dp[v[x][i]][y][0] = 2;
					q.push(make_pair(v[x][i], y));
					red.push(0);
				}
			}
			if (dp[x][y][0] == -1){
				dp[x][y][0] = 2;
				q.push(make_pair(x, y));
				red.push(0);
			}
		}
		else
		if (dp[x][y][r] == 2 and r == 0){
			for (int i = 0; i < v[y].size(); i++){
				brojac[x][v[y][i]]++;
				if (brojac[x][v[y][i]] = v[v[y][i]].size()){
					dp[x][v[y][i]][1] = 2;
					q.push(make_pair(x, v[y][i]));
					red.push(1);
				}
			}
		}
	}
	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++){
			if (dp[i][j][0] == -1){
				dp[i][j][0] = 1;
			}
			if (dp[i][j][1] == -1){
				dp[i][j][1] = 1;
			}
		}
	}
	
	ans = -1;
	for (int i = 0; i < N; i++){
		int brojac = 0;
		for (int j = 0; j < N; j++){
			if (dp[i][j][0] == 2){
				brojac++;
			}
		}
		if (brojac == N){
			ans = i;
		}
	}
	*/
	return 0;
}

int nextMove(int R) {
	return R;
}

/*
int main (void){
	
	return 0;
}
*/

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Incorrect 1 ms 2392 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 Incorrect 0 ms 2392 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
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Incorrect 1 ms 2392 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 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Incorrect 1 ms 2392 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 -