oj.uz

Submission #205679

# Submission time Handle Problem Language Result Execution time Memory
205679 2020-02-29T13:14:58 Z ArshiaDadras Amusement Park (JOI17_amusement_park) C++14
45 / 100
 50 ms 7244 KB 
/* In the name of Allah */
#include<bits/stdc++.h>
#include<Joi.h>
using namespace std;

const int N = 1e4 + 5;
int n, m, k, a[N], b[N], root[N], down[N], sz[N], id[N];
vector<int> ed[N], adj[N];
bitset<N> mark;

void dfs_tree(int u) {
	mark.set(u);
	vector<int> help;
	for (auto v: ed[u])
		if (!mark[v]) {
			dfs_tree(v);
			help.push_back(v);
		}
	adj[u] = help;
}

void change(int u) {
	for (auto v: adj[u])
		if (!~root[v]) {
			root[v] = root[u];
			change(v);
		}
}

void go(int u) {
	id[u] = sz[root[u]]++;
	for (auto v: adj[u])
		if (k + sz[root[u]] < 60)
			go(v);
}

void go_big(int u) {
	id[u] = sz[root[u]]++;
	if (adj[u].empty())
		return;
	k = sz[adj[u][0]];
	for (auto v: adj[u])
		if (k + sz[root[u]] < 60 && v ^ adj[u][0])
			go(v);
	go_big(adj[u][0]);
}

bool build(int u) {
	vector<int> help;
	sz[u] = 1, down[u] = 0;
	for (auto v: adj[u])
		if (!build(v)) {
			sz[u] += sz[v];
			help.push_back(v);
			down[u] = max(down[u], down[v] + 1);
		}
	sort(help.begin(), help.end(), [] (int u, int v) {
		return down[u] > down[v];
	});
	adj[u] = help;
	if (sz[u] < 60)
		return false;
	change(root[u] = u);
	sz[u] = 0, go_big(u);
	return true;
}

bool set_root(int v) {
	for (int u = 0; u < n; u++)
		id[u] = root[u] = -1;
	mark.reset(), dfs_tree(v);
	return build(v);
}

void build_tree() {
	if (!set_root(0))
		for (int i = 0; i < m; i++) {
			if (~root[a[i]])
				swap(a[i], b[i]);
			if (!~root[a[i]] && ~root[b[i]]) {
				set_root(b[i]);
				break;
			}
		}
}

void Joi(int N, int M, int A[], int B[], long long X, int T) {
	n = N, m = M;
	for (int u = 0; u < n; u++)
		ed[u].clear();
	for (int i = 0; i < m; i++) {
		ed[a[i] = A[i]].push_back(B[i]);
		ed[b[i] = B[i]].push_back(A[i]);
	}
	build_tree();
	for (int u = 0; u < n; u++)
		MessageBoard(u, ~id[u]? X >> id[u] & 1: 0);
}

/* In the name of Allah */
#include<bits/stdc++.h>
#include<Ioi.h>
using namespace std;

const int N = 1e4 + 5;
int n, m, k, a[N], b[N], root[N], down[N], sz[N], par[N], id[N];
vector<int> ed[N], adj[N], path[N];
bitset<N> mark;

void dfs_tree(int u) {
	mark.set(u);
	vector<int> help;
	for (auto v: ed[u])
		if (!mark[v]) {
			help.push_back(v);
			dfs_tree(v), par[v] = u;
		}
	adj[u] = help;
}

void change(int u) {
	for (auto v: adj[u])
		if (!~root[v]) {
			root[v] = root[u];
			change(v);
		}
}

void go(int u) {
	id[u] = sz[root[u]]++;
	path[root[u]].push_back(u);
	for (auto v: adj[u])
		if (k + sz[root[u]] < 60)
			go(v), path[root[u]].push_back(u);
}

void go_big(int u) {
	id[u] = sz[root[u]]++;
	path[root[u]].push_back(u);
	if (adj[u].empty())
		return;
	k = sz[adj[u][0]];
	for (auto v: adj[u])
		if (k + sz[root[u]] < 60 && v ^ adj[u][0])
			go(v), path[root[u]].push_back(u);
	go_big(adj[u][0]);
}

