Submission #854310

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
854310	2023-09-26T17:49:53 Z	fabijan_cikac	Cop and Robber (BOI14_coprobber)	C++17	100 / 100	259 ms	11916 KB

coprobber

#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();
		//cout << X.T << ' ' << X.C << ' ' << X.R << endl;
		//cout << "!!!! " << cnt[0][1] << endl;
		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; dp[1][X.C][z] = 1;
					q.push({1, X.C, z});
				}
			}
		}
		else{
			if (!bio[0][X.C][X.R]){
				if (best[X.C][X.R] == -1) best[X.C][X.R] = X.C;
				bio[0][X.C][X.R] = 1; dp[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]){
					if (best[z][X.R] == -1) best[z][X.R] = X.C;
					bio[0][z][X.R] = 1; dp[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 -= dp[0][i][j];
		if (num == 0) idx = i;
	}
	
	curr = idx; return idx;
}
 
int nextMove(int R){
	return curr = best[curr][R];
}

/*bool A[N][N];
int main(){
	int n; cin >> n;
	for (int i = 0; i < n; ++i){
		for (int j = 0; j < n; ++j)
			cin >> A[i][j];
	}
	cout << start(n, A) << endl;
	while (1){
		int x; cin >> x;
		if (x == -1) break;
		cout << nextMove(x) << endl;
	}
}*/

Subtask #1
16.0 / 16.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	6892 KB	Output is correct
4	Correct	38 ms	7692 KB	Output is correct
5	Correct	11 ms	7220 KB	Output is correct
6	Correct	43 ms	8168 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	38 ms	7768 KB	Output is correct
4	Correct	38 ms	7624 KB	Output is correct
5	Correct	38 ms	7976 KB	Output is correct
6	Correct	40 ms	7616 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	1 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	6744 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	1 ms	6744 KB	Output is correct
2	Correct	1 ms	6744 KB	Output is correct
3	Correct	1 ms	6892 KB	Output is correct
4	Correct	38 ms	7692 KB	Output is correct
5	Correct	11 ms	7220 KB	Output is correct
6	Correct	43 ms	8168 KB	Output is correct
7	Correct	1 ms	6744 KB	Output is correct
8	Correct	1 ms	6744 KB	Output is correct
9	Correct	38 ms	7768 KB	Output is correct
10	Correct	38 ms	7624 KB	Output is correct
11	Correct	38 ms	7976 KB	Output is correct
12	Correct	40 ms	7616 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	1 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	6744 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	38 ms	7668 KB	Output is correct
36	Correct	11 ms	7228 KB	Output is correct
37	Correct	42 ms	8060 KB	Output is correct
38	Correct	1 ms	6744 KB	Output is correct
39	Correct	1 ms	6744 KB	Output is correct
40	Correct	38 ms	7788 KB	Output is correct
41	Correct	37 ms	7804 KB	Output is correct
42	Correct	38 ms	7768 KB	Output is correct
43	Correct	39 ms	7588 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	6996 KB	Output is correct
47	Correct	1 ms	6744 KB	Output is correct
48	Correct	2 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	2 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	6756 KB	Output is correct
59	Correct	16 ms	6996 KB	Output is correct
60	Correct	259 ms	11916 KB	Output is correct
61	Correct	32 ms	8280 KB	Output is correct
62	Correct	30 ms	8240 KB	Output is correct
63	Correct	185 ms	10300 KB	Output is correct
64	Correct	25 ms	7960 KB	Output is correct
65	Correct	208 ms	11424 KB	Output is correct
66	Correct	44 ms	8392 KB	Output is correct
67	Correct	112 ms	9856 KB	Output is correct
68	Correct	39 ms	7588 KB	Output is correct
69	Correct	1 ms	6744 KB	Output is correct

Submission #854310

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 14.0 / 14.0

Subtask #3 30.0 / 30.0

Subtask #4 40.0 / 40.0

Subtask #1
16.0 / 16.0

Subtask #2
14.0 / 14.0

Subtask #3
30.0 / 30.0

Subtask #4
40.0 / 40.0