oj.uz

답안 #115806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115806 2019-06-09T07:59:04 Z Mahdi_Jfri 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 417 ms 8312 KB 
#include "coprobber.h"
#include<bits/stdc++.h>

#define ll long long
#define pb push_back

using namespace std;

const int maxn = 5e2 + 20;

int vertex;

int par[maxn][maxn] , d[maxn][maxn];

bool visited[maxn][maxn][2];

vector<int> adj[maxn];

int start(int n, bool A[MAX_N][MAX_N])
{
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			if(A[i][j])
				adj[i].pb(j);

	queue<pair<pair<int , int> , bool> > q;

	for(int i = 0; i < n; i++)
		q.push({{i , i} , 0}) , q.push({{i , i} , 1}) , visited[i][i][0] = visited[i][i][1] = 1;

	while(!q.empty())
	{
		int v = q.front().first.first , u = q.front().first.second;
		bool x = q.front().second;
		q.pop();

		if(x)
		{
			for(auto w : adj[v])
				if(!visited[w][u][0])
				{
					par[w][u] = v;
					q.push({{w , u} , 0});
					visited[w][u][0] = 1;
				}

			if(!visited[v][u][0])
			{
				par[v][u] = v;
				q.push({{v , u} , 0});
				visited[v][u][0] = 1;
			}
		}
		else
		{
			for(auto w : adj[u])
			{
				d[v][w]++;
				if(d[v][w] == (int)adj[w].size())
				{
					visited[v][w][1] = 1;
					q.push({{v , w} , 1});
				}
			}
		}
	}

	for(int i = 0; i < n; i++)
	{
		int t = 0;
		for(int j = 0; j < n; j++)
			t += visited[i][j][0];
		if(t == n)
		{
			vertex = i;
			return i;
		}
	}

    return -1;
}

int nextMove(int R)
{
	vertex = par[vertex][R];
    return vertex;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 53 ms 4316 KB Output is correct
5 Correct 15 ms 2304 KB Output is correct
6 Correct 63 ms 4472 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 53 ms 4384 KB Output is correct
4 Correct 51 ms 4344 KB Output is correct
5 Correct 51 ms 4304 KB Output is correct
6 Correct 51 ms 4476 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 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 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 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 2 ms 512 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 4 ms 1024 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 6 ms 1280 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 2 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 51 ms 4344 KB Output is correct
5 Correct 16 ms 2300 KB Output is correct
6 Correct 59 ms 4600 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 53 ms 4380 KB Output is correct
10 Correct 51 ms 4344 KB Output is correct
11 Correct 59 ms 4252 KB Output is correct
12 Correct 51 ms 4216 KB Output is correct
13 Correct 2 ms 356 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 896 KB Output is correct
18 Correct 4 ms 1024 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 3 ms 996 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 6 ms 1280 KB Output is correct
25 Correct 3 ms 896 KB Output is correct
26 Correct 6 ms 1536 KB Output is correct
27 Correct 15 ms 2688 KB Output is correct
28 Correct 23 ms 3192 KB Output is correct
29 Correct 417 ms 8312 KB Output is correct
30 Correct 48 ms 4216 KB Output is correct
31 Correct 46 ms 4480 KB Output is correct
32 Correct 290 ms 6908 KB Output is correct
33 Correct 38 ms 3840 KB Output is correct
34 Correct 330 ms 7968 KB Output is correct
35 Correct 66 ms 4856 KB Output is correct
36 Correct 220 ms 6304 KB Output is correct
37 Correct 62 ms 3708 KB Output is correct
38 Correct 2 ms 384 KB Output is correct