oj.uz

Submission #677286

# Submission time Handle Problem Language Result Execution time Memory
677286 2023-01-02T17:53:37 Z Truitadepatates Cop and Robber (BOI14_coprobber) C++14
0 / 100
 1137 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

//subtask 1

vector<vector<int>> adj(507, vector<int>(507));
vector<int> p(507);
int cop = 0;

void dfs(int actual, int anterior){
  p[actual] = anterior;
  for (auto it: adj[actual]){
    if (it != anterior){
      dfs(it, actual);
    }
  }
}

int start(int n, bool a[500][500]){
  for (int i = 0; i < n; i++){
    for (int j = 0; j < n; j++){
      if (a[i][j] == 1){
        adj[i].push_back(j);
        adj[j].push_back(i);
      }
    }
  }
  dfs(0, -1);
  return 0;
}

int nextMove(int r){
  if (r == cop) return r;
  else{
    while (cop != p[r]){
      r = p[r];
    }
  }
  cop = r;
  return r;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1232 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Runtime error 1108 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 1137 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 Correct 1 ms 1232 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Runtime error 1121 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1232 KB Output is correct
2 Correct 2 ms 1232 KB Output is correct
3 Runtime error 1108 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -