oj.uz

Submission #61722

# Submission time Handle Problem Language Result Execution time Memory
61722 2018-07-26T12:45:06 Z tmwilliamlin168 Cop and Robber (BOI14_coprobber) C++14
100 / 100
 987 ms 9592 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN=500;
int n, as[mxN*mxN*2], aws[mxN*mxN*2], qu[mxN*mxN*2], qh, qt, p, f[mxN*mxN];
bool a[mxN][mxN], w[mxN*mxN*2];

int start(int n2, bool a2[mxN][mxN]) {
	n=n2;
	for(int i=0; i<n; ++i)
		memcpy(a[i], a2[i], n);
	memset(as, 0, 4*n*n*2);
	for(int i=0; i<n; ++i) {
		for(int j=0; j<n; ++j) {
			if(!a[i][j]||i==j)
				continue;
			for(int k=0; k<n; ++k) {
				++as[(i*n+k)*2];
				if(i!=j)
					++as[(k*n+i)*2+1];
			}
		}
	}
	memset(w, 0, n*n*2);
	memset(aws, 0, 4*n*n*2);
	qh=qt=0;
	for(int i=0; i<n; ++i) {
		for(int j=0; j<2; ++j) {
			w[(i*n+i)*2+j]=1;
			qu[qt++]=(i*n+i)*2+j;
		}
	}
	while(qh<qt) {
		int u=qu[qh++], b=u/2/n, c=u/2%n, d=u%2;
		for(int i=0; i<n; ++i) {
			if(d&&(a[i][b]||i==b)&&!w[(i*n+c)*2]) {
				w[(i*n+c)*2]=1;
				qu[qt++]=(i*n+c)*2;
				f[i*n+c]=b;
			} else if(!d&&a[i][c]&&!w[(b*n+i)*2+1]) {
				++aws[(b*n+i)*2+1];
				if(aws[(b*n+i)*2+1]>=as[(b*n+i)*2+1]) {
					w[(b*n+i)*2+1]=1;
					qu[qt++]=(b*n+i)*2+1;
				}
			}
		}
	}
	p=0;
	bool ok=1;
	for(int i=0; i<n&&ok; ++i)
		ok=w[i*2];
	return ok?0:-1;
}

int nextMove(int r) {
	return p=f[p*n+r];
}

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 329 ms 9464 KB Output is correct
5 Correct 48 ms 2808 KB Output is correct
6 Correct 393 ms 9212 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 3 ms 384 KB Output is correct
3 Correct 368 ms 9080 KB Output is correct
4 Correct 362 ms 9464 KB Output is correct
5 Correct 344 ms 8824 KB Output is correct
6 Correct 411 ms 9208 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 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 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 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 612 KB Output is correct
14 Correct 5 ms 768 KB Output is correct
15 Correct 4 ms 640 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 10 ms 1024 KB Output is correct
18 Correct 3 ms 768 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 351 ms 9592 KB Output is correct
5 Correct 48 ms 2808 KB Output is correct
6 Correct 422 ms 9336 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 364 ms 9128 KB Output is correct
10 Correct 324 ms 9416 KB Output is correct
11 Correct 341 ms 8936 KB Output is correct
12 Correct 388 ms 9208 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 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 5 ms 640 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 5 ms 640 KB Output is correct
22 Correct 3 ms 640 KB Output is correct
23 Correct 3 ms 640 KB Output is correct
24 Correct 10 ms 1024 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 6 ms 1408 KB Output is correct
27 Correct 21 ms 4224 KB Output is correct
28 Correct 34 ms 6264 KB Output is correct
29 Correct 817 ms 9180 KB Output is correct
30 Correct 237 ms 5496 KB Output is correct
31 Correct 240 ms 6552 KB Output is correct
32 Correct 754 ms 9464 KB Output is correct
33 Correct 165 ms 6776 KB Output is correct
34 Correct 987 ms 9336 KB Output is correct
35 Correct 404 ms 8576 KB Output is correct
36 Correct 919 ms 9384 KB Output is correct
37 Correct 380 ms 7228 KB Output is correct
38 Correct 2 ms 384 KB Output is correct