Submission #413562

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
413562	2021-05-28T22:52:34 Z	Blagojce	Cop and Robber (BOI14_coprobber)	C++11	100 / 100	564 ms	9796 KB

coprobber

#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
  
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pii;
const ll inf = 1e18;
const int i_inf = 1e9;
const ll mod = 1e9+7;
  
const int mxn = 505;


#include "coprobber.h"



int n;
vector<int> g[mxn];
vector<int> gc[mxn];

int nxt[mxn][mxn];

int cnt[mxn][mxn];


bool vis[mxn][mxn];


void dfs(int u, int v){
	for(auto e1 : g[v]){
		cnt[u][e1] ++;
		if(cnt[u][e1] == (int)g[e1].size()){
			for(auto e2 : gc[u]){
				if(!vis[e2][e1]){
					vis[e2][e1] = true;
					nxt[e2][e1] = u;
					dfs(e2, e1);
				}
			}
		}
	}

}






bool update_status(int u, int v){
	if(vis[u][v]) return false;
	
	for(auto e1 : gc[u]){
		if(cnt[e1][v] == (int)g[v].size()){
			nxt[u][v] = e1;
			vis[u][v] = 1;
			
			for(auto e2 : g[v]){
				cnt[u][e2] ++;
			}
			
			return true;
		}
	
	}
	return false;
}
int cop;

int start(int N, bool A[MAX_N][MAX_N])
{
	n = N;
	fr(i, 0, n){
		gc[i].pb(i);
		fr(j, 0, n){
			if(A[i][j]){
				g[i].pb(j);
				gc[i].pb(j);
			}
		}
	}
	
	fr(i, 0, n) vis[i][i] = true;
	fr(i, 0, n) nxt[i][i] = i;
	queue<pii> Q;
	fr(i, 0, n){
		fr(j, 0, n){
			if(A[i][j]){
				nxt[i][j] = j;
				vis[i][j] = true;
				Q.push({i, j});
			}
		}
	}
	
	
	while(!Q.empty()){
		int u = Q.front().st;
		int v = Q.front().nd;
		Q.pop();
		for(auto e1 : g[v]){
			cnt[u][e1] ++;
			if(cnt[u][e1] == (int)g[e1].size()){
				for(auto e2 : gc[u]){
					if(!vis[e2][e1]){
						vis[e2][e1] = true;
						nxt[e2][e1] = u;
						Q.push({e2, e1});
					}
				}
			}
		
		}
		
		
	}
	
	
	
	
	
	
	/*
	
	
	
	fr(i, 0, n){
		fr(j, 0, n){
			if(i == j){
				bit[i][j] = 1;
				nxt[i][j] = j;
			}
			else if(A[i][j]){
				bit[i][j] = 1;
				nxt[i][j] = j;
				for(auto e2 : g[j]){
					cnt[i][e2] ++;
				}
				
				
				//nxt[i][j] = j;
				
				//bad[i][j] = true;
			}
		}
	}
	*/
	
	
	
	
	
	/*bool progress = true;
	while(progress){
		progress = false;
		fr(i, 0, n){
			fr(j, 0, n){
				progress |= update_status(i, j);
			}
		}
	}*/
	fr(i, 0, n){
		bool cand = true;
		fr(j, 0, n){
			cand &= vis[i][j];
		}
		if(cand){
			cop = i;
			return i;
		}
	}
	return -1;
}
int nextMove(int R)
{	
	cop = nxt[cop][R];
	return cop;
}

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	56 ms	4032 KB	Output is correct
5	Correct	18 ms	2060 KB	Output is correct
6	Correct	61 ms	4256 KB	Output is correct

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	2 ms	328 KB	Output is correct
3	Correct	65 ms	4032 KB	Output is correct
4	Correct	58 ms	4032 KB	Output is correct
5	Correct	63 ms	4044 KB	Output is correct
6	Correct	58 ms	3904 KB	Output is correct

