oj.uz

Submission #395059

# Submission time Handle Problem Language Result Execution time Memory
395059 2021-04-27T16:52:57 Z Nicholas_Patrick Cop and Robber (BOI14_coprobber) C++17
30 / 100
 77 ms 4032 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, run;
void solve(int cop, int robber, bool copturn=true){
	//calling this function: robber caught
	if(copturn){
		for(int i: adjLis[robber]){
			run[cop][i]--;
			if(run[cop][i]==0)//no place to run
				solve(cop, i, false);
		}
	}else{
		if(cop==robber)
			return;
		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<int>(n, 0));
	for(int i=n; i--;)for(int j=n; j--;)
		run[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 0 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 71 ms 4020 KB Output is correct
5 Correct 18 ms 1436 KB Output is correct
6 Correct 67 ms 3808 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 65 ms 3840 KB Output is correct
4 Correct 63 ms 4032 KB Output is correct
5 Correct 64 ms 3724 KB Output is correct
6 Correct 77 ms 3904 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 200 KB Output is correct
8 Incorrect 1 ms 328 KB the situation repeated
9 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 71 ms 4020 KB Output is correct
5 Correct 18 ms 1436 KB Output is correct
6 Correct 67 ms 3808 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 65 ms 3840 KB Output is correct
10 Correct 63 ms 4032 KB Output is correct
11 Correct 64 ms 3724 KB Output is correct
12 Correct 77 ms 3904 KB Output is correct
13 Correct 0 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 1 ms 200 KB Output is correct
20 Incorrect 1 ms 328 KB the situation repeated
21 Halted 0 ms 0 KB -