Submission #226872

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
226872	2020-04-25T14:58:52 Z	MetB	Cop and Robber (BOI14_coprobber)	C++14	100 / 100	887 ms	32248 KB

coprobber

#include "coprobber.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
#define N 1000003
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;

int d[N], dg[N], m, n;
int mv[N], gl, sm[500];
bool a[500][500];

vector <int> g[N];

int couple (int x, int y, int t) {
	return 2 * (x * n + y) + t;
}

tuple <int, int, int> decouple (int s) {
	return tuple <int, int, int> ((s / 2) / n, (s / 2) % n, s % 2);
}

void print (int s) {
	cout << (s / 2) / n << ' ' << (s / 2) % n << ' ' << s % 2 << endl;
}

bool is_n (int x, int y, int t, int i) {
	if (t) return a[x][i] || (x == i);
	return a[y][i];
}

int start (int v, bool A[][500]) {
	n = v;
	m = 2 * n * n;

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			sm[i] += (int) A[i][j];
	memcpy (a, A, sizeof (a));

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++) {
			dg[couple (i, j, 0)] = sm[i] + 1;
			dg[couple (i, j, 1)] = sm[j];
		}

	fill (d, d + m, 2);

	queue <int> q;


	for (int i = 0; i < n; i++) {
		int s = couple (i, i, 0);
		d[s] = 1, d[s + 1] = 0;
		q.push (s), q.push (s + 1);
	}

	while (!q.empty ()) {
		int s = q.front ();
		int x, y, t;
		tie (x, y, t) = decouple (s);
		q.pop ();
		for (int i = 0; i < n; i++) {
			if (is_n (x, y, t, i)) {
				int to;
				if (t) to = couple (i, y, 0);
				else to = couple (x, i, 1);
				if (d[to] != 2) continue;
				if (!d[s]) {
					d[to] = 1, mv[to] = s;
					q.push (to);
				} else {
					if (--dg[to] < 1) {
						d[to] = 0;
						q.push (to);
					}
				}
			}
		}
	}

	for (int i = 0; i < n; i++) {
		int ok = 1;
		for (int j = 0; j < n; j++) {
			if (d[couple (i, j, 0)] != 1) {
				ok = 0; break;
			}
		}
		if (ok) return gl = i;
	}
	return -1;
}

int nextMove (int x) {
	int s = couple (gl, x, 0);
	s = mv[s];
	gl = (s / 2) / n;
	return gl;
}

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	24064 KB	Output is correct
2	Correct	20 ms	24064 KB	Output is correct
3	Correct	19 ms	24064 KB	Output is correct
4	Correct	384 ms	31352 KB	Output is correct
5	Correct	70 ms	26104 KB	Output is correct
6	Correct	409 ms	31352 KB	Output is correct

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	24064 KB	Output is correct
2	Correct	19 ms	24076 KB	Output is correct
3	Correct	374 ms	31344 KB	Output is correct
4	Correct	390 ms	31456 KB	Output is correct
5	Correct	357 ms	30968 KB	Output is correct
6	Correct	396 ms	31224 KB	Output is correct

Subtask #3
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	24064 KB	Output is correct
2	Correct	21 ms	24064 KB	Output is correct
3	Correct	19 ms	24064 KB	Output is correct
4	Correct	20 ms	24064 KB	Output is correct
5	Correct	18 ms	24064 KB	Output is correct
6	Correct	19 ms	24076 KB	Output is correct
7	Correct	19 ms	24064 KB	Output is correct
8	Correct	19 ms	24064 KB	Output is correct
9	Correct	18 ms	24064 KB	Output is correct
10	Correct	20 ms	24320 KB	Output is correct
11	Correct	21 ms	24320 KB	Output is correct
12	Correct	19 ms	24192 KB	Output is correct
13	Correct	19 ms	24192 KB	Output is correct
14	Correct	22 ms	24320 KB	Output is correct
15	Correct	20 ms	24192 KB	Output is correct
16	Correct	23 ms	24440 KB	Output is correct
17	Correct	27 ms	24576 KB	Output is correct
18	Correct	19 ms	24320 KB	Output is correct
19	Correct	19 ms	24064 KB	Output is correct

