oj.uz

Submission #81236

# Submission time Handle Problem Language Result Execution time Memory
81236 2018-10-24T07:56:58 Z antimirage Cop and Robber (BOI14_coprobber) C++17
100 / 100
 645 ms 9692 KB 
#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++)
	{
		win[0][i][i] = 1;
		win[1][i][i] = 1;
		q.push( mk( mk(i, i), 0 ) );
		q.push( mk( mk(i, i), 1 ) );
	}
	while (!q.empty())
	{
		int x = q.front().fr.fr, y = q.front().fr.sc, type = q.front().sc;
		q.pop();
		
		for (int i = 1; i <= n; i++)
		{
			if ( type == 1 && ar[x][i] == 0 && i != x ) continue;
			if ( type == 0 && ar[y][i] == 0 ) continue;
			
			if ( type == 1 && !win[0][i][y] )
			{
				to[i][y] = x;
				win[0][i][y] = 1;
				q.push( mk( mk(i, y), 0 ) );
			}
			if (type == 0 && !win[1][x][i] && --deg[x][i] == 0 )
			{
				win[1][x][i] = 1;
				q.push( mk( mk(x, i), 1 ) );
			}
		}
	}
	bool fl = 1;
	for (int j = 1; j <= n; j++)
	{
		if (win[0][1][j] == 0) fl = 0;
	}
	if (fl)
		ind1 = 1;
	ind1--;
	return ind1;
}

int nextMove(int R)
{
	ind2 = R;
    return ind1 = to[ind1 + 1][ind2 + 1] - 1;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 397 ms 6776 KB Output is correct
5 Correct 57 ms 3448 KB Output is correct
6 Correct 468 ms 7032 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 402 ms 6748 KB Output is correct
4 Correct 401 ms 6740 KB Output is correct
5 Correct 386 ms 6592 KB Output is correct
6 Correct 418 ms 6652 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 4 ms 1536 KB Output is correct
11 Correct 6 ms 1408 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 3 ms 1152 KB Output is correct
14 Correct 6 ms 1408 KB Output is correct
15 Correct 4 ms 1024 KB Output is correct
16 Correct 4 ms 1024 KB Output is correct
17 Correct 10 ms 1664 KB Output is correct
18 Correct 4 ms 1408 KB Output is correct
19 Correct 2 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 421 ms 6844 KB Output is correct
5 Correct 60 ms 3448 KB Output is correct
6 Correct 503 ms 7088 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 411 ms 6692 KB Output is correct
10 Correct 417 ms 6896 KB Output is correct
11 Correct 394 ms 6568 KB Output is correct
12 Correct 437 ms 6648 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 4 ms 1408 KB Output is correct
18 Correct 5 ms 1536 KB Output is correct
19 Correct 3 ms 616 KB Output is correct
20 Correct 3 ms 1152 KB Output is correct
21 Correct 6 ms 1408 KB Output is correct
22 Correct 4 ms 1024 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 10 ms 1664 KB Output is correct
25 Correct 4 ms 1408 KB Output is correct
26 Correct 12 ms 2432 KB Output is correct
27 Correct 64 ms 4628 KB Output is correct
28 Correct 118 ms 5624 KB Output is correct
29 Correct 627 ms 9692 KB Output is correct
30 Correct 153 ms 6008 KB Output is correct
31 Correct 173 ms 6520 KB Output is correct
32 Correct 599 ms 8544 KB Output is correct
33 Correct 194 ms 6136 KB Output is correct
34 Correct 645 ms 9500 KB Output is correct
35 Correct 434 ms 7196 KB Output is correct
36 Correct 628 ms 8524 KB Output is correct
37 Correct 498 ms 6092 KB Output is correct
38 Correct 2 ms 384 KB Output is correct