Submission #413544

#	Time	Username	Problem	Language	Result	Execution time	Memory
413544		Blagojce	Cop and Robber (BOI14_coprobber)	C++11	0 / 100	3088 ms	328 KiB

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];

bool bad[mxn][mxn];
int nxt[mxn][mxn];



bitset<mxn> adj[mxn];
bitset<mxn> bit[mxn];


bool update_status(int u, int v){
	if(bad[u][v]) return false;
	for(auto e1 : gc[u]){
		
		if((bit[e1]&adj[v]) == adj[v]){
			bit[u][v] = 1;
			nxt[u][v] = e1;
			return true;
		}
		
		/*bool ok = true;
		for(auto e2 : g[v]){
			ok &= bad[e1][e2];
		}
		bad[u][v] |= ok;
		if(ok){
			nxt[u][v] = e1;
			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]){
				adj[i][j] = 1;
				//g[i].pb(j);
				//gc[i].pb(j);
			}
		}
	}
	fr(i, 0, n){
		fr(j, 0, n){
			if(i == j || A[i][j]){
				bit[i][j] = 1;
				nxt[i][j] = j;
				
				//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 &= bit[i][j];
		}
		if(cand){
			cop = i;
			return i;
		}
	}
	return -1;
}
int nextMove(int R)
{	
	cop = nxt[cop][R];
	return cop;
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 14
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40