Submission #119151

# Submission time Handle Problem Language Result Execution time Memory
119151 2019-06-20T13:45:04 Z imyujin Cop and Robber (BOI14_coprobber) C++14
100 / 100
589 ms 8928 KB
#include "coprobber.h"
#include<queue>
#include<tuple>

using namespace std;

typedef tuple<int, int, int> tiii;

const int INF=MAX_N*MAX_N;

bool adj[MAX_N][MAX_N];
bool chk[MAX_N][MAX_N];
int dp[MAX_N][MAX_N][2], deg[MAX_N][MAX_N];
queue<tiii> q;
int p;

int start(int N, bool A[MAX_N][MAX_N]){
	for(int i=0; i<N; i++) for(int j=0; j<N; j++){
		adj[i][j]=A[i][j];
		dp[i][j][0]=dp[i][j][1]=-1;
		if(A[i][j]) deg[0][i]++;
	}
	for(int i=0; i<N; i++) for(int j=1; j<N; j++) deg[j][i]=deg[0][i];
	for(int i=0; i<N; i++){
		q.push(make_tuple(i, i, 0));
		q.push(make_tuple(i, i, 1));
		dp[i][i][0]=dp[i][i][1]=0;
	}
	while(!q.empty()){
		int c, r, t;
		tie(c, r, t)=q.front();
		q.pop();
		//printf("[%d %d %d]\n", c, r, t);
		if(t==0){
			for(int i=0; i<N; i++) if(A[i][r]&&dp[c][i][1]==-1){
				deg[c][i]--;
				if(deg[c][i]==0){
					//printf("(%d %d %d)\n", c, i, 1);
					q.push(make_tuple(c, i, 1));
					dp[c][i][1]=dp[c][r][t]+1;
				}
			}
		}
		else{
			for(int i=0; i<N; i++) if((c==i||A[c][i])&&dp[i][r][0]==-1){
				//printf("(%d %d %d)\n", i, r, 0);
				q.push(make_tuple(i, r, 0));
				dp[i][r][0]=dp[c][r][t]+1;
			}
		}
	}

	/*
	for(int k=0; k<2; k++){
	for(int i=0; i<N; i++){
		for(int j=0; j<N; j++) printf("%d ", dp[i][j][0]);
		printf("\n");
	}
	printf("****\n");
	}
	*/
	
	for(int i=0; i<N; i++){
		bool b=true;
		for(int j=0; j<N; j++) if(dp[i][j][0]==-1) b=false;
		if(b) return p=i;
	}
	return -1;
}

int nextMove(int R){
	for(int i=0;; i++) if((adj[p][i]||i==p)&&dp[i][R][1]==dp[p][R][0]-1) return p=i;
	//return -1;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 253 ms 6392 KB Output is correct
5 Correct 41 ms 3064 KB Output is correct
6 Correct 315 ms 6620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 257 ms 6348 KB Output is correct
4 Correct 255 ms 6392 KB Output is correct
5 Correct 243 ms 6292 KB Output is correct
6 Correct 299 ms 6296 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 396 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 4 ms 1024 KB Output is correct
11 Correct 4 ms 1152 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 12 ms 896 KB Output is correct
14 Correct 5 ms 1024 KB Output is correct
15 Correct 3 ms 832 KB Output is correct
16 Correct 4 ms 768 KB Output is correct
17 Correct 8 ms 1408 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 253 ms 6392 KB Output is correct
5 Correct 41 ms 3064 KB Output is correct
6 Correct 315 ms 6620 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 257 ms 6348 KB Output is correct
10 Correct 255 ms 6392 KB Output is correct
11 Correct 243 ms 6292 KB Output is correct
12 Correct 299 ms 6296 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 396 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 4 ms 1024 KB Output is correct
23 Correct 4 ms 1152 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 12 ms 896 KB Output is correct
26 Correct 5 ms 1024 KB Output is correct
27 Correct 3 ms 832 KB Output is correct
28 Correct 4 ms 768 KB Output is correct
29 Correct 8 ms 1408 KB Output is correct
30 Correct 3 ms 1024 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 254 ms 6344 KB Output is correct
36 Correct 40 ms 2936 KB Output is correct
37 Correct 329 ms 6648 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 3 ms 512 KB Output is correct
40 Correct 262 ms 6400 KB Output is correct
41 Correct 251 ms 6364 KB Output is correct
42 Correct 246 ms 6308 KB Output is correct
43 Correct 325 ms 6264 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 2 ms 384 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 4 ms 1024 KB Output is correct
49 Correct 4 ms 1024 KB Output is correct
50 Correct 2 ms 512 KB Output is correct
51 Correct 3 ms 896 KB Output is correct
52 Correct 5 ms 1024 KB Output is correct
53 Correct 3 ms 768 KB Output is correct
54 Correct 3 ms 768 KB Output is correct
55 Correct 8 ms 1280 KB Output is correct
56 Correct 4 ms 1024 KB Output is correct
57 Correct 6 ms 1792 KB Output is correct
58 Correct 18 ms 3456 KB Output is correct
59 Correct 29 ms 4344 KB Output is correct
60 Correct 443 ms 8928 KB Output is correct
61 Correct 68 ms 4728 KB Output is correct
62 Correct 73 ms 5112 KB Output is correct
63 Correct 427 ms 7892 KB Output is correct
64 Correct 81 ms 4856 KB Output is correct
65 Correct 589 ms 8804 KB Output is correct
66 Correct 316 ms 6720 KB Output is correct
67 Correct 523 ms 7968 KB Output is correct
68 Correct 239 ms 4644 KB Output is correct
69 Correct 2 ms 384 KB Output is correct