oj.uz

Submission #395061

# Submission time Handle Problem Language Result Execution time Memory
395061 2021-04-27T16:58:55 Z Nicholas_Patrick Cop and Robber (BOI14_coprobber) C++17
60 / 100
 203 ms 262148 KB 
#include "coprobber.h"
// #include "grader.cpp"
#include <cstdio>
#include <queue>
#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;
vector<vector<vector<int>>> run;
void solve(int cop, int robber, bool copturn=true){
	//calling this function: robber caught
	if(copturn){
		for(int i: adjLis[robber]){
			auto it=find(run[cop][i].begin(), run[cop][i].end(), robber);
			if(it!=run[cop][i].end())
				run[cop][i].erase(it);
			if(run[cop][i].empty())//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));
	run.assign(n, vector<vector<int>>(n, vector<int>()));
	for(int i=n; i--;)for(int j=n; j--;)
		run[i][j]=adjLis[j];

	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 93 ms 16756 KB Output is correct
5 Correct 25 ms 4288 KB Output is correct
6 Correct 119 ms 16576 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 114 ms 16304 KB Output is correct
4 Correct 98 ms 16780 KB Output is correct
5 Correct 120 ms 15724 KB Output is correct
6 Correct 102 ms 16576 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 0 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 1 ms 200 KB Output is correct
7 Correct 1 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 3 ms 968 KB Output is correct
11 Correct 17 ms 2632 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 2 ms 712 KB Output is correct
14 Correct 7 ms 1480 KB Output is correct
15 Correct 2 ms 584 KB Output is correct
16 Correct 3 ms 712 KB Output is correct
17 Correct 28 ms 2928 KB Output is correct
18 Correct 3 ms 968 KB Output is correct
19 Correct 1 ms 200 KB Output is correct

Subtask #4
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 93 ms 16756 KB Output is correct
5 Correct 25 ms 4288 KB Output is correct
6 Correct 119 ms 16576 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 114 ms 16304 KB Output is correct
10 Correct 98 ms 16780 KB Output is correct
11 Correct 120 ms 15724 KB Output is correct
12 Correct 102 ms 16576 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 0 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 1 ms 200 KB Output is correct
19 Correct 1 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 3 ms 968 KB Output is correct
23 Correct 17 ms 2632 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 2 ms 712 KB Output is correct
26 Correct 7 ms 1480 KB Output is correct
27 Correct 2 ms 584 KB Output is correct
28 Correct 3 ms 712 KB Output is correct
29 Correct 28 ms 2928 KB Output is correct
30 Correct 3 ms 968 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 0 ms 200 KB Output is correct
34 Correct 0 ms 328 KB Output is correct
35 Correct 89 ms 16832 KB Output is correct
36 Correct 26 ms 4360 KB Output is correct
37 Correct 138 ms 16652 KB Output is correct
38 Correct 1 ms 200 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 106 ms 16272 KB Output is correct
41 Correct 95 ms 16760 KB Output is correct
42 Correct 102 ms 15680 KB Output is correct
43 Correct 106 ms 16624 KB Output is correct
44 Correct 1 ms 200 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 4 ms 968 KB Output is correct
49 Correct 17 ms 2752 KB Output is correct
50 Correct 1 ms 328 KB Output is correct
51 Correct 2 ms 712 KB Output is correct
52 Correct 7 ms 1484 KB Output is correct
53 Correct 2 ms 584 KB Output is correct
54 Correct 3 ms 712 KB Output is correct
55 Correct 27 ms 2888 KB Output is correct
56 Correct 3 ms 968 KB Output is correct
57 Correct 10 ms 3272 KB Output is correct
58 Correct 35 ms 10512 KB Output is correct
59 Correct 62 ms 20864 KB Output is correct
60 Runtime error 203 ms 262148 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -