Ideone.com

fork download

copy

#include <bits/stdc++.h>
 
using namespace std;
 
namespace cartesian {
 
	struct node;
	typedef node* treap;
 
	struct node {
		node *l = 0, *r = 0, *p = 0;
		int64_t sum = 0, to_add = 0, val = 0;
		int to_nul = 0, siz = 1;
		int key, prior;
 
		node(int key, int val): sum(val), val(val), key(key), prior(rand()) {}
 
 
		#define safe(x, op) (x ? x->op : 0)
 
		treap fix() {
			safe(l, p = this);
			safe(r, p = this);
			sum = val + safe(l, sum) + safe(r, sum);
			siz = 1 + safe(l, siz) + safe(r, siz);
			return this;
		}
		treap cut_l() {
			push();
			safe(l, p = 0);
			return l;
		}
		treap cut_r() {
			push();
			safe(r, p = 0);
			return r;
		}
		treap set_l(treap x) {
			l = x;
			return fix();
		}
		treap set_r(treap x) {
			r = x;
			return fix();
		}
 
		treap nullify() {
			to_nul = 1;
			sum = to_add = val = 0;
			return this;
		}
		treap add(int64_t k) {
			to_add += k;
			val += k;
			sum += siz * k;
			return this;
		}
 
		treap push() {
			if(to_nul) {
				safe(l, nullify());
				safe(r, nullify());
				to_nul = 0;
			}
			if(to_add) {
				safe(l, add(to_add));
				safe(r, add(to_add));
				to_add = 0;
			}
			return this;
		}		
		treap root() {
			return p ? p->root() : this;
		}
		treap min() {
			return l ? l->min() : this;
		}
	};
	treap merge(treap a, treap b) {
		if(!a || !b) {
			return a ? a : b;
		} else if(a->prior < b->prior) {
			return a->set_r(merge(a->cut_r(), b));
		} else {
			return b->set_l(merge(a, b->cut_l()));
		}
	}
	pair<treap, treap> split(treap a, int k) {
		treap b, c;
		if(!a) {
			return {0, 0};
		} else if(a->key < k) {
			tie(b, c) = split(a->cut_r(), k);
			return {a->set_r(b), c};
		} else {
			tie(b, c) = split(a->cut_l(), k);
			return {b, a->set_l(c)};
		}
	}
	pair<treap, treap> cut(treap a, int l, int r) {
		treap b, c;
		tie(a, b) = split(a, l);
		tie(b, c) = split(b, r);
		return {merge(a, c), b};
	}
	treap link(treap a, treap x) {
		treap b;
		tie(a, b) = split(a, x->min()->key);
		return merge(a, merge(x, b));
	}
	pair<treap, treap> cut(treap x) {
		return cut(x->root(), x->key, x->key + 1);
	}
};
 
using namespace cartesian;
 
const int maxn = 5e5 + 42, logn = 22;
 
int sm[2][4 * maxn];
 
void add(int z, int p, int c, int v = 1, int l = 0, int r = maxn) {
	sm[z][v] += c;
	if(r - l > 1) {
		int m = (l + r) / 2;
		if(p < m) {
			add(z, p, c, 2 * v, l, m);
		} else {
			add(z, p, c, 2 * v + 1, m, r);
		}
	}
}
int sum(int p, int v = 1, int l = 0, int r = maxn) {
	if(r - l == 1) {
		return sm[0][v];
	} else {
		int m = (l + r) / 2;
		if(p < m) {
			return sum(p, 2 * v, l, m);
		} else {
			return (sm[0][2 * v] - sm[1][2 * v]) + sum(p, 2 * v + 1, m, r);
		}
	}
}
 
 
int to[maxn], a[maxn];
int in[maxn], out[maxn], rin[maxn];
int up[maxn][logn];
vector<int> g[maxn];
int sz, t;
string s;
 
treap nod[maxn];
 
 
int to_con;
set<int> non_zero;
 
int sum_root(int x) {
	return sum(out[x]);
}
void add_root(int x, int k) {
	add(0, in[x], k);
	add(1, out[x], k);
}
 
bool is_par(int a, int b) {
	return in[a] <= in[b] && out[b] <= out[a];
}
 
int lca(int a, int b) {
	for(int i = logn - 1; i >= 0; i--) {
		if(!is_par(up[a][i], b)) {
			a = up[a][i];
		}
	}
	if(!is_par(a, b)) {
		a = up[a][0];
	}
	return a;
}
 
int sum_path(int a, int b) {
	return sum_root(a) + sum_root(b) - 2 * sum_root(lca(a, b));
}
 
int process(int x) {
	if(non_zero.empty()) {
		return 0;
	} else {
		int g = lca(rin[*begin(non_zero)], rin[*prev(end(non_zero))]);
		if(is_par(g, x)) {
			vector<int> pos;
			int t = sum_root(x);
			auto it = non_zero.lower_bound(in[x]);
			if(it != end(non_zero)) {
				pos.push_back(t - sum_root(lca(x, rin[*it])));
			}
			if(it != begin(non_zero)) {
				pos.push_back(t - sum_root(lca(x, rin[*prev(it)])));
			}
			return *min_element(begin(pos), end(pos));
		} else {
			return sum_path(g, x);
		}
	}
}
void ins(int x) {
	to_con += process(x);
	non_zero.insert(in[x]);
}
void rem(int x) {
	non_zero.erase(in[x]);
	to_con -= process(x);
}
void upd(int x, int k) {
	auto it = non_zero.lower_bound(in[x]);
	auto jt = non_zero.lower_bound(out[x]);
	to_con += k * (it != jt && (it != begin(non_zero) || jt != end(non_zero)));
	add_root(x, k);
}
 
 
void dfs(int v = 0, int p = 0) {
	in[v] = t++;
	rin[in[v]] = v;
	nod[v] = new node(in[v], a[v]);
	for(auto it: g[v]) {
		int u = to[it];
		if(u != p) {
			up[u][0] = v;
			for(int i = 1; i < logn; i++) {
				up[u][i] = up[up[u][i - 1]][i - 1];
			}
			dfs(u, v);
			if(s[it / 2] == '0') {
				merge(nod[v]->root(), nod[u]->root());
			} else {
				upd(u, 1);
			}
		}
	}
	out[v] = t++;
}
 
