Submission #235357

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
235357	2020-05-28T06:48:33 Z	ruler	Cop and Robber (BOI14_coprobber)	C++14	100 / 100	565 ms	7160 KB

coprobber

// IOI 2021
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
 
////////////////////////////////////////////////////////////////////

const int N = MAX_N;

queue< pair<bool, pii> > Q;
bool W[2][N][N];
int C, D[N], S[N][N], P[N][N];

int start(int n, bool A[N][N]) {
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) D[i] += (A[i][j]);
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) S[i][j] = D[j];
	for (int i = 0; i < n; i++) for (int t = 0; t < 2; t++) Q.push(make_pair(t, make_pair(i, i))), W[t][i][i] = 1, P[i][i] = i;
	while (!Q.empty()) {
		pair<bool, pii> state = Q.front(); Q.pop();
		int t = state.first, c = state.second.first, r = state.second.second;
		if (t) {
			for(int rr = 0; rr < n; rr++) if (A[r][rr] && --S[c][rr] == 0 && !W[0][c][rr]) 
				W[0][c][rr] = 1, Q.push(make_pair(0, make_pair(c, rr)));
		} else {
			for (int cc = 0; cc < n; cc++) if ((c == cc || A[c][cc]) && !W[1][cc][r]) 
				W[1][cc][r] = 1, P[cc][r] = c, Q.push(make_pair(1, make_pair(cc, r)));
		}
	}
	for (int i = 0; i < n; i++) {
		bool f = 1;
		for (int j = 0; j < n; j++) f &= W[1][i][j];
		if (f) return C = i;
	}
	return -1;
}

int nextMove(int R) {
    return C = P[C][R];
}

/*
int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	mt19937 Rnd(time(0));


	return 0;
}
*/

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	326 ms	4204 KB	Output is correct
5	Correct	49 ms	2176 KB	Output is correct
6	Correct	348 ms	4472 KB	Output is correct

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	512 KB	Output is correct
3	Correct	320 ms	4344 KB	Output is correct
4	Correct	329 ms	4188 KB	Output is correct
5	Correct	316 ms	4344 KB	Output is correct
6	Correct	344 ms	4220 KB	Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	326 ms	4204 KB	Output is correct
5	Correct	49 ms	2176 KB	Output is correct
6	Correct	348 ms	4472 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	320 ms	4344 KB	Output is correct
10	Correct	329 ms	4188 KB	Output is correct
11	Correct	316 ms	4344 KB	Output is correct
12	Correct	344 ms	4220 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	5 ms	512 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	4 ms	384 KB	Output is correct
18	Correct	4 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	5 ms	432 KB	Output is correct
22	Correct	6 ms	896 KB	Output is correct
23	Correct	7 ms	896 KB	Output is correct
24	Correct	5 ms	512 KB	Output is correct
25	Correct	5 ms	768 KB	Output is correct
26	Correct	7 ms	896 KB	Output is correct
27	Correct	6 ms	768 KB	Output is correct
28	Correct	6 ms	768 KB	Output is correct
29	Correct	12 ms	1152 KB	Output is correct
30	Correct	6 ms	896 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	4 ms	384 KB	Output is correct
33	Correct	5 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	330 ms	4216 KB	Output is correct
36	Correct	51 ms	2300 KB	Output is correct
37	Correct	355 ms	4524 KB	Output is correct
38	Correct	4 ms	384 KB	Output is correct
39	Correct	5 ms	384 KB	Output is correct
40	Correct	323 ms	4284 KB	Output is correct
41	Correct	333 ms	4216 KB	Output is correct
42	Correct	306 ms	4320 KB	Output is correct
43	Correct	338 ms	4088 KB	Output is correct
44	Correct	5 ms	384 KB	Output is correct
45	Correct	5 ms	384 KB	Output is correct
46	Correct	5 ms	384 KB	Output is correct
47	Correct	5 ms	512 KB	Output is correct
48	Correct	6 ms	896 KB	Output is correct
49	Correct	7 ms	896 KB	Output is correct
50	Correct	5 ms	512 KB	Output is correct
51	Correct	5 ms	768 KB	Output is correct
52	Correct	7 ms	896 KB	Output is correct
53	Correct	6 ms	768 KB	Output is correct
54	Correct	6 ms	768 KB	Output is correct
55	Correct	11 ms	1152 KB	Output is correct
56	Correct	6 ms	896 KB	Output is correct
57	Correct	9 ms	1408 KB	Output is correct
58	Correct	26 ms	2560 KB	Output is correct
59	Correct	35 ms	3064 KB	Output is correct
60	Correct	411 ms	7160 KB	Output is correct
61	Correct	85 ms	3712 KB	Output is correct
62	Correct	79 ms	3832 KB	Output is correct
63	Correct	464 ms	6100 KB	Output is correct
64	Correct	99 ms	3576 KB	Output is correct
65	Correct	543 ms	7088 KB	Output is correct
66	Correct	329 ms	4728 KB	Output is correct
67	Correct	565 ms	6044 KB	Output is correct
68	Correct	230 ms	3448 KB	Output is correct
69	Correct	4 ms	384 KB	Output is correct

Submission #235357

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