oj.uz

Submission #853514

# Submission time Handle Problem Language Result Execution time Memory
853514 2023-09-24T13:36:08 Z mdobric Cop and Robber (BOI14_coprobber) C++11
100 / 100
 511 ms 10012 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 potez[505][505];

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;
					potez[v[x][i]][y] = x;
					q.push(make_pair(v[x][i], y));
					red.push(0);
				}
			}
			if (dp[x][y][0] == -1){
				dp[x][y][0] = 2;
				potez[x][y] = x;
				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() and dp[x][v[y][i]][1] == -1){
					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 ans;
}

int nextMove(int R) {
	ans = potez[ans][R];
	return ans;
}

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

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:40:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |    for (int i = 0; i < v[x].size(); i++){
      |                    ~~^~~~~~~~~~~~~
coprobber.cpp:57:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |    for (int i = 0; i < v[y].size(); i++){
      |                    ~~^~~~~~~~~~~~~
coprobber.cpp:59:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     if (brojac[x][v[y][i]] == v[v[y][i]].size() and dp[x][v[y][i]][1] == -1){
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4692 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 41 ms 5756 KB Output is correct
5 Correct 11 ms 5308 KB Output is correct
6 Correct 48 ms 6120 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 44 ms 5916 KB Output is correct
4 Correct 43 ms 5708 KB Output is correct
5 Correct 49 ms 6016 KB Output is correct
6 Correct 44 ms 5732 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4696 KB Output is correct
14 Correct 2 ms 4696 KB Output is correct
15 Correct 1 ms 4696 KB Output is correct
16 Correct 1 ms 4696 KB Output is correct
17 Correct 4 ms 4952 KB Output is correct
18 Correct 2 ms 4696 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4692 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 41 ms 5756 KB Output is correct
5 Correct 11 ms 5308 KB Output is correct
6 Correct 48 ms 6120 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 44 ms 5916 KB Output is correct
10 Correct 43 ms 5708 KB Output is correct
11 Correct 49 ms 6016 KB Output is correct
12 Correct 44 ms 5732 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4696 KB Output is correct
23 Correct 2 ms 4696 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 2 ms 4696 KB Output is correct
27 Correct 1 ms 4696 KB Output is correct
28 Correct 1 ms 4696 KB Output is correct
29 Correct 4 ms 4952 KB Output is correct
30 Correct 2 ms 4696 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 49 ms 6032 KB Output is correct
36 Correct 11 ms 5208 KB Output is correct
37 Correct 49 ms 6324 KB Output is correct
38 Correct 1 ms 4440 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Correct 51 ms 6056 KB Output is correct
41 Correct 48 ms 5928 KB Output is correct
42 Correct 42 ms 6096 KB Output is correct
43 Correct 43 ms 5732 KB Output is correct
44 Correct 1 ms 4440 KB Output is correct
45 Correct 1 ms 4440 KB Output is correct
46 Correct 1 ms 4440 KB Output is correct
47 Correct 1 ms 4440 KB Output is correct
48 Correct 1 ms 4696 KB Output is correct
49 Correct 2 ms 4696 KB Output is correct
50 Correct 1 ms 4440 KB Output is correct
51 Correct 1 ms 4696 KB Output is correct
52 Correct 2 ms 4696 KB Output is correct
53 Correct 1 ms 4696 KB Output is correct
54 Correct 1 ms 4696 KB Output is correct
55 Correct 4 ms 4952 KB Output is correct
56 Correct 2 ms 4696 KB Output is correct
57 Correct 3 ms 4696 KB Output is correct
58 Correct 13 ms 4848 KB Output is correct
59 Correct 17 ms 4836 KB Output is correct
60 Correct 511 ms 10012 KB Output is correct
61 Correct 48 ms 6368 KB Output is correct
62 Correct 45 ms 6240 KB Output is correct
63 Correct 322 ms 8672 KB Output is correct
64 Correct 30 ms 5508 KB Output is correct
65 Correct 381 ms 9740 KB Output is correct
66 Correct 52 ms 6700 KB Output is correct
67 Correct 193 ms 8116 KB Output is correct
68 Correct 56 ms 5548 KB Output is correct
69 Correct 1 ms 4440 KB Output is correct