oj.uz

Submission #938444

# Submission time Handle Problem Language Result Execution time Memory
938444 2024-03-05T06:43:26 Z Ghulam_Junaid Cop and Robber (BOI14_coprobber) C++17
0 / 100
 172 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAX_N 500

// modify the following functions
// you can define global variables and functions

int n, dist[MAX_N][MAX_N];
void dfs(int v, int s, int p = -1){
    for (int u = 0; u < n; u ++)
        if (u != p){
            dist[s][u] = dist[s][v] + 1;
            dfs(u, s, v);
        }
}

int start(int N, bool A[MAX_N][MAX_N]) {
    n = N;
    for (int i = 0; i < n; i ++)
        dfs(i, i);

    return 0;
}

int cur = 0;
int nextMove(int R) {
    if (dist[cur][R] == 1)
        return cur;
    for (int i = 0; i < n; i ++){
        if (dist[cur][i] == 1 and dist[i][R] < dist[cur][R])
            return i;
    }
    return -1;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 172 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 163 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 172 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 172 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -