oj.uz

Submission #398877

# Submission time Handle Problem Language Result Execution time Memory
398877 2021-05-04T21:37:08 Z almothana05 Cop and Robber (BOI14_coprobber) C++14
0 / 100
 2 ms 1352 KB 
#include "coprobber.h"
#include<iostream>
#include<vector>
using namespace std;
int menge = 0 , jet = 0;
vector<vector<bool> >num;
vector<vector<int> >vis(500+10 , vector<int>(500 + 10  , 0));
int start(int N, bool A[MAX_N][MAX_N])
{
	for(int i =  0 ;i < N ; i++){
		num.push_back(vector<bool>());
		for(int  j = 0 ; j < N  ; j++){
			num[i].push_back(A[i][j]);
		}
	}
	menge = N;
    return 0;
}

int nextMove(int R)
{
	if(R == jet){
		return jet;
	}
	if(num[jet][R] == 1){
	    return R;
	    
	}
	else{
		for(int i = 0 ; i < menge ; i++){
			if(vis[jet][i] == 0 && num[jet][i] == 1){
				vis[jet][i] = 1;
				return i;
			}
		}
	}
	return jet;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1224 KB Output is correct
2 Correct 2 ms 1224 KB Output is correct
3 Incorrect 1 ms 1352 KB the situation repeated
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1352 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1228 KB Output is correct
2 Correct 1 ms 1352 KB Output is correct
3 Incorrect 1 ms 1352 KB the situation repeated
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1224 KB Output is correct
2 Correct 2 ms 1224 KB Output is correct
3 Incorrect 1 ms 1352 KB the situation repeated
4 Halted 0 ms 0 KB -