oj.uz

답안 #202876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202876 2020-02-18T14:05:49 Z faremy 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 670 ms 5112 KB 
#include "coprobber.h"
#include <vector>


struct State
{
	State(int c, int r, int p) : posCop(c), posRob(r), player(p) {}
	int posCop, posRob, player;
};

const int MAXN = 500;

int nodeDeg[MAXN];
int degree[MAXN][MAXN][2];
std::vector<State> rm;

bool copWin[MAXN][MAXN][2];
int go[MAXN][MAXN];
int posCop = -1;


void process(int cop, int robber, int player, int from)
{
	if (!copWin[cop][robber][player])
	{
		if (player == 0)
			go[cop][robber] = from;
		copWin[cop][robber][player] = true;
		rm.emplace_back(cop, robber, player);
	}
}

int start(int N, bool A[MAX_N][MAX_N])
{
	for (int iNode = 0; iNode < N; iNode++)
		for (int jNode = 0; jNode < N; jNode++)
			nodeDeg[iNode] += A[iNode][jNode];

	for (int iCop = 0; iCop < N; iCop++)
		for (int iRobber = 0; iRobber < N; iRobber++)
		{
			go[iCop][iRobber] = -1;
			degree[iCop][iRobber][0] = nodeDeg[iCop] + 1;
			degree[iCop][iRobber][1] = nodeDeg[iRobber];
		}

	for (int iNode = 0; iNode < N; iNode++)
		process(iNode, iNode, 1, -1);
	while (!rm.empty())
	{
		int cop = rm.back().posCop;
		int robber = rm.back().posRob;
		int player = rm.back().player;
		rm.pop_back();

		if (player == 1)
			process(cop, robber, 0, cop);

		for (int iEsc = 0; iEsc < N; iEsc++)
		{
			if (player == 1 && A[cop][iEsc])
				process(iEsc, robber, 0, cop);
			if (player == 0 && A[robber][iEsc])
			{
				degree[cop][iEsc][1]--;
				if (degree[cop][iEsc][1] == 0)
					process(cop, iEsc, 1, -1);
			}
		}
	}

	for (int iCop = 0; iCop < N; iCop++)
	{
		bool isWinner = true;
		for (int iRobber = 0; iRobber < N; iRobber++)
			isWinner &= copWin[iCop][iRobber][0];
		if (isWinner)
		{
			posCop = iCop;
			return iCop;
		}
	}

	return -1;
}

int nextMove(int R)
{
	int next = go[posCop][R];
	posCop = next;
    return next;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 321 ms 5112 KB Output is correct
5 Correct 56 ms 2552 KB Output is correct
6 Correct 362 ms 4988 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 444 KB Output is correct
3 Correct 333 ms 4920 KB Output is correct
4 Correct 347 ms 5112 KB Output is correct
5 Correct 339 ms 4856 KB Output is correct
6 Correct 350 ms 5036 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 4 ms 252 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 1016 KB Output is correct
11 Correct 7 ms 1072 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 6 ms 760 KB Output is correct
14 Correct 8 ms 1016 KB Output is correct
15 Correct 6 ms 760 KB Output is correct
16 Correct 6 ms 760 KB Output is correct
17 Correct 12 ms 1272 KB Output is correct
18 Correct 6 ms 1016 KB Output is correct
19 Correct 5 ms 312 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 321 ms 5112 KB Output is correct
5 Correct 56 ms 2552 KB Output is correct
6 Correct 362 ms 4988 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 444 KB Output is correct
9 Correct 333 ms 4920 KB Output is correct
10 Correct 347 ms 5112 KB Output is correct
11 Correct 339 ms 4856 KB Output is correct
12 Correct 350 ms 5036 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 4 ms 252 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 248 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 4 ms 248 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 4 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 6 ms 1016 KB Output is correct
23 Correct 7 ms 1072 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 6 ms 760 KB Output is correct
26 Correct 8 ms 1016 KB Output is correct
27 Correct 6 ms 760 KB Output is correct
28 Correct 6 ms 760 KB Output is correct
29 Correct 12 ms 1272 KB Output is correct
30 Correct 6 ms 1016 KB Output is correct
31 Correct 5 ms 312 KB Output is correct
32 Correct 4 ms 248 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 332 ms 5088 KB Output is correct
36 Correct 58 ms 2552 KB Output is correct
37 Correct 348 ms 4960 KB Output is correct
38 Correct 5 ms 248 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 333 ms 5004 KB Output is correct
41 Correct 332 ms 5112 KB Output is correct
42 Correct 323 ms 4984 KB Output is correct
43 Correct 337 ms 5112 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 4 ms 372 KB Output is correct
46 Correct 5 ms 504 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 6 ms 1016 KB Output is correct
49 Correct 7 ms 1016 KB Output is correct
50 Correct 5 ms 504 KB Output is correct
51 Correct 6 ms 760 KB Output is correct
52 Correct 8 ms 1016 KB Output is correct
53 Correct 6 ms 760 KB Output is correct
54 Correct 7 ms 760 KB Output is correct
55 Correct 12 ms 1272 KB Output is correct
56 Correct 6 ms 1016 KB Output is correct
57 Correct 10 ms 1784 KB Output is correct
58 Correct 22 ms 3192 KB Output is correct
59 Correct 40 ms 3960 KB Output is correct
60 Correct 412 ms 4984 KB Output is correct
61 Correct 114 ms 3704 KB Output is correct
62 Correct 129 ms 3960 KB Output is correct
63 Correct 570 ms 5104 KB Output is correct
64 Correct 122 ms 3960 KB Output is correct
65 Correct 629 ms 5060 KB Output is correct
66 Correct 337 ms 4856 KB Output is correct
67 Correct 670 ms 5112 KB Output is correct
68 Correct 316 ms 4088 KB Output is correct
69 Correct 5 ms 504 KB Output is correct