oj.uz

Submission #613308

# Submission time Handle Problem Language Result Execution time Memory
613308 2022-07-30T04:28:11 Z amunduzbaev Cop and Robber (BOI14_coprobber) C++17
0 / 100
 3 ms 2512 KB 
#include "coprobber.h"
#include "bits/stdc++.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif

const int M = 505;
vector<int> edges[M];
int par[M][M], v;
int used[M][M], a[M][M];

int start(int n, bool A[MAX_N][MAX_N]){
	memset(par, -1, sizeof par);
	
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			a[i][j] = A[i][j];
			if(a[i][j]) edges[i].push_back(j);
		}
	}
	
	for(int i=0;i<n;i++){
		queue<int> q; q.push(i);
		par[i][i] = i;
		while(!q.empty()){
			int u = q.front(); q.pop();
			for(auto x : edges[u]){
				if(par[i][x] == -1){
					par[i][x] = u, q.push(x);
				}
			}
		}
	}
	v = 1;
	return 1;
}

int nextMove(int R){
	assert(v != R);
	assert(a[v][R]);
	return R;
	//~ if(used[v][R]){
		//~ assert(false);
	//~ } else {
		//~ used[v][R] = 1;
	//~ }
	//~ return par[R][v];
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Runtime error 3 ms 2512 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2512 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Runtime error 2 ms 2512 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Runtime error 3 ms 2512 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -