oj.uz

Submission #320904

# Submission time Handle Problem Language Result Execution time Memory
320904 2020-11-10T08:03:40 Z shrek12357 Cop and Robber (BOI14_coprobber) C++14
16 / 100
 169 ms 262148 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
#include "coprobber.h"
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0); 

const int MAXN = 505;

bool found[MAXN][MAXN];
vector<int> adjList[MAXN];
int cur = 0, par = 0;

void dfs(int src, int par) {
	found[src][src] = true;
	for (auto i : adjList[src]) {
		if (i == par) {
			continue;
		}
		dfs(i, src);
		for (int j = 0; j < MAXN; j++) {
			found[src][j] |= found[i][j];
		}
	}
}

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]) {
				adjList[i].push_back(j);
			}
		}
	}
	dfs(0, 0);
	return cur;
}

int nextMove(int R) {
	if (cur == R) {
		return R;
	}
	for (auto i : adjList[cur]) {
		if (i == par) {
			continue;
		}
		if (found[i][R]) {
			par = cur;
			cur = i;
			return cur;
		}
	}
}

Compilation message

coprobber.cpp: In function 'int nextMove(int)':
coprobber.cpp:63:1: warning: control reaches end of non-void function [-Wreturn-type]
   63 | }
      | ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 51 ms 2148 KB Output is correct
5 Correct 16 ms 1132 KB Output is correct
6 Correct 51 ms 1892 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 169 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Runtime error 161 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 51 ms 2148 KB Output is correct
5 Correct 16 ms 1132 KB Output is correct
6 Correct 51 ms 1892 KB Output is correct
7 Runtime error 169 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -