oj.uz

답안 #340253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340253 2020-12-27T10:52:50 Z ogibogi2004 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 1067 ms 12652 KB 
#include "coprobber.h"
#include<bits/stdc++.h>
using namespace std;
/*
0-cop
1-robber
*/
int wl[MAX_N][MAX_N][2],cpos;
pair<pair<int,int>,int> nextMove1[MAX_N][MAX_N][2];
//vector<pair<pair<int,int>,bool> > g[MAX_N][MAX_N][2];
//vector<pair<pair<int,int>,bool> > g1[MAX_N][MAX_N][2];
int start(int n, bool a[MAX_N][MAX_N])
{
	for(int c=0;c<n;c++)
	{
		for(int r=0;r<n;r++)
		{
			for(int turn=0;turn<=1;turn++)
			{
				if(turn==0)
				{
					wl[c][r][turn]=1;
					for(int i=0;i<n;i++)
					{
						if(i==c||a[i][c])
						{
						//	g[c][r][(bool)turn].push_back({{i,r},(bool)1-turn});
							//g1[i][r][(bool)1-turn].push_back({{c,r},(bool)turn});
						}
					}
				}
				else
				{
					for(int i=0;i<n;i++)
					{
						if(a[i][r])
						{
							//g[c][r][turn].push_back({{c,i},1-turn});
							//g1[c][i][1-turn].push_back({{c,r},turn});
							++wl[c][r][turn];
						}
					}
				}
				if(c==r)wl[c][r][turn]=0;
			}
		}
	}
	queue<pair<pair<int,int>,int> >q;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			for(int turn=0;turn<2;turn++)
			{
				if(wl[i][j][turn]==0)q.push({{i,j},turn});
			}
		}
	}
	pair<pair<int,int>,int>v;
	while(!q.empty())
	{
		pair<pair<int,int>,int> u=q.front();q.pop();
		if(u.second==1)
		{
			for(int i=0;i<n;i++)
			{
				if(i==u.first.first||a[u.first.first][i])
				{
					v={{i,u.first.second},1-u.second};
					--wl[v.first.first][v.first.second][v.second];
					if(wl[v.first.first][v.first.second][v.second]==0)
					{
						nextMove1[v.first.first][v.first.second][v.second]=u;
						q.push(v);
					}
				}
			}
		}
		else
		{
			for(int i=0;i<n;i++)
			{
				if(a[u.first.second][i])
				{
					v={{u.first.first,i},1-u.second};
					--wl[v.first.first][v.first.second][v.second];
					if(wl[v.first.first][v.first.second][v.second]==0)
					{
						nextMove1[v.first.first][v.first.second][v.second]=u;
						q.push(v);
					}
				}
			}
		}
		/*for(auto v:g1[u.first.first][u.first.second][u.second])
		{
			--wl[v.first.first][v.first.second][v.second];
			if(wl[v.first.first][v.first.second][v.second]==0)
			{
				nextMove1[v.first.first][v.first.second][v.second]=u;
				q.push(v);
			}
		}*/
	}
	for(int i=0;i<n;i++)
	{
		bool ok=1;
		for(int j=0;j<n;j++)
		{
			if(wl[i][j][1]>0)ok=0;
		}
		if(ok)
		{
			cpos=i;
			return i;
		}
	}
	return -1;
}
int nextMove(int R)
{
	pair<pair<int,int>,int> gg=nextMove1[cpos][R][0];
	cpos=gg.first.first;
    return cpos;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 457 ms 9708 KB Output is correct
5 Correct 61 ms 4224 KB Output is correct
6 Correct 501 ms 9860 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 456 ms 9580 KB Output is correct
4 Correct 463 ms 9580 KB Output is correct
5 Correct 434 ms 9452 KB Output is correct
6 Correct 466 ms 9580 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 4 ms 1388 KB Output is correct
11 Correct 7 ms 1388 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 3 ms 1004 KB Output is correct
14 Correct 6 ms 1388 KB Output is correct
15 Correct 2 ms 876 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 11 ms 1772 KB Output is correct
18 Correct 4 ms 1132 KB Output is correct
19 Correct 0 ms 364 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 457 ms 9708 KB Output is correct
5 Correct 61 ms 4224 KB Output is correct
6 Correct 501 ms 9860 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 456 ms 9580 KB Output is correct
10 Correct 463 ms 9580 KB Output is correct
11 Correct 434 ms 9452 KB Output is correct
12 Correct 466 ms 9580 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 4 ms 1388 KB Output is correct
23 Correct 7 ms 1388 KB Output is correct
24 Correct 1 ms 620 KB Output is correct
25 Correct 3 ms 1004 KB Output is correct
26 Correct 6 ms 1388 KB Output is correct
27 Correct 2 ms 876 KB Output is correct
28 Correct 3 ms 876 KB Output is correct
29 Correct 11 ms 1772 KB Output is correct
30 Correct 4 ms 1132 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 455 ms 9572 KB Output is correct
36 Correct 61 ms 4204 KB Output is correct
37 Correct 495 ms 9836 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 466 ms 9580 KB Output is correct
41 Correct 459 ms 9580 KB Output is correct
42 Correct 454 ms 9452 KB Output is correct
43 Correct 484 ms 9452 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 492 KB Output is correct
47 Correct 1 ms 492 KB Output is correct
48 Correct 4 ms 1388 KB Output is correct
49 Correct 7 ms 1388 KB Output is correct
50 Correct 1 ms 620 KB Output is correct
51 Correct 2 ms 1004 KB Output is correct
52 Correct 6 ms 1388 KB Output is correct
53 Correct 2 ms 876 KB Output is correct
54 Correct 2 ms 876 KB Output is correct
55 Correct 11 ms 1772 KB Output is correct
56 Correct 3 ms 1132 KB Output is correct
57 Correct 17 ms 2796 KB Output is correct
58 Correct 113 ms 5996 KB Output is correct
59 Correct 231 ms 8300 KB Output is correct
60 Correct 1002 ms 12652 KB Output is correct
61 Correct 544 ms 8732 KB Output is correct
62 Correct 578 ms 9452 KB Output is correct
63 Correct 793 ms 11500 KB Output is correct
64 Correct 361 ms 8940 KB Output is correct
65 Correct 1067 ms 12176 KB Output is correct
66 Correct 476 ms 9836 KB Output is correct
67 Correct 1014 ms 11396 KB Output is correct
68 Correct 533 ms 9024 KB Output is correct
69 Correct 1 ms 364 KB Output is correct