bool build(int u) {
	vector<int> help;
	sz[u] = 1, down[u] = 0;
	for (auto v: adj[u])
		if (!build(v)) {
			sz[u] += sz[v];
			help.push_back(v);
			down[u] = max(down[u], down[v] + 1);
		}
	sort(help.begin(), help.end(), [] (int u, int v) {
		return down[u] > down[v];
	});
	adj[u] = help;
	if (sz[u] < 60)
		return false;
	change(root[u] = u);
	sz[u] = 0, go_big(u);
	return true;
}

bool set_root(int v) {
	for (int u = 0; u < n; u++) {
		id[u] = root[u] = -1;
		path[u].clear();
	}
	mark.reset(), dfs_tree(v);
	return build(v);
}

void build_tree() {
	if (!set_root(0))
		for (int i = 0; i < m; i++) {
			if (~root[a[i]])
				swap(a[i], b[i]);
			if (!~root[a[i]] && ~root[b[i]]) {
				set_root(b[i]);
				break;
			}
		}
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
	n = N, m = M;
	for (int u = 0; u < n; u++)
		ed[u].clear();
	for (int i = 0; i < m; i++) {
		ed[a[i] = A[i]].push_back(B[i]);
		ed[b[i] = B[i]].push_back(A[i]);
	}
	build_tree();
	while (P ^ root[P])
		V = Move(P = par[P]);
	long long answer = V;
	for (auto u: path[P]) {
		if (P ^ u)
			V = Move(P = u);
		answer |= 1LL * V << id[P];
	}
	return answer;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2040 KB Output is correct
2 Correct 10 ms 2128 KB Output is correct
3 Correct 12 ms 2060 KB Output is correct
4 Correct 10 ms 2276 KB Output is correct
5 Correct 11 ms 2124 KB Output is correct
6 Correct 10 ms 2284 KB Output is correct
7 Correct 11 ms 2108 KB Output is correct
8 Correct 11 ms 2280 KB Output is correct
9 Correct 10 ms 2268 KB Output is correct
10 Correct 10 ms 2268 KB Output is correct
11 Correct 15 ms 2528 KB Output is correct
12 Correct 10 ms 1912 KB Output is correct
13 Correct 12 ms 2176 KB Output is correct
14 Correct 11 ms 2268 KB Output is correct
15 Correct 12 ms 2268 KB Output is correct
16 Correct 11 ms 2176 KB Output is correct
17 Correct 11 ms 2408 KB Output is correct
18 Correct 10 ms 2176 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 5496 KB Output is correct
2 Correct 44 ms 6004 KB Output is correct
3 Correct 43 ms 5908 KB Output is correct
4 Correct 33 ms 4508 KB Output is correct
5 Correct 35 ms 5916 KB Output is correct
6 Correct 35 ms 5276 KB Output is correct
7 Correct 35 ms 5492 KB Output is correct
8 Correct 31 ms 5648 KB Output is correct
9 Correct 35 ms 5668 KB Output is correct
10 Correct 27 ms 4512 KB Output is correct
11 Correct 28 ms 4568 KB Output is correct
12 Correct 31 ms 4436 KB Output is correct
13 Correct 31 ms 4424 KB Output is correct
14 Correct 32 ms 4368 KB Output is correct
15 Correct 33 ms 4888 KB Output is correct
16 Correct 32 ms 4884 KB Output is correct
17 Correct 33 ms 4600 KB Output is correct
18 Correct 33 ms 4588 KB Output is correct
19 Correct 33 ms 4716 KB Output is correct
20 Correct 30 ms 5988 KB Output is correct
21 Correct 28 ms 5868 KB Output is correct
22 Correct 34 ms 5220 KB Output is correct
23 Correct 35 ms 5424 KB Output is correct
24 Correct 34 ms 5396 KB Output is correct
25 Correct 35 ms 5488 KB Output is correct
26 Correct 34 ms 5512 KB Output is correct
27 Correct 36 ms 5412 KB Output is correct
28 Correct 31 ms 5588 KB Output is correct
29 Correct 33 ms 5288 KB Output is correct
30 Correct 33 ms 5492 KB Output is correct
31 Correct 10 ms 2252 KB Output is correct
32 Correct 10 ms 2296 KB Output is correct
33 Correct 10 ms 2144 KB Output is correct
34 Correct 10 ms 2280 KB Output is correct
35 Correct 10 ms 2180 KB Output is correct
36 Correct 11 ms 2164 KB Output is correct
37 Correct 10 ms 2172 KB Output is correct
38 Correct 10 ms 2296 KB Output is correct
39 Correct 10 ms 2172 KB Output is correct
40 Correct 10 ms 2296 KB Output is correct
41 Correct 10 ms 2284 KB Output is correct
42 Correct 10 ms 1924 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2488 KB Output is correct
2 Correct 10 ms 2284 KB Output is correct
3 Correct 10 ms 2280 KB Output is correct
4 Correct 14 ms 2860 KB Output is correct
5 Correct 13 ms 2868 KB Output is correct
6 Correct 14 ms 2864 KB Output is correct
7 Correct 14 ms 3084 KB Output is correct
8 Correct 14 ms 2860 KB Output is correct
9 Correct 30 ms 7244 KB Output is correct
10 Correct 32 ms 7236 KB Output is correct
11 Correct 30 ms 7244 KB Output is correct
12 Correct 10 ms 2168 KB Output is correct
13 Correct 10 ms 2168 KB Output is correct
14 Correct 11 ms 2288 KB Output is correct
15 Correct 10 ms 2152 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 5484 KB Output is correct
2 Correct 44 ms 6012 KB Output is correct
3 Incorrect 39 ms 4756 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 5460 KB Output is correct
2 Correct 50 ms 5916 KB Output is correct
3 Correct 44 ms 6000 KB Output is correct
4 Correct 33 ms 4620 KB Output is correct
5 Correct 34 ms 6428 KB Output is correct
6 Correct 35 ms 5288 KB Output is correct
7 Correct 35 ms 5176 KB Output is correct
8 Correct 36 ms 5788 KB Output is correct
9 Correct 32 ms 5620 KB Output is correct
10 Correct 27 ms 4528 KB Output is correct
11 Correct 27 ms 4520 KB Output is correct
12 Correct 31 ms 4428 KB Output is correct
13 Correct 27 ms 4428 KB Output is correct
14 Correct 32 ms 4404 KB Output is correct
15 Correct 33 ms 4884 KB Output is correct
16 Correct 35 ms 4840 KB Output is correct
17 Correct 33 ms 4604 KB Output is correct
18 Correct 34 ms 4508 KB Output is correct
19 Correct 34 ms 4556 KB Output is correct
20 Correct 31 ms 5952 KB Output is correct
21 Correct 28 ms 5788 KB Output is correct
22 Correct 34 ms 5412 KB Output is correct
23 Correct 30 ms 5276 KB Output is correct
24 Correct 35 ms 5524 KB Output is correct
25 Correct 35 ms 5492 KB Output is correct
26 Correct 35 ms 5148 KB Output is correct
27 Correct 36 ms 5712 KB Output is correct
28 Correct 35 ms 5696 KB Output is correct
29 Correct 32 ms 5436 KB Output is correct
30 Correct 34 ms 5580 KB Output is correct
31 Correct 11 ms 2260 KB Output is correct
32 Correct 11 ms 2252 KB Output is correct
33 Correct 10 ms 2276 KB Output is correct
34 Correct 10 ms 2276 KB Output is correct
35 Correct 12 ms 2168 KB Output is correct
36 Correct 11 ms 2528 KB Output is correct
37 Correct 10 ms 2164 KB Output is correct
38 Correct 10 ms 2292 KB Output is correct
39 Correct 10 ms 2044 KB Output is correct
40 Correct 10 ms 2292 KB Output is correct
41 Correct 10 ms 2168 KB Output is correct
42 Correct 10 ms 2040 KB Output is correct