oj.uz

Submission #32123

# Submission time Handle Problem Language Result Execution time Memory
32123 2017-09-27T14:36:30 Z cheater2k Cop and Robber (BOI14_coprobber) C++14
0 / 100
 3 ms 384 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;

int start(int N, bool A[MAX_N][MAX_N]) {
    return 0;
}

int cnt;
int nextMove(int R) {
    ++cnt;
    if (cnt == 1) return 0;
    else return R;
}

Subtask #1
0 / 16.0

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