oj.uz

Submission #395075

# Submission time Handle Problem Language Result Execution time Memory
395075 2021-04-27T17:17:29 Z Nicholas_Patrick Cop and Robber (BOI14_coprobber) C++17
100 / 100
 879 ms 5120 KB 
#include "coprobber.h"
// #include "grader.cpp"
#include <cstdio>
#include <queue>
#include <bitset>
#include <algorithm>
using namespace std;

int cop;
bool a[MAX_N][MAX_N];
vector<int> adjLis[MAX_N];
//sub2
int sidelength;
vector<vector<int>> solved, cnt;
vector<bitset<500>> done;
void solve(int cop, int robber, bool copturn=true){
	//calling this function: robber caught
	if(copturn){
		if(done[cop][robber])
			return;
		done[cop][robber]=true;
		for(int i: adjLis[robber]){
			cnt[cop][i]--;
			if(cnt[cop][i]==0)//no place to run
				solve(cop, i, false);
		}
	}else{
		for(int i: adjLis[cop]){
			if(solved[i][robber]==-1){
				solved[i][robber]=cop;
				solve(i, robber, true);
			}
		}
		if(solved[cop][robber]==-1){
			solved[cop][robber]=cop;
			solve(cop, robber, true);
		}
	}
}
int start(int n, bool A[MAX_N][MAX_N]){
	for(int i=n; i--;)for(int j=n; j--;)
		a[i][j]=A[i][j];
	for(int i=n; i--;)for(int j=n; j--;){
		if(a[i][j])
			adjLis[i].push_back(j);
	}
	solved.assign(n, vector<int>(n, -1));
	cnt.assign(n, vector<int>(n));
	done.resize(n);
	for(int i=n; i--;)for(int j=n; j--;)
		cnt[i][j]=adjLis[j].size();

	for(int i=n; i--;){
		solved[i][i]=i;
		solve(i, i);
	}
	for(int i=n; i--;)for(int j: adjLis[i]){
		solved[i][j]=j;
		solve(i, j);
	}
	if(*min_element(solved[0].begin(), solved[0].end())>=0)
		return cop=0;
	return -1;
}
int nextMove(int r){
	return cop=solved[cop][r];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 76 ms 4160 KB Output is correct
5 Correct 16 ms 1480 KB Output is correct
6 Correct 70 ms 3832 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 64 ms 3852 KB Output is correct
4 Correct 65 ms 4092 KB Output is correct
5 Correct 76 ms 3840 KB Output is correct
6 Correct 64 ms 3924 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 0 ms 200 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 2 ms 456 KB Output is correct
11 Correct 3 ms 456 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 2 ms 456 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 6 ms 712 KB Output is correct
18 Correct 2 ms 456 KB Output is correct
19 Correct 0 ms 200 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 76 ms 4160 KB Output is correct
5 Correct 16 ms 1480 KB Output is correct
6 Correct 70 ms 3832 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 64 ms 3852 KB Output is correct
10 Correct 65 ms 4092 KB Output is correct
11 Correct 76 ms 3840 KB Output is correct
12 Correct 64 ms 3924 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 200 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 0 ms 200 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 2 ms 456 KB Output is correct
23 Correct 3 ms 456 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 6 ms 712 KB Output is correct
30 Correct 2 ms 456 KB Output is correct
31 Correct 0 ms 200 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 0 ms 200 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 63 ms 4048 KB Output is correct
36 Correct 19 ms 1480 KB Output is correct
37 Correct 68 ms 3776 KB Output is correct
38 Correct 0 ms 200 KB Output is correct
39 Correct 0 ms 328 KB Output is correct
40 Correct 66 ms 3908 KB Output is correct
41 Correct 66 ms 4052 KB Output is correct
42 Correct 63 ms 3800 KB Output is correct
43 Correct 65 ms 3908 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 200 KB Output is correct
46 Correct 1 ms 328 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 2 ms 456 KB Output is correct
49 Correct 4 ms 456 KB Output is correct
50 Correct 1 ms 328 KB Output is correct
51 Correct 1 ms 328 KB Output is correct
52 Correct 2 ms 456 KB Output is correct
53 Correct 1 ms 456 KB Output is correct
54 Correct 1 ms 456 KB Output is correct
55 Correct 6 ms 720 KB Output is correct
56 Correct 2 ms 456 KB Output is correct
57 Correct 5 ms 840 KB Output is correct
58 Correct 19 ms 1992 KB Output is correct
59 Correct 33 ms 2704 KB Output is correct
60 Correct 879 ms 4800 KB Output is correct
61 Correct 98 ms 2760 KB Output is correct
62 Correct 84 ms 3392 KB Output is correct
63 Correct 594 ms 4820 KB Output is correct
64 Correct 51 ms 2888 KB Output is correct
65 Correct 657 ms 5120 KB Output is correct
66 Correct 73 ms 3640 KB Output is correct
67 Correct 301 ms 4284 KB Output is correct
68 Correct 97 ms 3008 KB Output is correct
69 Correct 0 ms 200 KB Output is correct