oj.uz

Submission #398955

# Submission time Handle Problem Language Result Execution time Memory
398955 2021-05-04T22:54:06 Z shrimb Cop and Robber (BOI14_coprobber) C++17
16 / 100
 55 ms 1692 KB 
#include "coprobber.h"
#include "bits/stdc++.h"
using namespace std;

vector<int> adj[501];
int cur = 0, nig;

int start(int N, bool A[MAX_N][MAX_N]) {
	for (int i = 0 ; i < N ; i++) {
		for (int j = 0 ; j < N ; j++) {
			if (A[i][j]) adj[i].push_back(j);
		}
	}
	return 0;
}

bool check (int c, int p) {
	bool res = 0;
	for (int i : adj[c]) {
		if (i == p) continue;
		if (i == nig) return 1;
		res |= check(i, c);
	}
	return res;
}

int nextMove(int R) {
	nig = R;
	for (int i : adj[cur]) {
		if (i == R || check(i, cur)) return cur = i;
	}
	return -1;
}

Subtask #1
16.0 / 16.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 55 ms 1692 KB Output is correct
5 Correct 14 ms 880 KB Output is correct
6 Correct 53 ms 1484 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB the situation repeated
2 Halted 0 ms 0 KB -

Subtask #3
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 Incorrect 1 ms 328 KB the situation repeated
5 Halted 0 ms 0 KB -

Subtask #4
0 / 40.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 55 ms 1692 KB Output is correct
5 Correct 14 ms 880 KB Output is correct
6 Correct 53 ms 1484 KB Output is correct
7 Incorrect 1 ms 200 KB the situation repeated
8 Halted 0 ms 0 KB -