oj.uz

답안 #127567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127567 2019-07-09T15:08:38 Z TadijaSebez 경찰관과 강도 (BOI14_coprobber) C++11
100 / 100
 884 ms 7196 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
const int N=505;
int go[N][N],C,need[N][N][2];
bool was[N*N*2];
int H(int x, int y, int t){ return (N*x+y)*2+t;}
int start(int n, bool a[MAX_N][MAX_N])
{
	queue<int> q;
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(i!=j)
	{
		int cnt=0;
		for(int k=0;k<n;k++) cnt+=a[j][k];
		need[i][j][0]=1;
		need[i][j][1]=cnt;
	}
	for(int i=0;i<n;i++)
	{
		q.push(H(i,i,0));
		q.push(H(i,i,1));
		was[H(i,i,0)]=1;
		was[H(i,i,1)]=1;
	}
	while(q.size())
	{
		int state=q.front();
		q.pop();
		int t=state%2;
		state/=2;
		int j=state%N;
		int i=state/N;
		if(t==0)
		{
			for(int k=0;k<n;k++) if(a[j][k])
			{
				need[i][k][1]--;
				if(need[i][k][1]==0)
				{
					q.push(H(i,k,1));
					was[H(i,k,1)]=1;
				}
			}
		}
		else
		{
			for(int k=0;k<n;k++) if(a[i][k] || i==k)
			{
				need[k][j][0]--;
				if(need[k][j][0]==0)
				{
					q.push(H(k,j,0));
					was[H(k,j,0)]=1;
					go[k][j]=i;
				}
			}
		}
	}
	for(int i=0;i<n;i++)
	{
		bool ok=1;
		for(int j=0;j<n;j++) if(!was[H(i,j,0)]) ok=0;
		if(ok)
		{
			C=i;
			return C;
		}
	}
	return -1;
}
int nextMove(int R)
{
	return C=go[C][R];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 352 ms 6736 KB Output is correct
5 Correct 52 ms 2936 KB Output is correct
6 Correct 408 ms 6756 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 346 ms 6668 KB Output is correct
4 Correct 355 ms 6648 KB Output is correct
5 Correct 333 ms 6400 KB Output is correct
6 Correct 367 ms 6568 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 424 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 4 ms 1144 KB Output is correct
11 Correct 6 ms 1144 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 4 ms 920 KB Output is correct
14 Correct 6 ms 1144 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 4 ms 892 KB Output is correct
17 Correct 11 ms 1400 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 2 ms 376 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 352 ms 6736 KB Output is correct
5 Correct 52 ms 2936 KB Output is correct
6 Correct 408 ms 6756 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 346 ms 6668 KB Output is correct
10 Correct 355 ms 6648 KB Output is correct
11 Correct 333 ms 6400 KB Output is correct
12 Correct 367 ms 6568 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 424 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 4 ms 1144 KB Output is correct
23 Correct 6 ms 1144 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 4 ms 920 KB Output is correct
26 Correct 6 ms 1144 KB Output is correct
27 Correct 4 ms 760 KB Output is correct
28 Correct 4 ms 892 KB Output is correct
29 Correct 11 ms 1400 KB Output is correct
30 Correct 4 ms 1016 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 352 ms 6676 KB Output is correct
36 Correct 52 ms 2936 KB Output is correct
37 Correct 390 ms 6740 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 346 ms 6648 KB Output is correct
41 Correct 355 ms 6648 KB Output is correct
42 Correct 338 ms 6364 KB Output is correct
43 Correct 368 ms 6436 KB Output is correct
44 Correct 2 ms 380 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 504 KB Output is correct
47 Correct 2 ms 504 KB Output is correct
48 Correct 4 ms 1144 KB Output is correct
49 Correct 7 ms 1144 KB Output is correct
50 Correct 2 ms 632 KB Output is correct
51 Correct 3 ms 888 KB Output is correct
52 Correct 6 ms 1144 KB Output is correct
53 Correct 4 ms 888 KB Output is correct
54 Correct 4 ms 888 KB Output is correct
55 Correct 11 ms 1400 KB Output is correct
56 Correct 4 ms 1144 KB Output is correct
57 Correct 12 ms 1916 KB Output is correct
58 Correct 61 ms 3576 KB Output is correct
59 Correct 111 ms 4472 KB Output is correct
60 Correct 520 ms 7196 KB Output is correct
61 Correct 253 ms 4360 KB Output is correct
62 Correct 269 ms 4856 KB Output is correct
63 Correct 664 ms 6808 KB Output is correct
64 Correct 192 ms 4820 KB Output is correct
65 Correct 884 ms 7112 KB Output is correct
66 Correct 365 ms 6160 KB Output is correct
67 Correct 829 ms 6776 KB Output is correct
68 Correct 344 ms 4600 KB Output is correct
69 Correct 2 ms 376 KB Output is correct