# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81236 | antimirage | Cop and Robber (BOI14_coprobber) | C++17 | 645 ms | 9692 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 "coprobber.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
using namespace std;
const int M = 505;
int n, win[2][M][M], ar[M][M], to[M][M], deg[M][M], ind1, ind2;
queue <pair <pair <int, int>, int > > q;
int start(int N, bool A[MAX_N][MAX_N])
{
n = N;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
ar[i][j] = A[i-1][j-1];
for (int k = 1; k <= n; k++)
deg[k][i] += ar[i][j];
}
}
for (int i = 1; i <= n; i++)
# | 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... |