oj.uz

Submission #854311

# Submission time Handle Problem Language Result Execution time Memory
854311 2023-09-26T17:51:22 Z fabijan_cikac Cop and Robber (BOI14_coprobber) C++17
100 / 100
 267 ms 12000 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define pb push_back

//T = 0 - policajac na redu
struct state{
	int T, C, R;
};
 
const int N = 500;
 
vector<int> v[N];

int bio[2][N][N], dp[2][N][N];
int cnt[N][N], best[N][N]; int curr;
int start(int n, bool a[N][N]){
	for (int i = 0; i < n; ++i){
		for (int j = 0; j < n; ++j){
			if (a[i][j]) v[i].pb(j);
		}
	}
	
	queue<state> q;
	for (int i = 0; i < n; ++i){
		q.push({0, i, i}); q.push({1, i, i});
		bio[0][i][i] = 1; bio[1][i][i] = 1;
		dp[0][i][i] = 1; dp[1][i][i] = 1;
	}
	for (int i = 0; i < n; ++i){
		for (int j = 0; j < n; ++j)
			cnt[i][j] = (int)(v[j].size());
	}
	
	memset(best, -1, sizeof(best));
	while (!q.empty()){
		state X = q.front(); q.pop();
		if (!X.T){
			for (int z: v[X.R]){
				--cnt[X.C][z];
				if (cnt[X.C][z] == 0){
					bio[1][X.C][z] = 1;
					q.push({1, X.C, z});
				}
			}
		}
		else{
			if (!bio[0][X.C][X.R]){
				best[X.C][X.R] = X.C;
				bio[0][X.C][X.R] = 1;
				q.push({0, X.C, X.R});
			}
			for (int z: v[X.C]){
				if (!bio[0][z][X.R]){
					best[z][X.R] = X.C;
					bio[0][z][X.R] = 1;
					q.push({0, z, X.R});
				}
			}
		}
	}
	
	int idx = -1;
	for (int i = 0; i < n; ++i){
		int num = n;
		for (int j = 0; j < n; ++j)
			num -= bio[0][i][j];
		if (num == 0) idx = i;
	}
	
	curr = idx; return idx;
}
 
int nextMove(int R){
	return curr = best[curr][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 42 ms 7636 KB Output is correct
5 Correct 11 ms 7428 KB Output is correct
6 Correct 44 ms 8072 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 39 ms 7752 KB Output is correct
4 Correct 39 ms 7804 KB Output is correct
5 Correct 38 ms 7752 KB Output is correct
6 Correct 39 ms 7800 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 1 ms 6744 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 42 ms 7636 KB Output is correct
5 Correct 11 ms 7428 KB Output is correct
6 Correct 44 ms 8072 KB Output is correct
7 Correct 1 ms 6744 KB Output is correct
8 Correct 1 ms 6744 KB Output is correct
9 Correct 39 ms 7752 KB Output is correct
10 Correct 39 ms 7804 KB Output is correct
11 Correct 38 ms 7752 KB Output is correct
12 Correct 39 ms 7800 KB Output is correct
13 Correct 1 ms 6744 KB Output is correct
14 Correct 1 ms 6744 KB Output is correct
15 Correct 1 ms 6744 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6744 KB Output is correct
21 Correct 1 ms 6744 KB Output is correct
22 Correct 2 ms 6744 KB Output is correct
23 Correct 2 ms 6744 KB Output is correct
24 Correct 2 ms 6744 KB Output is correct
25 Correct 2 ms 6744 KB Output is correct
26 Correct 2 ms 6744 KB Output is correct
27 Correct 2 ms 6744 KB Output is correct
28 Correct 2 ms 6620 KB Output is correct
29 Correct 4 ms 6744 KB Output is correct
30 Correct 1 ms 6744 KB Output is correct
31 Correct 1 ms 6744 KB Output is correct
32 Correct 1 ms 6744 KB Output is correct
33 Correct 1 ms 6744 KB Output is correct
34 Correct 1 ms 6744 KB Output is correct
35 Correct 39 ms 7568 KB Output is correct
36 Correct 11 ms 7176 KB Output is correct
37 Correct 42 ms 8044 KB Output is correct
38 Correct 1 ms 6744 KB Output is correct
39 Correct 1 ms 6784 KB Output is correct
40 Correct 40 ms 7964 KB Output is correct
41 Correct 39 ms 7756 KB Output is correct
42 Correct 38 ms 8176 KB Output is correct
43 Correct 41 ms 7808 KB Output is correct
44 Correct 1 ms 6744 KB Output is correct
45 Correct 1 ms 6744 KB Output is correct
46 Correct 1 ms 6744 KB Output is correct
47 Correct 1 ms 6744 KB Output is correct
48 Correct 1 ms 6744 KB Output is correct
49 Correct 2 ms 6744 KB Output is correct
50 Correct 1 ms 6744 KB Output is correct
51 Correct 1 ms 6744 KB Output is correct
52 Correct 2 ms 6744 KB Output is correct
53 Correct 1 ms 6744 KB Output is correct
54 Correct 1 ms 6744 KB Output is correct
55 Correct 4 ms 6744 KB Output is correct
56 Correct 2 ms 6744 KB Output is correct
57 Correct 4 ms 6744 KB Output is correct
58 Correct 11 ms 6960 KB Output is correct
59 Correct 17 ms 7024 KB Output is correct
60 Correct 267 ms 12000 KB Output is correct
61 Correct 32 ms 8528 KB Output is correct
62 Correct 32 ms 8272 KB Output is correct
63 Correct 205 ms 10540 KB Output is correct
64 Correct 26 ms 7604 KB Output is correct
65 Correct 214 ms 11652 KB Output is correct
66 Correct 55 ms 8540 KB Output is correct
67 Correct 116 ms 9888 KB Output is correct
68 Correct 38 ms 7572 KB Output is correct
69 Correct 1 ms 6744 KB Output is correct