oj.uz

답안 #205793

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
205793 2020-02-29T22:25:33 Z ArshiaDadras Amusement Park (JOI17_amusement_park) C++14
27 / 100
 3000 ms 7428 KB 
/* In the name of Allah */
#include<bits/stdc++.h>
#include<Joi.h>
using namespace std;

const int N = 1e4 + 5, LG = 60;
int n, m, k, a[N], b[N], root[N], h[N], sz[N], par[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]) {
			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]]++;
	for (auto v: adj[u])
		if (k + sz[root[u]] < LG)
			go(v);
}

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

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

void build_tree(int u) {
	memset(root, -1, sizeof root);
	memset(id, -1, sizeof id);
	mark.reset(), dfs_tree(u);
	if (!build(u))
		for (int v = 0; v < n; v++)
			if (~root[v] && !~root[par[v]])
				return build_tree(v);
}

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(0);
	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, LG = 60;
int n, m, k, a[N], b[N], root[N], h[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]] < LG)
			go(v), path[root[u]].push_back(u);
}

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

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

void build_tree(int u) {
	for (int v = 0; v < n; v++)
		path[v].clear();
	memset(root, -1, sizeof root);
	memset(id, -1, sizeof id);
	mark.reset(), dfs_tree(u);
	if (!build(u))
		for (int v = 0; v < n; v++)
			if (~root[v] && !~root[par[v]])
				return build_tree(v);
}

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(0);
	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
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2224 KB Output is correct
2 Correct 10 ms 2168 KB Output is correct
3 Correct 12 ms 2204 KB Output is correct
4 Correct 12 ms 2056 KB Output is correct
5 Correct 10 ms 2184 KB Output is correct
6 Correct 11 ms 2124 KB Output is correct
7 Correct 10 ms 2172 KB Output is correct
8 Correct 10 ms 2340 KB Output is correct
9 Correct 10 ms 2220 KB Output is correct
10 Correct 11 ms 2164 KB Output is correct
11 Execution timed out 3076 ms 1016 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3068 ms 2296 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 2192 KB Output is correct
2 Correct 10 ms 2216 KB Output is correct
3 Correct 10 ms 2196 KB Output is correct
4 Correct 14 ms 2980 KB Output is correct
5 Correct 14 ms 2964 KB Output is correct
6 Correct 14 ms 3004 KB Output is correct
7 Correct 14 ms 2984 KB Output is correct
8 Correct 13 ms 3008 KB Output is correct
9 Correct 31 ms 7272 KB Output is correct
10 Correct 31 ms 7428 KB Output is correct
11 Correct 31 ms 7416 KB Output is correct
12 Correct 10 ms 2196 KB Output is correct
13 Correct 11 ms 2216 KB Output is correct
14 Correct 10 ms 2036 KB Output is correct
15 Correct 10 ms 2216 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 6136 KB Output is correct
2 Correct 55 ms 5776 KB Output is correct
3 Incorrect 34 ms 4224 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 5780 KB Output is correct
2 Correct 44 ms 5656 KB Output is correct
3 Correct 57 ms 5880 KB Output is correct
4 Correct 34 ms 4568 KB Output is correct
5 Correct 31 ms 6344 KB Output is correct
6 Correct 35 ms 5440 KB Output is correct
7 Correct 35 ms 5056 KB Output is correct
8 Correct 35 ms 5668 KB Output is correct
9 Correct 30 ms 5196 KB Output is correct
10 Correct 28 ms 4500 KB Output is correct
11 Correct 27 ms 4500 KB Output is correct
12 Correct 31 ms 4272 KB Output is correct
13 Correct 27 ms 4388 KB Output is correct
14 Correct 33 ms 4336 KB Output is correct
15 Correct 32 ms 4456 KB Output is correct
16 Correct 33 ms 4608 KB Output is correct
17 Correct 33 ms 4308 KB Output is correct
18 Correct 35 ms 4520 KB Output is correct
19 Correct 36 ms 4296 KB Output is correct
20 Correct 28 ms 5948 KB Output is correct
21 Correct 28 ms 5588 KB Output is correct
22 Correct 34 ms 5380 KB Output is correct
23 Correct 30 ms 5104 KB Output is correct
24 Correct 35 ms 5184 KB Output is correct
25 Correct 34 ms 5416 KB Output is correct
26 Correct 34 ms 5136 KB Output is correct
27 Correct 34 ms 5604 KB Output is correct
28 Correct 35 ms 5588 KB Output is correct
29 Correct 32 ms 5324 KB Output is correct
30 Correct 32 ms 5356 KB Output is correct
31 Correct 10 ms 2208 KB Output is correct
32 Correct 10 ms 2208 KB Output is correct
33 Correct 11 ms 2432 KB Output is correct
34 Correct 10 ms 2216 KB Output is correct
35 Correct 10 ms 2164 KB Output is correct
36 Correct 10 ms 2196 KB Output is correct
37 Correct 10 ms 2216 KB Output is correct
38 Correct 11 ms 2172 KB Output is correct
39 Correct 10 ms 2172 KB Output is correct
40 Correct 10 ms 2172 KB Output is correct
41 Correct 10 ms 2164 KB Output is correct
42 Correct 10 ms 2164 KB Output is correct