oj.uz

Submission #727449

# Submission time Handle Problem Language Result Execution time Memory
727449 2023-04-20T17:13:21 Z AdamGS Cop and Robber (BOI14_coprobber) C++17
100 / 100
 949 ms 8612 KB 
#include "coprobber.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=507;
int dp[LIM][LIM][2], deg[LIM][LIM], lst[LIM][LIM], akt;
int start(int n, bool A[MAX_N][MAX_N]) {
	queue<pair<pair<int,int>,int>>q;
	rep(i, n) {
		dp[i][i][0]=dp[i][i][1]=1;
		q.push({{i, i}, 0});
		q.push({{i, i}, 1});
	}
	rep(i, n) rep(j, n) if(i!=j) {
		rep(l, n) if(A[j][l]) ++deg[i][j];
	}
	while(!q.empty()) {
		int a=q.front().st.st, b=q.front().st.nd, c=q.front().nd; q.pop();
		if(c==0) {
			rep(i, n) if(A[i][b] && !dp[a][i][1]) {
				--deg[a][i];
				if(!deg[a][i]) {
					dp[a][i][1]=1;
					q.push({{a, i}, 1});
				}
			}
		} else {
			if(!dp[a][b][0]) {
				dp[a][b][0]=1;
				lst[a][b]=a;
				q.push({{a, b}, 0});
			}
			rep(i, n) if(A[i][a] && !dp[i][b][0]) {
				dp[i][b][0]=1;
				lst[i][b]=a;
				q.push({{i, b}, 0});
			}
		}
	}
	rep(i, n) {
		bool ok=true;
		rep(j, n) ok&=dp[i][j][0];
		if(ok) {
			akt=i;
			return akt;
		}
	}
	return -1;
}
int nextMove(int R) {
	akt=lst[akt][R];
	return akt;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 478 ms 5616 KB Output is correct
5 Correct 61 ms 2856 KB Output is correct
6 Correct 575 ms 5852 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 449 ms 5564 KB Output is correct
4 Correct 468 ms 5624 KB Output is correct
5 Correct 393 ms 5636 KB Output is correct
6 Correct 479 ms 5488 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 3 ms 1104 KB Output is correct
11 Correct 10 ms 1200 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 2 ms 848 KB Output is correct
14 Correct 6 ms 1104 KB Output is correct
15 Correct 3 ms 868 KB Output is correct
16 Correct 2 ms 848 KB Output is correct
17 Correct 15 ms 1412 KB Output is correct
18 Correct 3 ms 1104 KB Output is correct
19 Correct 1 ms 336 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 478 ms 5616 KB Output is correct
5 Correct 61 ms 2856 KB Output is correct
6 Correct 575 ms 5852 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 449 ms 5564 KB Output is correct
10 Correct 468 ms 5624 KB Output is correct
11 Correct 393 ms 5636 KB Output is correct
12 Correct 479 ms 5488 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 3 ms 1104 KB Output is correct
23 Correct 10 ms 1200 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 2 ms 848 KB Output is correct
26 Correct 6 ms 1104 KB Output is correct
27 Correct 3 ms 868 KB Output is correct
28 Correct 2 ms 848 KB Output is correct
29 Correct 15 ms 1412 KB Output is correct
30 Correct 3 ms 1104 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 500 ms 5620 KB Output is correct
36 Correct 80 ms 2888 KB Output is correct
37 Correct 444 ms 5884 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 435 ms 5604 KB Output is correct
41 Correct 411 ms 5628 KB Output is correct
42 Correct 433 ms 5612 KB Output is correct
43 Correct 572 ms 5496 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 4 ms 1104 KB Output is correct
49 Correct 8 ms 1104 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 2 ms 848 KB Output is correct
52 Correct 6 ms 1104 KB Output is correct
53 Correct 2 ms 848 KB Output is correct
54 Correct 2 ms 848 KB Output is correct
55 Correct 11 ms 1412 KB Output is correct
56 Correct 4 ms 1104 KB Output is correct
57 Correct 13 ms 1912 KB Output is correct
58 Correct 73 ms 3680 KB Output is correct
59 Correct 152 ms 4584 KB Output is correct
60 Correct 691 ms 8612 KB Output is correct
61 Correct 493 ms 5016 KB Output is correct
62 Correct 540 ms 5248 KB Output is correct
63 Correct 652 ms 7524 KB Output is correct
64 Correct 296 ms 5164 KB Output is correct
65 Correct 884 ms 8420 KB Output is correct
66 Correct 396 ms 6060 KB Output is correct
67 Correct 949 ms 7288 KB Output is correct
68 Correct 479 ms 4980 KB Output is correct
69 Correct 0 ms 336 KB Output is correct