# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105933 | luciocf | Cop and Robber (BOI14_coprobber) | C++14 | 50 ms | 2808 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;
const int maxn = 510;
int n, U=0;
int dist[maxn][maxn];
vector<int> grafo[maxn];
void bfs(int s)
{
queue<int> fila;
dist[s][s] = 0; fila.push(s);
while (!fila.empty())
{
int u = fila.front();
fila.pop();
for (auto v: grafo[u])
{
if (dist[s][v] != -1) continue;
dist[s][v] = dist[s][u]+1;
fila.push(v);
}
}
}
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++)
if (A[i][j])
grafo[i].push_back(j);
memset(dist, -1, sizeof dist);
for (int i = 0; i < n; i++)
bfs(i);
return 0;
}
int nextMove(int R)
{
for (auto v: grafo[U])
{
if (dist[v][R] == dist[U][R]-1)
{
U = v;
return v;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |