Submission #296872

# Submission time Handle Problem Language Result Execution time Memory
296872 2020-09-11T03:03:20 Z luciocf Cop and Robber (BOI14_coprobber) C++14
100 / 100
857 ms 7544 KB
#include <bits/stdc++.h>
#include "coprobber.h"

#define ff first
#define ss second

using namespace std;

typedef pair<int, int> pii;

const int maxn = 510;

int n;
int at;

bool liga[maxn][maxn];
int grau[maxn][maxn];

int pai[maxn][maxn];

bool win[2][maxn][maxn];

int start(int N, bool A[MAX_N][MAX_N])
{
	int n = N;

    queue<pair<pii, int>> fila;

    for (int i = 0; i < n; i++)
    	for (int j = 0; j < n; j++)
    		liga[i][j] = A[i][j];

    for (int i = 0; i < n; i++)
    	for (int j = 0; j < n; j++)
    		for (int k = 0; k < n; k++)
    			grau[i][j] += liga[j][k];

    for (int i = 0; i < n; i++)
    {
    	win[0][i][i] = win[1][i][i] = 1;

    	fila.push({{i, i}, 0});
    	fila.push({{i, i}, 1});
    }

   	while (!fila.empty())
   	{
   		int a = fila.front().ff.ff, b = fila.front().ff.ss, q = fila.front().ss;
   		fila.pop();

   		for (int i = 0; i < n; i++)
   		{
   			if (q == 0) // Cop
   			{
   				if ((liga[a][i] || a == i) && !win[1][i][b])
   				{
   					pai[i][b] = a;

   					win[1][i][b] = 1;
   					fila.push({{i, b}, 1});
   				}
   			}
   			else // Robber
   			{

   				if (liga[b][i] && !win[0][a][i] && --grau[a][i] <= 0)
   				{
   					win[0][a][i] = 1;
   					fila.push({{a, i}, 0});
   				}
   			}
   		}
   	}

   	for (int i = 0; i < n; i++)
   	{
   		bool ok = 1;

   		for (int j = 0; j < n; j++)
   			if (!win[0][i][j])
   				ok = 0;

   		if (ok) return at = i;
   	}

   	return -1;
}

int nextMove(int R)
{
	return at = pai[at][R];
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 482 ms 4600 KB Output is correct
5 Correct 66 ms 2304 KB Output is correct
6 Correct 498 ms 4728 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 446 ms 4536 KB Output is correct
4 Correct 497 ms 4496 KB Output is correct
5 Correct 423 ms 4396 KB Output is correct
6 Correct 474 ms 4480 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 3 ms 896 KB Output is correct
11 Correct 4 ms 1024 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 768 KB Output is correct
14 Correct 5 ms 896 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 2 ms 768 KB Output is correct
17 Correct 10 ms 1280 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 482 ms 4600 KB Output is correct
5 Correct 66 ms 2304 KB Output is correct
6 Correct 498 ms 4728 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 446 ms 4536 KB Output is correct
10 Correct 497 ms 4496 KB Output is correct
11 Correct 423 ms 4396 KB Output is correct
12 Correct 474 ms 4480 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 3 ms 896 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 2 ms 768 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 2 ms 768 KB Output is correct
29 Correct 10 ms 1280 KB Output is correct
30 Correct 3 ms 896 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 416 KB Output is correct
35 Correct 469 ms 4600 KB Output is correct
36 Correct 68 ms 2476 KB Output is correct
37 Correct 489 ms 4764 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 455 ms 4712 KB Output is correct
41 Correct 463 ms 4616 KB Output is correct
42 Correct 424 ms 4504 KB Output is correct
43 Correct 499 ms 4472 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 512 KB Output is correct
48 Correct 3 ms 896 KB Output is correct
49 Correct 4 ms 1024 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 2 ms 768 KB Output is correct
52 Correct 5 ms 896 KB Output is correct
53 Correct 2 ms 768 KB Output is correct
54 Correct 2 ms 768 KB Output is correct
55 Correct 10 ms 1280 KB Output is correct
56 Correct 3 ms 896 KB Output is correct
57 Correct 11 ms 1536 KB Output is correct
58 Correct 52 ms 2680 KB Output is correct
59 Correct 97 ms 3332 KB Output is correct
60 Correct 717 ms 7544 KB Output is correct
61 Correct 153 ms 3960 KB Output is correct
62 Correct 172 ms 4216 KB Output is correct
63 Correct 809 ms 6364 KB Output is correct
64 Correct 211 ms 3980 KB Output is correct
65 Correct 857 ms 7224 KB Output is correct
66 Correct 460 ms 4984 KB Output is correct
67 Correct 753 ms 6340 KB Output is correct
68 Correct 381 ms 3788 KB Output is correct
69 Correct 0 ms 384 KB Output is correct