Submission #677286

#	Time	Username	Problem	Language	Result	Execution time	Memory
677286		Truitadepatates	Cop and Robber (BOI14_coprobber)	C++14	0 / 100	1137 ms	262144 KiB

coprobber

#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
• Subtask 2: 0 / 14
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40