oj.uz

Submission #413548

# Submission time Handle Problem Language Result Execution time Memory
413548 2021-05-28T21:58:37 Z Blagojce Cop and Robber (BOI14_coprobber) C++11
14 / 100
 412 ms 4000 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];
 
bool update_status(int u, int v){
	if(bad[u][v]) return false;
	for(auto e1 : gc[u]){
		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 dist[mxn][mxn];

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){
		fr(j, 0, n){
			if(i == j || A[i][j]){
				bad[i][j] = true;
				nxt[i][j] = j;
			}
		}
	}
	fr(i, 0, n){
		fr(j, 0, n){
			if(i == j) dist[i][j] = 0;
			else if(A[i][j]) dist[i][j] = 1;
			else dist[i][j] = 1e9;
		}
	}
	
	fr(k, 0, n){
		fr(i, 0, n){
			fr(j, 0, n){
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
			}
		}
	}
	
	
	
	
	fr(k, 0, n){
		fr(i, 0, n){
			fr(j, 0, n){
				if(dist[i][j] != k) continue;
				update_status(i, j);
			}
		}
	}
	fr(k, 0, n){
		fr(i, 0, n){
			fr(j, 0, n){
				if(dist[i][j] != k) continue;
				update_status(i, j);
			}
		}
	}

	fr(i, 0, n){
		bool cand = true;
		fr(j, 0, n){
			cand &= bad[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 Correct 1 ms 328 KB Output is correct
4 Correct 412 ms 3904 KB Output is correct
5 Incorrect 56 ms 1972 KB Cop can catch the robber, but start() returned -1
6 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.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 381 ms 3764 KB Output is correct
4 Correct 397 ms 4000 KB Output is correct
5 Correct 361 ms 3692 KB Output is correct
6 Correct 403 ms 3780 KB Output is correct

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 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 7 ms 840 KB Output is correct
11 Correct 35 ms 840 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 4 ms 712 KB Output is correct
14 Correct 12 ms 840 KB Output is correct
15 Correct 3 ms 584 KB Output is correct
16 Incorrect 3 ms 584 KB Cop can catch the robber, but start() returned -1
17 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 Correct 1 ms 328 KB Output is correct
4 Correct 412 ms 3904 KB Output is correct
5 Incorrect 56 ms 1972 KB Cop can catch the robber, but start() returned -1
6 Halted 0 ms 0 KB -