Submission #143370

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
143370	2019-08-13T21:21:12 Z	Sorting	Cop and Robber (BOI14_coprobber)	C++14	100 / 100	853 ms	8172 KB

coprobber

#include "coprobber.h"
#include <bits/stdc++.h>

using namespace std;

struct Node{
	int x, y;
	bool turn;

	Node(){}
	Node(int x, int y, bool turn){
		this -> x = x;
		this -> y = y;
		this -> turn = turn;
	}
};

int dp[MAX_N][MAX_N][2], movea[MAX_N][MAX_N];
bool used[MAX_N][MAX_N][2];
int cnt[MAX_N][MAX_N];
int n;

int cop;

int start(int N, bool A[MAX_N][MAX_N]){
    n = N;
    for(int i = 0; i < n; ++i){
    	for(int j = 0; j < n; ++j){
    		A[i][j] = A[i][j];
    	}
    }

    for(int i = 0; i < n; ++i){
    	for(int j = 0; j < n; ++j){
    		movea[i][j] = -1;
    	}
    }

    queue<Node> q;

    for(int i = 0; i < n; i++){
    	int t = 0;
    	for(int j = 0; j < n; j++){
    		if(A[i][j]){
    			t++;
    		}
    	}
    	for(int j = 0; j < n; j++){
    		cnt[j][i] = t;
    	}
    }

    for(int i = 0; i < n; ++i){
    	q.push(Node(i, i, false));
    	q.push(Node(i, i, true));
    	used[i][i][1] = true;
    	used[i][i][0] = true;
    	movea[i][i] = i;
    }

    while(!q.empty()){
    	Node t = q.front();
    	q.pop();

    	//cout << t.x << " " << t.y << " " << t.turn << endl;

    	if(t.turn){
    		for(int i = 0; i < n; ++i){
    			if(A[i][t.x] || i == t.x){
    				if(used[i][t.y][!t.turn]){
    					continue;
    				}
    				used[i][t.y][!t.turn] = true;
    				movea[i][t.y] = t.x; 
    				q.push(Node(i, t.y, !t.turn));
    			}
    		}
    	}
    	else{
    		for(int i = 0; i < n; ++i){
    			if(A[i][t.y]){
    				cnt[t.x][i]--;
    				if(!cnt[t.x][i]){
    					used[t.x][i][!t.turn] = true;
    					q.push(Node(t.x, i, !t.turn));
    				}
    			}
    		}
    	}
    }

    cop = -1;
    for(int i = 0; i < n; ++i){
    	int ok = true;
    	for(int j = 0; j < n; ++j){
    		if(movea[i][j] == -1){
    			ok = false;
    			break;
    		}
    	}
    	if(ok){
    		cop = i;
    	}
    }

    return cop;
}

int nextMove(int R){
	cop = movea[cop][R];

	return cop;
}
/*
g++ "Baltic 14-coprobber.cpp" grader.cpp -std=c++11 -O2 -static -Wall -o coprobber
*/
/*
4
0 1 0 0
1 0 1 0
0 1 0 1
0 0 1 0
0
*/

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	396 KB	Output is correct
4	Correct	359 ms	5588 KB	Output is correct
5	Correct	51 ms	2556 KB	Output is correct
6	Correct	453 ms	6020 KB	Output is correct

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	508 KB	Output is correct
3	Correct	366 ms	5520 KB	Output is correct
4	Correct	362 ms	5880 KB	Output is correct
5	Correct	349 ms	5504 KB	Output is correct
6	Correct	397 ms	5504 KB	Output is correct

Subtask #3
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	508 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	632 KB	Output is correct
10	Correct	3 ms	888 KB	Output is correct
11	Correct	5 ms	888 KB	Output is correct
12	Correct	2 ms	504 KB	Output is correct
13	Correct	3 ms	760 KB	Output is correct
14	Correct	5 ms	888 KB	Output is correct
15	Correct	4 ms	760 KB	Output is correct
16	Correct	4 ms	760 KB	Output is correct
17	Correct	9 ms	1272 KB	Output is correct
18	Correct	3 ms	888 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct

Subtask #4
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	396 KB	Output is correct
4	Correct	359 ms	5588 KB	Output is correct
5	Correct	51 ms	2556 KB	Output is correct
6	Correct	453 ms	6020 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	508 KB	Output is correct
9	Correct	366 ms	5520 KB	Output is correct
10	Correct	362 ms	5880 KB	Output is correct
11	Correct	349 ms	5504 KB	Output is correct
12	Correct	397 ms	5504 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	508 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	632 KB	Output is correct
22	Correct	3 ms	888 KB	Output is correct
23	Correct	5 ms	888 KB	Output is correct
24	Correct	2 ms	504 KB	Output is correct
25	Correct	3 ms	760 KB	Output is correct
26	Correct	5 ms	888 KB	Output is correct
27	Correct	4 ms	760 KB	Output is correct
28	Correct	4 ms	760 KB	Output is correct
29	Correct	9 ms	1272 KB	Output is correct
30	Correct	3 ms	888 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	380 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	360 ms	5668 KB	Output is correct
36	Correct	51 ms	2552 KB	Output is correct
37	Correct	422 ms	5724 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	2 ms	504 KB	Output is correct
40	Correct	363 ms	5668 KB	Output is correct
41	Correct	362 ms	5596 KB	Output is correct
42	Correct	350 ms	5496 KB	Output is correct
43	Correct	398 ms	5528 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	2 ms	376 KB	Output is correct
46	Correct	2 ms	376 KB	Output is correct
47	Correct	2 ms	376 KB	Output is correct
48	Correct	3 ms	888 KB	Output is correct
49	Correct	4 ms	888 KB	Output is correct
50	Correct	2 ms	504 KB	Output is correct
51	Correct	3 ms	764 KB	Output is correct
52	Correct	5 ms	888 KB	Output is correct
53	Correct	3 ms	760 KB	Output is correct
54	Correct	4 ms	760 KB	Output is correct
55	Correct	9 ms	1272 KB	Output is correct
56	Correct	3 ms	888 KB	Output is correct
57	Correct	7 ms	1528 KB	Output is correct
58	Correct	19 ms	2808 KB	Output is correct
59	Correct	31 ms	3576 KB	Output is correct
60	Correct	523 ms	8172 KB	Output is correct
61	Correct	146 ms	4220 KB	Output is correct
62	Correct	134 ms	4344 KB	Output is correct
63	Correct	600 ms	7124 KB	Output is correct
64	Correct	112 ms	4088 KB	Output is correct
65	Correct	853 ms	8140 KB	Output is correct
66	Correct	380 ms	5880 KB	Output is correct
67	Correct	775 ms	7060 KB	Output is correct
68	Correct	307 ms	3916 KB	Output is correct
69	Correct	2 ms	376 KB	Output is correct

Submission #143370

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