oj.uz

Submission #155441

# Submission time Handle Problem Language Result Execution time Memory
155441 2019-09-28T06:34:01 Z oolimry Cop and Robber (BOI14_coprobber) C++14
100 / 100
 1254 ms 8008 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
static bool states[500005]; //police * 1000 + robber * 2 + (IF POLICE TURN)
static int degree[500005];
static int to[500005];
//static vector<int> rev[500005];
static queue<int> can;
inline int g(int police, int robber, int turn){
	return police * 1000 + robber * 2 + turn;
}
int pos;
int start(int N, bool A[MAX_N][MAX_N])
{
	int n = N;
    for(int u = 0;u < n;u++){
		for(int v = 0;v < n;v++){
			int s = g(u,v,0);
			
			//rev[s+1].push_back(s); //Wait
			degree[s]++;
			for(int i = 0;i < n;i++){
				if(A[u][i] == 1){
					//rev[g(i,v,1)].push_back(s);
					degree[s]++;
				}
				if(A[v][i] == 1){
					//rev[g(u,i,0)].push_back(s+1);
					degree[s+1]++;
				}
			}
			
			
			if(u == v){
				states[s] = 1;
				states[s+1] = 1;
			}
		}
	}
	
	for(int i = 0;i < 500005;i++){
		if(states[i] == 1){
			can.push(i);
			degree[i] = 0;
		}
	}
	int work[n];
	fill(work,work+n,n);
	while(!can.empty()){
		int t = can.front();
		
		//cout << t << "\n";
		if(!(t&1)){
			int u = t/1000;
			work[u]--;
			if(work[u] == 0){
				pos = u;
				return u;
			}
		}
		can.pop();
		int u = t / 1000;
		int v = (t / 2) % 500;
		int tu = t & 1;
		for(int i = 0;i < N;i++){
			int s;
			
			if(tu == 1){
				if((A[u][i] == 0 && i != u))continue;
				s = g(i,v,0);
			}
			
			if(tu == 0){
				if(A[v][i] == 0) continue;
				s = g(u,i,1);
			}
			
			if(states[s] == 0){
				degree[s]--;
				if(!(s & 1)){
					can.push(s);
					states[s] = 1;
					degree[s] = 0;
					to[s] = t;
				}
				else if(degree[s] == 0){
					can.push(s);
					states[s] = 1;
				}
				
			}
		}
	}

	return -1;
}

int nextMove(int R)
{
    int cur = g(pos,R,0);
    int t = to[cur];
    t /= 1000;
    //cout << t << " " << R << "\n";
    pos = t;
    return t;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 286 ms 6240 KB Output is correct
5 Correct 44 ms 3064 KB Output is correct
6 Correct 286 ms 6008 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 252 ms 6040 KB Output is correct
4 Correct 291 ms 6096 KB Output is correct
5 Correct 239 ms 5872 KB Output is correct
6 Correct 293 ms 6000 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 286 ms 6240 KB Output is correct
5 Correct 44 ms 3064 KB Output is correct
6 Correct 286 ms 6008 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 252 ms 6040 KB Output is correct
10 Correct 291 ms 6096 KB Output is correct
11 Correct 239 ms 5872 KB Output is correct
12 Correct 293 ms 6000 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 4 ms 504 KB Output is correct
22 Correct 8 ms 1272 KB Output is correct
23 Correct 18 ms 1272 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 6 ms 1016 KB Output is correct
26 Correct 13 ms 1272 KB Output is correct
27 Correct 6 ms 888 KB Output is correct
28 Correct 6 ms 888 KB Output is correct
29 Correct 17 ms 1528 KB Output is correct
30 Correct 7 ms 1272 KB Output is correct
31 Correct 4 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 4 ms 376 KB Output is correct
34 Correct 4 ms 376 KB Output is correct
35 Correct 288 ms 6136 KB Output is correct
36 Correct 43 ms 3064 KB Output is correct
37 Correct 285 ms 6136 KB Output is correct
38 Correct 3 ms 376 KB Output is correct
39 Correct 4 ms 504 KB Output is correct
40 Correct 256 ms 6008 KB Output is correct
41 Correct 293 ms 6104 KB Output is correct
42 Correct 237 ms 5880 KB Output is correct
43 Correct 293 ms 6008 KB Output is correct
44 Correct 3 ms 376 KB Output is correct
45 Correct 4 ms 376 KB Output is correct
46 Correct 4 ms 504 KB Output is correct
47 Correct 4 ms 504 KB Output is correct
48 Correct 8 ms 1272 KB Output is correct
49 Correct 18 ms 1288 KB Output is correct
50 Correct 4 ms 632 KB Output is correct
51 Correct 6 ms 1016 KB Output is correct
52 Correct 13 ms 1272 KB Output is correct
53 Correct 5 ms 888 KB Output is correct
54 Correct 6 ms 888 KB Output is correct
55 Correct 17 ms 1528 KB Output is correct
56 Correct 7 ms 1272 KB Output is correct
57 Correct 27 ms 2168 KB Output is correct
58 Correct 124 ms 4156 KB Output is correct
59 Correct 256 ms 4984 KB Output is correct
60 Correct 692 ms 7160 KB Output is correct
61 Correct 1028 ms 5324 KB Output is correct
62 Correct 1114 ms 5880 KB Output is correct
63 Correct 728 ms 7924 KB Output is correct
64 Correct 486 ms 5816 KB Output is correct
65 Correct 1254 ms 8008 KB Output is correct
66 Correct 308 ms 6884 KB Output is correct
67 Correct 1173 ms 7404 KB Output is correct
68 Correct 817 ms 5752 KB Output is correct
69 Correct 4 ms 376 KB Output is correct