Subtask #3
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	1 ms	328 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	2 ms	840 KB	Output is correct
11	Correct	4 ms	840 KB	Output is correct
12	Correct	1 ms	456 KB	Output is correct
13	Correct	2 ms	712 KB	Output is correct
14	Correct	3 ms	840 KB	Output is correct
15	Correct	3 ms	584 KB	Output is correct
16	Correct	2 ms	584 KB	Output is correct
17	Correct	6 ms	1096 KB	Output is correct
18	Correct	2 ms	840 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct

Subtask #4
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	56 ms	4032 KB	Output is correct
5	Correct	18 ms	2060 KB	Output is correct
6	Correct	61 ms	4256 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	2 ms	328 KB	Output is correct
9	Correct	65 ms	4032 KB	Output is correct
10	Correct	58 ms	4032 KB	Output is correct
11	Correct	63 ms	4044 KB	Output is correct
12	Correct	58 ms	3904 KB	Output is correct
13	Correct	1 ms	328 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	1 ms	328 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	328 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	1 ms	328 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	2 ms	840 KB	Output is correct
23	Correct	4 ms	840 KB	Output is correct
24	Correct	1 ms	456 KB	Output is correct
25	Correct	2 ms	712 KB	Output is correct
26	Correct	3 ms	840 KB	Output is correct
27	Correct	3 ms	584 KB	Output is correct
28	Correct	2 ms	584 KB	Output is correct
29	Correct	6 ms	1096 KB	Output is correct
30	Correct	2 ms	840 KB	Output is correct
31	Correct	1 ms	328 KB	Output is correct
32	Correct	1 ms	328 KB	Output is correct
33	Correct	1 ms	328 KB	Output is correct
34	Correct	1 ms	328 KB	Output is correct
35	Correct	64 ms	3964 KB	Output is correct
36	Correct	17 ms	2120 KB	Output is correct
37	Correct	79 ms	4288 KB	Output is correct
38	Correct	1 ms	328 KB	Output is correct
39	Correct	1 ms	328 KB	Output is correct
40	Correct	59 ms	4040 KB	Output is correct
41	Correct	58 ms	4008 KB	Output is correct
42	Correct	57 ms	3964 KB	Output is correct
43	Correct	68 ms	3904 KB	Output is correct
44	Correct	1 ms	328 KB	Output is correct
45	Correct	1 ms	328 KB	Output is correct
46	Correct	1 ms	328 KB	Output is correct
47	Correct	1 ms	328 KB	Output is correct
48	Correct	2 ms	724 KB	Output is correct
49	Correct	4 ms	840 KB	Output is correct
50	Correct	1 ms	456 KB	Output is correct
51	Correct	2 ms	712 KB	Output is correct
52	Correct	3 ms	840 KB	Output is correct
53	Correct	2 ms	584 KB	Output is correct
54	Correct	2 ms	712 KB	Output is correct
55	Correct	6 ms	1096 KB	Output is correct
56	Correct	2 ms	712 KB	Output is correct
57	Correct	6 ms	1352 KB	Output is correct
58	Correct	19 ms	2264 KB	Output is correct
59	Correct	26 ms	2880 KB	Output is correct
60	Correct	564 ms	9796 KB	Output is correct
61	Correct	87 ms	4668 KB	Output is correct
62	Correct	73 ms	4880 KB	Output is correct
63	Correct	369 ms	8048 KB	Output is correct
64	Correct	31 ms	3392 KB	Output is correct
65	Correct	419 ms	8548 KB	Output is correct
66	Correct	71 ms	4608 KB	Output is correct
67	Correct	210 ms	5592 KB	Output is correct
68	Correct	88 ms	3800 KB	Output is correct
69	Correct	1 ms	328 KB	Output is correct

Submission #413562

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 14.0 / 14.0

Subtask #3 30.0 / 30.0

Subtask #4 40.0 / 40.0

Subtask #1
16.0 / 16.0

Subtask #2
14.0 / 14.0

Subtask #3
30.0 / 30.0

Subtask #4
40.0 / 40.0