oj.uz

답안 #614950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
614950 2022-07-31T05:41:18 Z amunduzbaev 경찰관과 강도 (BOI14_coprobber) C++17
0 / 100
 1 ms 1232 KB 
#include "coprobber.h"
#include "bits/stdc++.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
 
const int M = 505;
int par[M][M], v;
 
int start(int n, bool a[MAX_N][MAX_N]){
	memset(par, -1, sizeof par);
	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(int j=0;j<n;j++){
				if(par[i][j] == -1){
					par[i][j] = u, q.push(j);
				}
			}
		}
	}
	v = 1;
	return 1;
}
 
int nextMove(int R){
	v = par[R][v];
	return v;
}

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Incorrect 1 ms 1232 KB nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1232 KB nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Incorrect 1 ms 1232 KB nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Incorrect 1 ms 1232 KB nextMove() returned a value that is either outside 0..N-1 or the new cop position is not a neighbour to the previous one
3 Halted 0 ms 0 KB -