oj.uz

Submission #567671

# Submission time Handle Problem Language Result Execution time Memory
567671 2022-05-24T02:27:02 Z zaneyu Cop and Robber (BOI14_coprobber) C++14
0 / 100
 1 ms 208 KB 
#include "coprobber.h"
#define REP(i,n) for(int i=0;i<n;i++)
int start(int n, bool A[MAX_N][MAX_N])
{
    return 0;
    int c;
    REP(i,n) if(A[0][i]) c=i;
    int r=n/c;
    if(r==2 or c==2){
        return 0;
    } 
    return -1;
}

int nextMove(int R){
    if(R==3) return 0; 
    return R;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 0 ms 208 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
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 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 #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 1 ms 208 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
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 0 ms 208 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
4 Halted 0 ms 0 KB -