Subtask #4
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	24064 KB	Output is correct
2	Correct	20 ms	24064 KB	Output is correct
3	Correct	19 ms	24064 KB	Output is correct
4	Correct	384 ms	31352 KB	Output is correct
5	Correct	70 ms	26104 KB	Output is correct
6	Correct	409 ms	31352 KB	Output is correct
7	Correct	19 ms	24064 KB	Output is correct
8	Correct	19 ms	24076 KB	Output is correct
9	Correct	374 ms	31344 KB	Output is correct
10	Correct	390 ms	31456 KB	Output is correct
11	Correct	357 ms	30968 KB	Output is correct
12	Correct	396 ms	31224 KB	Output is correct
13	Correct	19 ms	24064 KB	Output is correct
14	Correct	21 ms	24064 KB	Output is correct
15	Correct	19 ms	24064 KB	Output is correct
16	Correct	20 ms	24064 KB	Output is correct
17	Correct	18 ms	24064 KB	Output is correct
18	Correct	19 ms	24076 KB	Output is correct
19	Correct	19 ms	24064 KB	Output is correct
20	Correct	19 ms	24064 KB	Output is correct
21	Correct	18 ms	24064 KB	Output is correct
22	Correct	20 ms	24320 KB	Output is correct
23	Correct	21 ms	24320 KB	Output is correct
24	Correct	19 ms	24192 KB	Output is correct
25	Correct	19 ms	24192 KB	Output is correct
26	Correct	22 ms	24320 KB	Output is correct
27	Correct	20 ms	24192 KB	Output is correct
28	Correct	23 ms	24440 KB	Output is correct
29	Correct	27 ms	24576 KB	Output is correct
30	Correct	19 ms	24320 KB	Output is correct
31	Correct	19 ms	24064 KB	Output is correct
32	Correct	19 ms	24064 KB	Output is correct
33	Correct	18 ms	24064 KB	Output is correct
34	Correct	20 ms	24064 KB	Output is correct
35	Correct	384 ms	31456 KB	Output is correct
36	Correct	71 ms	25984 KB	Output is correct
37	Correct	409 ms	31376 KB	Output is correct
38	Correct	18 ms	24064 KB	Output is correct
39	Correct	18 ms	24064 KB	Output is correct
40	Correct	391 ms	31200 KB	Output is correct
41	Correct	389 ms	31480 KB	Output is correct
42	Correct	355 ms	30968 KB	Output is correct
43	Correct	398 ms	31224 KB	Output is correct
44	Correct	19 ms	24064 KB	Output is correct
45	Correct	18 ms	24064 KB	Output is correct
46	Correct	18 ms	24064 KB	Output is correct
47	Correct	19 ms	24064 KB	Output is correct
48	Correct	20 ms	24320 KB	Output is correct
49	Correct	21 ms	24320 KB	Output is correct
50	Correct	19 ms	24064 KB	Output is correct
51	Correct	20 ms	24352 KB	Output is correct
52	Correct	22 ms	24448 KB	Output is correct
53	Correct	20 ms	24320 KB	Output is correct
54	Correct	20 ms	24320 KB	Output is correct
55	Correct	27 ms	24576 KB	Output is correct
56	Correct	20 ms	24320 KB	Output is correct
57	Correct	24 ms	25088 KB	Output is correct
58	Correct	39 ms	28032 KB	Output is correct
59	Correct	52 ms	30200 KB	Output is correct
60	Correct	715 ms	32248 KB	Output is correct
61	Correct	124 ms	29436 KB	Output is correct
62	Correct	119 ms	30456 KB	Output is correct
63	Correct	773 ms	31992 KB	Output is correct
64	Correct	142 ms	30328 KB	Output is correct
65	Correct	887 ms	32128 KB	Output is correct
66	Correct	392 ms	30968 KB	Output is correct
67	Correct	709 ms	31736 KB	Output is correct
68	Correct	301 ms	30328 KB	Output is correct
69	Correct	19 ms	24064 KB	Output is correct

Submission #226872

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 14.0 / 14.0

Subtask #3 30.0 / 30.0

Subtask #4 40.0 / 40.0

Subtask #1
16.0 / 16.0

Subtask #2
14.0 / 14.0

Subtask #3
30.0 / 30.0

Subtask #4
40.0 / 40.0