oj.uz

Submission #235680

# Submission time Handle Problem Language Result Execution time Memory
235680 2020-05-29T10:42:35 Z alishahali1382 Cop and Robber (BOI14_coprobber) C++14
100 / 100
 512 ms 7624 KB 
#include <bits/stdc++.h>
#include "coprobber.h"
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

int n, m, k, u, v, x, y, t, a, b, pos;
int dp[2][MAX_N][MAX_N]; // dp0:cop  dp1:robber
int cnt[MAX_N][MAX_N], deg[MAX_N];
queue<piii> Q;

int start(int n, bool A[MAX_N][MAX_N]){
	for (int i=0; i<n; i++) for (int j=0; j<n; j++) deg[i]+=A[i][j];
	for (int i=0; i<n; i++) for (int j=0; j<n; j++) cnt[i][j]=deg[j];
	memset(dp, -1, sizeof(dp));
	for (int i=0; i<n; i++){
		Q.push({{i, i}, 0});
		Q.push({{i, i}, 1});
		dp[0][i][i]=i;
		dp[1][i][i]=i;
	}
	while (Q.size()){
		int u=Q.front().first.first, v=Q.front().first.second, turn=Q.front().second;
		Q.pop();
		if (turn){
			for (int i=0; i<n; i++) if ((A[i][u] || i==u) && dp[0][i][v]==-1){
				dp[0][i][v]=u;
				Q.push({{i, v}, 0});
			}
		}
		else{
			for (int i=0; i<n; i++) if (A[i][v] && dp[1][u][i]==-1 && !--cnt[u][i]){
				dp[1][u][i]=v;
				Q.push({{u, i}, 1});
			}
		}
	}
	for (int i=0; i<n; i++){
		bool ok=1;
		for (int j=0; j<n && ok; j++) if (dp[0][i][j]==-1) ok=0;
		if (!ok) continue ;
		return pos=i;
	}
	return -1;
}

int nextMove(int R){
	pos=dp[0][pos][R];
    return pos;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 5 ms 2304 KB Output is correct
4 Correct 289 ms 4600 KB Output is correct
5 Correct 45 ms 3448 KB Output is correct
6 Correct 297 ms 4960 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 270 ms 4764 KB Output is correct
4 Correct 274 ms 4728 KB Output is correct
5 Correct 257 ms 4728 KB Output is correct
6 Correct 297 ms 4600 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 6 ms 2432 KB Output is correct
4 Correct 5 ms 2304 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 5 ms 2304 KB Output is correct
7 Correct 5 ms 2304 KB Output is correct
8 Correct 5 ms 2304 KB Output is correct
9 Correct 6 ms 2304 KB Output is correct
10 Correct 7 ms 2560 KB Output is correct
11 Correct 7 ms 2560 KB Output is correct
12 Correct 6 ms 2432 KB Output is correct
13 Correct 7 ms 2432 KB Output is correct
14 Correct 9 ms 2560 KB Output is correct
15 Correct 7 ms 2560 KB Output is correct
16 Correct 7 ms 2560 KB Output is correct
17 Correct 12 ms 2816 KB Output is correct
18 Correct 7 ms 2560 KB Output is correct
19 Correct 6 ms 2304 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 5 ms 2304 KB Output is correct
4 Correct 289 ms 4600 KB Output is correct
5 Correct 45 ms 3448 KB Output is correct
6 Correct 297 ms 4960 KB Output is correct
7 Correct 6 ms 2304 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 270 ms 4764 KB Output is correct
10 Correct 274 ms 4728 KB Output is correct
11 Correct 257 ms 4728 KB Output is correct
12 Correct 297 ms 4600 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 6 ms 2304 KB Output is correct
15 Correct 6 ms 2432 KB Output is correct
16 Correct 5 ms 2304 KB Output is correct
17 Correct 6 ms 2304 KB Output is correct
18 Correct 5 ms 2304 KB Output is correct
19 Correct 5 ms 2304 KB Output is correct
20 Correct 5 ms 2304 KB Output is correct
21 Correct 6 ms 2304 KB Output is correct
22 Correct 7 ms 2560 KB Output is correct
23 Correct 7 ms 2560 KB Output is correct
24 Correct 6 ms 2432 KB Output is correct
25 Correct 7 ms 2432 KB Output is correct
26 Correct 9 ms 2560 KB Output is correct
27 Correct 7 ms 2560 KB Output is correct
28 Correct 7 ms 2560 KB Output is correct
29 Correct 12 ms 2816 KB Output is correct
30 Correct 7 ms 2560 KB Output is correct
31 Correct 6 ms 2304 KB Output is correct
32 Correct 5 ms 2304 KB Output is correct
33 Correct 5 ms 2304 KB Output is correct
34 Correct 5 ms 2304 KB Output is correct
35 Correct 261 ms 4804 KB Output is correct
36 Correct 44 ms 3456 KB Output is correct
37 Correct 314 ms 4984 KB Output is correct
38 Correct 6 ms 2304 KB Output is correct
39 Correct 6 ms 2432 KB Output is correct
40 Correct 282 ms 4728 KB Output is correct
41 Correct 276 ms 4728 KB Output is correct
42 Correct 262 ms 4872 KB Output is correct
43 Correct 284 ms 4600 KB Output is correct
44 Correct 6 ms 2304 KB Output is correct
45 Correct 6 ms 2304 KB Output is correct
46 Correct 6 ms 2304 KB Output is correct
47 Correct 5 ms 2304 KB Output is correct
48 Correct 7 ms 2560 KB Output is correct
49 Correct 8 ms 2560 KB Output is correct
50 Correct 6 ms 2304 KB Output is correct
51 Correct 6 ms 2560 KB Output is correct
52 Correct 9 ms 2560 KB Output is correct
53 Correct 7 ms 2560 KB Output is correct
54 Correct 7 ms 2560 KB Output is correct
55 Correct 12 ms 2816 KB Output is correct
56 Correct 7 ms 2560 KB Output is correct
57 Correct 12 ms 2816 KB Output is correct
58 Correct 23 ms 3320 KB Output is correct
59 Correct 42 ms 3704 KB Output is correct
60 Correct 480 ms 7624 KB Output is correct
61 Correct 94 ms 4352 KB Output is correct
62 Correct 87 ms 4352 KB Output is correct
63 Correct 450 ms 6612 KB Output is correct
64 Correct 92 ms 4088 KB Output is correct
65 Correct 512 ms 7592 KB Output is correct
66 Correct 270 ms 5368 KB Output is correct
67 Correct 460 ms 6544 KB Output is correct
68 Correct 211 ms 4044 KB Output is correct
69 Correct 6 ms 2304 KB Output is correct