oj.uz

Submission #413543

# Submission time Handle Problem Language Result Execution time Memory
413543 2021-05-28T21:44:37 Z Blagojce Cop and Robber (BOI14_coprobber) C++11
60 / 100
 1500 ms 4760 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 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;
			}
		}
	}
	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 &= bad[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 682 ms 3008 KB Output is correct
5 Correct 19 ms 1516 KB Output is correct
6 Correct 97 ms 2732 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 1 ms 328 KB Output is correct
3 Correct 189 ms 2772 KB Output is correct
4 Correct 501 ms 2916 KB Output is correct
5 Correct 181 ms 2804 KB Output is correct
6 Correct 420 ms 2784 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 4 ms 584 KB Output is correct
11 Correct 17 ms 584 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 2 ms 456 KB Output is correct
14 Correct 15 ms 644 KB Output is correct
15 Correct 2 ms 584 KB Output is correct
16 Correct 3 ms 584 KB Output is correct
17 Correct 36 ms 840 KB Output is correct
18 Correct 2 ms 584 KB Output is correct
19 Correct 1 ms 328 KB Output is correct

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 682 ms 3008 KB Output is correct
5 Correct 19 ms 1516 KB Output is correct
6 Correct 97 ms 2732 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 189 ms 2772 KB Output is correct
10 Correct 501 ms 2916 KB Output is correct
11 Correct 181 ms 2804 KB Output is correct
12 Correct 420 ms 2784 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 4 ms 584 KB Output is correct
23 Correct 17 ms 584 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 2 ms 456 KB Output is correct
26 Correct 15 ms 644 KB Output is correct
27 Correct 2 ms 584 KB Output is correct
28 Correct 3 ms 584 KB Output is correct
29 Correct 36 ms 840 KB Output is correct
30 Correct 2 ms 584 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 696 ms 2932 KB Output is correct
36 Correct 25 ms 1488 KB Output is correct
37 Correct 102 ms 2824 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 180 ms 2772 KB Output is correct
41 Correct 536 ms 2916 KB Output is correct
42 Correct 173 ms 2760 KB Output is correct
43 Correct 406 ms 2860 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 4 ms 584 KB Output is correct
49 Correct 17 ms 676 KB Output is correct
50 Correct 1 ms 408 KB Output is correct
51 Correct 2 ms 456 KB Output is correct
52 Correct 15 ms 584 KB Output is correct
53 Correct 2 ms 584 KB Output is correct
54 Correct 3 ms 584 KB Output is correct
55 Correct 37 ms 876 KB Output is correct
56 Correct 2 ms 584 KB Output is correct
57 Correct 21 ms 868 KB Output is correct
58 Correct 36 ms 1496 KB Output is correct
59 Correct 119 ms 1840 KB Output is correct
60 Correct 58 ms 4760 KB Output is correct
61 Execution timed out 3060 ms 2492 KB Time limit exceeded
62 Halted 0 ms 0 KB -