oj.uz

Submission #59574

# Submission time Handle Problem Language Result Execution time Memory
59574 2018-07-22T12:00:38 Z Benq Cop and Robber (BOI14_coprobber) C++11
100 / 100
 665 ms 7644 KB 
#include "coprobber.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 500;
// const int MAX_N = 500;

int N, st, in[MX][MX];
bitset<MX> adj[MX];
int dist[MX][MX][2];

int start(int n, bool A[MAX_N][MAX_N]) {
	N = n;
	F0R(i,N) F0R(j,N) {
		adj[i][j] = A[i][j];
		dist[i][j][0] = dist[i][j][1] = MOD;
	}
	queue<array<int,3>> q;
	F0R(i,N) F0R(j,2) {
		dist[i][i][j] = 0;
		q.push({i,i,j});
	}
	F0R(i,N) F0R(j,N) in[i][j] = adj[j].count();
	while (sz(q)) {
		auto a = q.front(); q.pop();
		int cdist = dist[a[0]][a[1]][a[2]];
		if (a[2] == 1) {
			F0R(i,N) if ((i == a[0] || adj[i][a[0]]) && dist[i][a[1]][0] == MOD) {
				dist[i][a[1]][0] = cdist+1;
				q.push({i,a[1],0});
			}
		} else {
			F0R(i,N) if (adj[a[1]][i] && dist[a[0]][i][1] == MOD) {
				in[a[0]][i] --;
				if (in[a[0]][i] == 0) {
					dist[a[0]][i][1] = cdist+1;
					q.push({a[0],i,1});
				}
			}
		}
	}

    //F0R(i,N) F0R(j,N) F0R(k,2) cout << i << " " << j << " " << k << " " << dist[i][j][k] << "\n";
	F0R(i,N) {
		bool ok = 1;
		F0R(j,N) if (dist[i][j][0] == MOD) ok = 0;
		if (ok) return st = i;
	}
	return -1;
}

int nextMove(int R) {
	F0R(i,N) if (i == st || adj[st][i])
		if (dist[i][R][1] < dist[st][R][0])
			return st = i;
	return -1;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 321 ms 4732 KB Output is correct
5 Correct 49 ms 2552 KB Output is correct
6 Correct 370 ms 4916 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 328 ms 4904 KB Output is correct
4 Correct 333 ms 4728 KB Output is correct
5 Correct 314 ms 4700 KB Output is correct
6 Correct 332 ms 4600 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 896 KB Output is correct
14 Correct 5 ms 1024 KB Output is correct
15 Correct 4 ms 768 KB Output is correct
16 Correct 4 ms 768 KB Output is correct
17 Correct 9 ms 1280 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 2 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 327 ms 4728 KB Output is correct
5 Correct 50 ms 2432 KB Output is correct
6 Correct 392 ms 5036 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 324 ms 4856 KB Output is correct
10 Correct 332 ms 4856 KB Output is correct
11 Correct 310 ms 4632 KB Output is correct
12 Correct 326 ms 4732 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 4 ms 1024 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 6 ms 1024 KB Output is correct
22 Correct 4 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 9 ms 1280 KB Output is correct
25 Correct 4 ms 1024 KB Output is correct
26 Correct 9 ms 1664 KB Output is correct
27 Correct 23 ms 2812 KB Output is correct
28 Correct 42 ms 3704 KB Output is correct
29 Correct 615 ms 7644 KB Output is correct
30 Correct 99 ms 4216 KB Output is correct
31 Correct 100 ms 4476 KB Output is correct
32 Correct 583 ms 6648 KB Output is correct
33 Correct 113 ms 4260 KB Output is correct
34 Correct 665 ms 7516 KB Output is correct
35 Correct 345 ms 5368 KB Output is correct
36 Correct 621 ms 6420 KB Output is correct
37 Correct 261 ms 4016 KB Output is correct
38 Correct 2 ms 384 KB Output is correct