void inv(int u, int v) {
	if(in[u] > in[v]) {
		swap(u, v);
	}
	auto U = nod[u]->root();
	auto V = nod[v]->root();
	if(U != V) {
		if(V->sum > 0) {
			rem(rin[V->min()->key]);
		}
		if(U->sum > 0) {
			rem(rin[U->min()->key]);
		}
		link(U, V);
		U = nod[u]->root();
		if(U->sum > 0) {
			ins(rin[U->min()->key]);
		}
		upd(v, -1);
	} else {
		if(U->sum > 0) {
			rem(rin[U->min()->key]);
		}
		cut(U, in[v], out[v]);
		U = nod[u]->root();
		V = nod[v]->root();
		if(U->sum > 0) {
			ins(rin[U->min()->key]);
		}
		if(V->sum > 0) {
			ins(rin[V->min()->key]);
		}
		upd(v, 1);
	}
}
void add(int x, int c) {
	if(nod[x]->root()->sum == 0 && c > 0) {
		ins(rin[nod[x]->root()->min()->key]);
	}
	nod[x]->root()->add(c);
}
void compose(int x) {
	treap a, b;
	tie(a, b) = cut(nod[x]);
	b->add(safe(a, sum));
	safe(a, nullify());
	link(a, b);
}
int64_t get(int x) {
	treap a, b;
	tie(a, b) = cut(nod[x]);
	int64_t res = b->sum;
	link(a, b);
	return res;
}
int64_t get_total(int x) {
	return nod[x]->root()->sum;
}
void full_nul(int x) {
	if(nod[x]->root()->sum > 0) {
		rem(rin[nod[x]->root()->min()->key]);
	}
	nod[x]->root()->nullify();
}
 
 
signed main() {
	//freopen("input.txt", "r", stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n;
	cin >> n >> m;
	int u[n], v[n];
	for(int i = 0; i < n - 1; i++) {
		cin >> u[i] >> v[i];
		u[i]--, v[i]--;
		g[v[i]].push_back(sz);
		to[sz++] = u[i];
		g[u[i]].push_back(sz);
		to[sz++] = v[i];
	}
	cin >> s;
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	dfs();
	for(int x = 0; x < n; x++) {
		if(!nod[x]->p && nod[x]->sum != 0) {
			ins(rin[nod[x]->min()->key]);
		}
	}
	for(int i = 0; i < m; i++) {
		int t;
		cin >> t;
		if(t == 1) {
			int i;
			cin >> i;
			inv(u[i - 1], v[i - 1]);
		} else if(t == 2) {
			int x, c;
			cin >> x >> c;
			add(x - 1, c);
		} else if(t == 3) {
			int x;
			cin >> x;
			compose(x - 1);
		} else if(t == 4) {
			int x;
			cin >> x;
			cout << get(x - 1) << endl;
		} else if(t == 5) {
			int x;
			cin >> x;
			cout << get_total(x - 1) << endl;
		} else if(t == 6) {
			int x;
			cin >> x;
			full_nul(x - 1);
		} else {
			cout << to_con << endl;
		}
	}
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

namespace cartesian {
	
	struct node;
	typedef node* treap;
	
	struct node {
		node *l = 0, *r = 0, *p = 0;
		int64_t sum = 0, to_add = 0, val = 0;
		int to_nul = 0, siz = 1;
		int key, prior;
		
		node(int key, int val): sum(val), val(val), key(key), prior(rand()) {}
		
		
		#define safe(x, op) (x ? x->op : 0)
		
		treap fix() {
			safe(l, p = this);
			safe(r, p = this);
			sum = val + safe(l, sum) + safe(r, sum);
			siz = 1 + safe(l, siz) + safe(r, siz);
			return this;
		}
		treap cut_l() {
			push();
			safe(l, p = 0);
			return l;
		}
		treap cut_r() {
			push();
			safe(r, p = 0);
			return r;
		}
		treap set_l(treap x) {
			l = x;
			return fix();
		}
		treap set_r(treap x) {
			r = x;
			return fix();
		}
		
		treap nullify() {
			to_nul = 1;
			sum = to_add = val = 0;
			return this;
		}
		treap add(int64_t k) {
			to_add += k;
			val += k;
			sum += siz * k;
			return this;
		}
		
		treap push() {
			if(to_nul) {
				safe(l, nullify());
				safe(r, nullify());
				to_nul = 0;
			}
			if(to_add) {
				safe(l, add(to_add));
				safe(r, add(to_add));
				to_add = 0;
			}
			return this;
		}		
		treap root() {
			return p ? p->root() : this;
		}
		treap min() {
			return l ? l->min() : this;
		}
	};
	treap merge(treap a, treap b) {
		if(!a || !b) {
			return a ? a : b;
		} else if(a->prior < b->prior) {
			return a->set_r(merge(a->cut_r(), b));
		} else {
			return b->set_l(merge(a, b->cut_l()));
		}
	}
	pair<treap, treap> split(treap a, int k) {
		treap b, c;
		if(!a) {
			return {0, 0};
		} else if(a->key < k) {
			tie(b, c) = split(a->cut_r(), k);
			return {a->set_r(b), c};
		} else {
			tie(b, c) = split(a->cut_l(), k);
			return {b, a->set_l(c)};
		}
	}
	pair<treap, treap> cut(treap a, int l, int r) {
		treap b, c;
		tie(a, b) = split(a, l);
		tie(b, c) = split(b, r);
		return {merge(a, c), b};
	}
	treap link(treap a, treap x) {
		treap b;
		tie(a, b) = split(a, x->min()->key);
		return merge(a, merge(x, b));
	}
	pair<treap, treap> cut(treap x) {
		return cut(x->root(), x->key, x->key + 1);
	}
};

using namespace cartesian;

const int maxn = 5e5 + 42, logn = 22;

int sm[2][4 * maxn];

void add(int z, int p, int c, int v = 1, int l = 0, int r = maxn) {
	sm[z][v] += c;
	if(r - l > 1) {
		int m = (l + r) / 2;
		if(p < m) {
			add(z, p, c, 2 * v, l, m);
		} else {
			add(z, p, c, 2 * v + 1, m, r);
		}
	}
}
int sum(int p, int v = 1, int l = 0, int r = maxn) {
	if(r - l == 1) {
		return sm[0][v];
	} else {
		int m = (l + r) / 2;
		if(p < m) {
			return sum(p, 2 * v, l, m);
		} else {
			return (sm[0][2 * v] - sm[1][2 * v]) + sum(p, 2 * v + 1, m, r);
		}
	}
}


int to[maxn], a[maxn];
int in[maxn], out[maxn], rin[maxn];
int up[maxn][logn];
vector<int> g[maxn];
int sz, t;
string s;

treap nod[maxn];


int to_con;
set<int> non_zero;

int sum_root(int x) {
	return sum(out[x]);
}
void add_root(int x, int k) {
	add(0, in[x], k);
	add(1, out[x], k);
}

bool is_par(int a, int b) {
	return in[a] <= in[b] && out[b] <= out[a];
}

int lca(int a, int b) {
	for(int i = logn - 1; i >= 0; i--) {
		if(!is_par(up[a][i], b)) {
			a = up[a][i];
		}
	}
	if(!is_par(a, b)) {
		a = up[a][0];
	}
	return a;
}

int sum_path(int a, int b) {
	return sum_root(a) + sum_root(b) - 2 * sum_root(lca(a, b));
}

int process(int x) {
	if(non_zero.empty()) {
		return 0;
	} else {
		int g = lca(rin[*begin(non_zero)], rin[*prev(end(non_zero))]);
		if(is_par(g, x)) {
			vector<int> pos;
			int t = sum_root(x);
			auto it = non_zero.lower_bound(in[x]);
			if(it != end(non_zero)) {
				pos.push_back(t - sum_root(lca(x, rin[*it])));
			}
			if(it != begin(non_zero)) {
				pos.push_back(t - sum_root(lca(x, rin[*prev(it)])));
			}
			return *min_element(begin(pos), end(pos));
		} else {
			return sum_path(g, x);
		}
	}
}
void ins(int x) {
	to_con += process(x);
	non_zero.insert(in[x]);
}
void rem(int x) {
	non_zero.erase(in[x]);
	to_con -= process(x);
}
void upd(int x, int k) {
	auto it = non_zero.lower_bound(in[x]);
	auto jt = non_zero.lower_bound(out[x]);
	to_con += k * (it != jt && (it != begin(non_zero) || jt != end(non_zero)));
	add_root(x, k);
}


void dfs(int v = 0, int p = 0) {
	in[v] = t++;
	rin[in[v]] = v;
	nod[v] = new node(in[v], a[v]);
	for(auto it: g[v]) {
		int u = to[it];
		if(u != p) {
			up[u][0] = v;
			for(int i = 1; i < logn; i++) {
				up[u][i] = up[up[u][i - 1]][i - 1];
			}
			dfs(u, v);
			if(s[it / 2] == '0') {
				merge(nod[v]->root(), nod[u]->root());
			} else {
				upd(u, 1);
			}
		}
	}
	out[v] = t++;
}

void inv(int u, int v) {
	if(in[u] > in[v]) {
		swap(u, v);
	}
	auto U = nod[u]->root();
	auto V = nod[v]->root();
	if(U != V) {
		if(V->sum > 0) {
			rem(rin[V->min()->key]);
		}
		if(U->sum > 0) {
			rem(rin[U->min()->key]);
		}
		link(U, V);
		U = nod[u]->root();
		if(U->sum > 0) {
			ins(rin[U->min()->key]);
		}
		upd(v, -1);
	} else {
		if(U->sum > 0) {
			rem(rin[U->min()->key]);
		}
		cut(U, in[v], out[v]);
		U = nod[u]->root();
		V = nod[v]->root();
		if(U->sum > 0) {
			ins(rin[U->min()->key]);
		}
		if(V->sum > 0) {
			ins(rin[V->min()->key]);
		}
		upd(v, 1);
	}
}
void add(int x, int c) {
	if(nod[x]->root()->sum == 0 && c > 0) {
		ins(rin[nod[x]->root()->min()->key]);
	}
	nod[x]->root()->add(c);
}
void compose(int x) {
	treap a, b;
	tie(a, b) = cut(nod[x]);
	b->add(safe(a, sum));
	safe(a, nullify());
	link(a, b);
}
int64_t get(int x) {
	treap a, b;
	tie(a, b) = cut(nod[x]);
	int64_t res = b->sum;
	link(a, b);
	return res;
}
int64_t get_total(int x) {
	return nod[x]->root()->sum;
}
void full_nul(int x) {
	if(nod[x]->root()->sum > 0) {
		rem(rin[nod[x]->root()->min()->key]);
	}
	nod[x]->root()->nullify();
}


signed main() {
	//freopen("input.txt", "r", stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n;
	cin >> n >> m;
	int u[n], v[n];
	for(int i = 0; i < n - 1; i++) {
		cin >> u[i] >> v[i];
		u[i]--, v[i]--;
		g[v[i]].push_back(sz);
		to[sz++] = u[i];
		g[u[i]].push_back(sz);
		to[sz++] = v[i];
	}
	cin >> s;
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	dfs();
	for(int x = 0; x < n; x++) {
		if(!nod[x]->p && nod[x]->sum != 0) {
			ins(rin[nod[x]->min()->key]);
		}
	}
	for(int i = 0; i < m; i++) {
		int t;
		cin >> t;
		if(t == 1) {
			int i;
			cin >> i;
			inv(u[i - 1], v[i - 1]);
		} else if(t == 2) {
			int x, c;
			cin >> x >> c;
			add(x - 1, c);
		} else if(t == 3) {
			int x;
			cin >> x;
			compose(x - 1);
		} else if(t == 4) {
			int x;
			cin >> x;
			cout << get(x - 1) << endl;
		} else if(t == 5) {
			int x;
			cin >> x;
			cout << get_total(x - 1) << endl;
		} else if(t == 6) {
			int x;
			cin >> x;
			full_nul(x - 1);
		} else {
			cout << to_con << endl;
		}
	}
	return 0;
}


Runtime error #stdin #stdout 0.02s 99264KB

stdin

copy

Standard input is empty

stdout

copy

https://ideone.com/mKfUan

language:

C++14 (gcc 8.3)

created:

visibility:

secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!

Discover > Sphere Engine API

Discover > IDE Widget

Choose your language