oj.uz

Submission #102737

# Submission time Handle Problem Language Result Execution time Memory
102737 2019-03-27T11:05:38 Z Minnakhmetov Amusement Park (JOI17_amusement_park) C++14
0 / 100
 515 ms 190940 KB 
#include "Joi.h"

#include <vector>
#include <map>
#include <algorithm>

using namespace std;

#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

static const int N = 1e4 + 5, D = 60;
static vector<int> g[N];
static int num[N];

static struct Tree {
	vector<int> t[D];
	int id_to_node[D];
	map<int, int> node_to_id;

	Tree() {
		fill(id_to_node, id_to_node + D, -1);
	}

	void addNode(int node) {
		for (int i = 0; i < D; i++) {
			if (id_to_node[i] == -1) {
				id_to_node[i] = node;
				node_to_id[node] = i;
				break;
			}
		}
	}
	void addEdge(int x, int y) {
		x = node_to_id[x];
		y = node_to_id[y];
		t[x].push_back(y);
		t[y].push_back(x);
	}

	void delNode(int id) {
		for (int to : t[id]) {
			t[to].erase(find(all(t[to]), id));
		}
		t[id].clear();
		node_to_id.erase(id_to_node[id]);
		id_to_node[id] = -1;
	}

	int popLeafNotEqualTo(int node) {
		int id = -1;
		for (int i = 0; i < D; i++) {
			if (id_to_node[i] != -1 &&
				id_to_node[i] != node) {
				id = i;
				break;
			}
		}
		int deletedNode = id_to_node[id];
		delNode(id);
		return deletedNode;
	}

	int getNodeCount() {
		return node_to_id.size();
	}

} tr[N];

static void dfs(int node, int anc, Tree &t) {
	num[node] = t.getNodeCount();
	t.addNode(node);
	if (anc != -1)
		t.addEdge(node, anc);
	if (t.getNodeCount() == 60)
		return;
	for (int to : g[node]) {
		if (num[to] == -1) {
			dfs(to, node, t);
			if (t.getNodeCount() == 60)
				return;
		}
	}
}

static void deep(int node, int anc, Tree t) {
	num[node] = num[t.popLeafNotEqualTo(anc)];
	t.addNode(node);
	t.addEdge(node, anc);
	tr[node] = t;

	for (int to : g[node]) {
		if (num[to] == -1) {
			deep(to, node, t);
		}
	}
}

void Joi(int n, int m, int A[], int B[], long long x, int t) {
	for (int i = 0; i < m; i++) {
		g[A[i]].push_back(B[i]);
		g[B[i]].push_back(A[i]);
	}

	fill(num, num + n, -1);

	Tree fir;
	dfs(0, -1, fir);

	for (int i = 0; i < n; i++) {
		if (num[i] != -1)
			tr[i] = fir;
	}

	for (int i = 0; i < n; i++) {
		if (num[i] != -1) {
			for (int to : g[i]) {
				if (num[to] == -1) {
					deep(to, i, fir);
				}
			}
		}
	}
	
	for(int i = 0; i < n; i++){
		MessageBoard(i, (x >> num[i]) & 1);
	}
}

#include "Ioi.h"

#include <vector>
#include <map>
#include <algorithm>

using namespace std;

#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

static const int N = 1e4 + 5, D = 60;
static vector<int> g[N];
static int num[N];

struct Tree {
	vector<int> t[D];
	int id_to_node[D];
	map<int, int> node_to_id;

	Tree() {
		fill(id_to_node, id_to_node + D, -1);
	}

	void addNode(int node) {
		for (int i = 0; i < D; i++) {
			if (id_to_node[i] == -1) {
				id_to_node[i] = node;
				node_to_id[node] = i;
				break;
			}
		}
	}
	void addEdge(int x, int y) {
		x = node_to_id[x];
		y = node_to_id[y];
		t[x].push_back(y);
		t[y].push_back(x);
	}

	void delNode(int id) {
		for (int to : t[id]) {
			t[to].erase(find(all(t[to]), id));
		}
		t[id].clear();
		node_to_id.erase(id_to_node[id]);
		id_to_node[id] = -1;
	}

	int popLeafNotEqualTo(int node) {
		int id = -1;
		for (int i = 0; i < D; i++) {
			if (id_to_node[i] != -1 &&
				id_to_node[i] != node) {
				id = i;
				break;
			}
		}
		int deletedNode = id_to_node[id];
		delNode(id);
		return deletedNode;
	}

	int getNodeCount() {
		return node_to_id.size();
	}

} tr[N];

void dfs(int node, int anc, Tree &t) {
	num[node] = t.getNodeCount();
	t.addNode(node);
	if (anc != -1)
		t.addEdge(node, anc);
	if (t.getNodeCount() == 60)
		return;
	for (int to : g[node]) {
		if (num[to] == -1) {
			dfs(to, node, t);
			if (t.getNodeCount() == 60)
				return;
		}
	}
}

void deep(int node, int anc, Tree t) {
	num[node] = num[t.popLeafNotEqualTo(anc)];
	t.addNode(node);
	t.addEdge(node, anc);
	tr[node] = t;

	for (int to : g[node]) {
		if (num[to] == -1) {
			deep(to, node, t);
		}
	}
}

ll ans = 0;
static bool used[D];

void walk(int node, int anc, Tree &t) {
	used[node] = 1;
	for (int to : t.t[node]) {
		if (!used[to]) {
			ans |= (ll)Move(t.id_to_node[to]) << num[t.id_to_node[to]];
			walk(to, node, t);
		}
	}
	if (anc != -1)
		Move(anc);
}

long long Ioi(int n, int m, int A[], int B[], int P, int V, int T) {
	for (int i = 0; i < m; i++) {
		g[A[i]].push_back(B[i]);
		g[B[i]].push_back(A[i]);
	}

	fill(num, num + n, -1);

	Tree fir;
	dfs(0, -1, fir);

	for (int i = 0; i < n; i++) {
		if (num[i] != -1)
			tr[i] = fir;
	}

	for (int i = 0; i < n; i++) {
		if (num[i] != -1) {
			for (int to : g[i]) {
				if (num[to] == -1) {
					deep(to, i, fir);
				}
			}
		}
	}

	ans |= (ll)V << num[P];

	walk(P, -1, tr[P]);

	return ans;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 35848 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 504 ms 190712 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 36352 KB Output is correct
2 Correct 45 ms 36528 KB Output is correct
3 Incorrect 42 ms 36480 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 515 ms 190088 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 483 ms 190940 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -