oj.uz

Submission #413560

# Submission time Handle Problem Language Result Execution time Memory
413560 2021-05-28T22:41:07 Z Blagojce Cop and Robber (BOI14_coprobber) C++11
0 / 100
 1 ms 328 KB 
#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];

int cnt[mxn][mxn];


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


bool vis[mxn][mxn];


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

}






bool update_status(int u, int v){
	if(bit[u][v]) return false;
	
	for(auto e1 : gc[u]){
		if(cnt[e1][v] == (int)g[v].size()){
			nxt[u][v] = e1;
			bit[u][v] = 1;
			
			for(auto e2 : g[v]){
				cnt[u][e2] ++;
			}
			
			return true;
		}
	
	}
	return false;
	/*
	if(gc[u].size() >= sqrt(n)){
		for(auto e1 : gc[u]){
			bool ok = true;
			for(auto e2 : g[v]){
				ok &= bit[e1][e2];
			}
			if(ok){
				bit[u][v] = 1;
				nxt[u][v] = e1;
			}
		}
	}
	
	else{
		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) vis[i][i] = true;
	fr(i, 0, n) nxt[i][i] = i;
	fr(i, 0, n){
		fr(j, 0, n){
			if(A[i][j]){
				nxt[i][j] = j;
				vis[i][j] = true;
				dfs(i, j);
			}
		}
	}
	
	/*
	
	
	
	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
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 Incorrect 1 ms 328 KB Cop can catch the robber, but start() returned -1
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Cop can catch the robber, but start() returned -1
2 Halted 0 ms 0 KB -

Subtask #3
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 Incorrect 1 ms 328 KB Cop can catch the robber, but start() returned -1
4 Halted 0 ms 0 KB -

Subtask #4
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 Incorrect 1 ms 328 KB Cop can catch the robber, but start() returned -1
4 Halted 0 ms 0 KB -