Submission #1307138

#TimeUsernameProblemLanguageResultExecution timeMemory
1307138lucaskojimaCop and Robber (BOI14_coprobber)C++17
0 / 100
1 ms340 KiB
#include "bits/stdc++.h"
#include "coprobber.h"
#define sz(x) (int)size(x)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int N   = 500;

bool a[N][N];
int n, p = 0;

int start(int n_, bool a_[MAX_N][MAX_N]) {
  n = n_;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      a[i][j] = a_[i][j];

  if (n == 4) return 0;
  return -1;
}

int nextMove(int r) {
  if (a[p][r]) return r;
  return p;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...