oj.uz

답안 #789526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789526 2023-07-21T13:12:00 Z MISM06 Sumtree (INOI20_sumtree) C++14
50 / 100
 3000 ms 92900 KB 
//0 1 1 0 1
//0 1 0 0 1
//1 0 0 1 1
//0 1 1 0 1
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx2")

using namespace std;

#define F 			first
#define S 			second
#define pb 			push_back
#define sze			size()
#define	all(x)		x.begin() , x.end()
#define wall__		cout << "--------------------------------------\n";
#define kids		int mid = (tl + tr) >> 1, cl = v << 1, cr = v << 1 | 1
#define file_io		freopen("input.cpp", "r", stdin); freopen("output.cpp", "w", stdout);

typedef long long ll;
typedef long double dl;
typedef pair < int , int > pii;
typedef pair < int , ll > pil;
typedef pair < ll , int > pli;
typedef pair < ll , ll > pll;
typedef pair < int , pii > piii;
typedef pair < ll, pll > plll;


const ll N = 5e5 + 10, M = 6e5 + 10;
const ll mod = 1e9 + 7;
const ll inf = 2e16;
const ll INF = 1e9 + 10;
const ll lg = 32;

ll fac[M], inv[M];
inline void add (ll &x, ll y) {
	x += y; if (x >= mod) x -= mod;
	if (x < 0) x += mod;
}
inline ll Sum (ll x, ll y) {
	x += y; if (x >= mod) x -= mod;
	if (x < 0) x += mod;
	return x;
}
inline ll mul (ll x, ll y) {
	x *= y; x %= mod; if (x < 0) x+= mod;
	return x;
}
inline ll pw (ll x, ll y) {
	ll res = 1;
	while(y) {
		if (y & 1) res = mul(res, x);
		x = mul(x, x);
		y >>= 1;
	}
	return res;
}
inline ll choose (ll x, ll y) {
	if (x < y || y < 0) return 0;
	return mul(fac[x], mul(inv[y], inv[x - y]));
}

ll n, chp[N], par[N], hv[N], h[N], sub[N];
ll a[N], st[N], en[N], timer = 0, ct[N], c0;
set < pii > s[N];
vector < int > g[N];

struct segtree {
	ll seg[N << 2];
	void build (int v = 1, int tl = 1, int tr = n) {
		if (tl == tr) {
			seg[v] = 1;
			return;
		} kids;
		build(cl, tl, mid);
		build(cr, mid + 1, tr);
		seg[v] = mul(seg[cl], seg[cr]);
	}
	void upd (int idx, ll val, int v = 1, int tl = 1, int tr = n) {
		if (tl == tr) {
			seg[v] = val;
			return;
		} kids;
		if (idx <= mid) upd(idx, val, cl, tl, mid);
		else upd(idx, val, cr, mid + 1, tr);
		seg[v] = mul(seg[cl], seg[cr]);
	}
	ll ask () {
		return seg[1];
	}
} ans;

struct fen {
	ll bit[N];
	fen () {
		fill(bit, bit + N, 0);
	}
	inline ll read (int idx) {
		ll res = 0;
		for (; idx > 0; idx -= (idx & -idx)) res += bit[idx];
		return res;
	}
	inline void upd (int idx, ll val) {
		for (; idx <= n; idx += (idx & -idx)) 
			bit[idx] += val;
	}
	inline ll range (int l, int r) {
		return read(r) - read(l - 1);
	}
} f1, f2;
void dfs0 (int v, int p) {
	par[v] = p;
	h[v] = h[p] + 1;
	sub[v] = 1;
	for (auto u : g[v]) {
		if (u == p) continue;
		dfs0(u, v);
		sub[v] += sub[u];
		if (sub[u] > sub[hv[v]]) hv[v] = u;
	}
}
void dfs (int v, int p) {
	st[v] = ++timer;
	if (hv[v] != 0) {
		chp[hv[v]] = chp[v];
		dfs(hv[v], v);
	}
	for (auto u : g[v]) {
		if (u == p || hv[v] == u) continue;
		chp[u] = u;
		dfs(u, v);
	}
	en[v] = timer;
}
void out () {
	cout << ans.ask() << '\n';
}
bool is[N];
int find_par (int v) {
	// int p = chp[v];
	// while (s[p].lower_bound({h[v], 0}) == s[p].begin() || s[p].sze == 0) {
	// 	p = chp[par[p]];
	// }
	// auto it = s[p].lower_bound({h[v], 0});
	
	// --it;
	// pii x = *it;
	// return x.S;
	v = par[v];
	while(!is[v]) {
		v = par[v];
	}
	return v;	
}

void solve () {

	cin >> n >> a[1];
	for (int i = 1; i < n; i++) {
		int v, u; cin >> v >> u;
		g[v].pb(u); g[u].pb(v);
	}
	ans.build();
	chp[1] = 1;
	dfs0(1, 0);
	dfs(1, 0);
	ct[1] = n; f1.upd(st[1], n); f2.upd(st[1], a[1]);
	ll rs = choose(a[1] + ct[1] - 1, ct[1] - 1);
	ans.upd(1, rs);
	// s[chp[1]].insert({h[1], 1});
	is[1] = 1;
	out();
	int q; cin >> q;
	while (q--) {
		int t; cin >> t;
		if (t == 1) {
			ll v, x; cin >> v >> x;
			ct[v] = sub[v] - f1.range(st[v], en[v]);
			f1.upd(st[v], ct[v]);
			a[v] = x - f2.range(st[v], en[v]);
			f2.upd(st[v], a[v]);
			rs = choose(a[v] + ct[v] - 1, ct[v] - 1);
			ans.upd(v, rs);
			// s[chp[v]].insert({h[v], v});
			is[v] = 1;

			int p = find_par(v);
			ct[p] -= ct[v];
			f1.upd(st[p], -ct[v]);
			a[p] -= a[v];
			f2.upd(st[p], -a[v]);
			rs = choose(a[p] + ct[p] - 1, ct[p] - 1);
			ans.upd(p, rs);
			out();

		} else {
			int v; cin >> v;
			f1.upd(st[v], -ct[v]);
			f2.upd(st[v], -a[v]);
			rs = 1;
			ans.upd(v, rs);
			// s[chp[v]].erase({h[v], v});
			is[v] = 0;

			int p = find_par(v);
			ct[p] += ct[v];
			f1.upd(st[p], ct[v]);
			a[p] += a[v];
			f2.upd(st[p], a[v]);
			rs = choose(a[p] + ct[p] - 1, ct[p] - 1);
			ans.upd(p, rs);
			out();
		}
	}


}


int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	fac[0] = 1;
	for (int i = 1; i < M; i++) fac[i] = mul(fac[i - 1], i);
	inv[M - 1] = pw(fac[M - 1], mod - 2);
	for (int i = M - 2; i >= 0; --i) inv[i] = mul(inv[i + 1], i + 1);
	int t = 1;
	// cin >> t;
	while (t--) {solve();}
    return 0;
}
/*
10 10
1 2
2 4
2 5
5 7
5 8
1 3
3 6
6 9
6 10
13
1 2 10
1 5 10
1 7 10
1 8 0
2 2
1 2 0
2 7
2 2
1 7 0
2 7
1 7 3
2 8
2 5


92378
1001
66
1
1
1
0
0
11
1
11
1
8
6435
*/
//shrek is love;

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 83340 KB Output is correct
2 Correct 116 ms 83148 KB Output is correct
3 Correct 117 ms 83248 KB Output is correct
4 Correct 119 ms 83244 KB Output is correct
5 Correct 108 ms 79340 KB Output is correct
6 Correct 27 ms 53356 KB Output is correct
7 Correct 31 ms 53176 KB Output is correct
8 Correct 29 ms 53224 KB Output is correct
9 Correct 158 ms 75656 KB Output is correct
10 Correct 121 ms 75120 KB Output is correct
11 Correct 121 ms 75172 KB Output is correct
12 Correct 113 ms 74720 KB Output is correct
13 Correct 132 ms 81428 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 52740 KB Output is correct
2 Correct 27 ms 52832 KB Output is correct
3 Correct 31 ms 52868 KB Output is correct
4 Correct 26 ms 52820 KB Output is correct
5 Correct 27 ms 52820 KB Output is correct
6 Correct 29 ms 53040 KB Output is correct
7 Correct 31 ms 53064 KB Output is correct
8 Correct 28 ms 53064 KB Output is correct
9 Correct 33 ms 53276 KB Output is correct
10 Correct 29 ms 53332 KB Output is correct
11 Correct 28 ms 53272 KB Output is correct
12 Correct 27 ms 53332 KB Output is correct
13 Correct 29 ms 53244 KB Output is correct
14 Correct 29 ms 53308 KB Output is correct
15 Correct 29 ms 53456 KB Output is correct
16 Correct 30 ms 53284 KB Output is correct
17 Correct 34 ms 53296 KB Output is correct
18 Correct 28 ms 53116 KB Output is correct
19 Correct 29 ms 53276 KB Output is correct
20 Correct 30 ms 53024 KB Output is correct
21 Correct 28 ms 53076 KB Output is correct
22 Correct 27 ms 52896 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 85640 KB Output is correct
2 Correct 152 ms 86180 KB Output is correct
3 Correct 129 ms 87848 KB Output is correct
4 Correct 180 ms 88676 KB Output is correct
5 Correct 238 ms 86464 KB Output is correct
6 Correct 28 ms 53452 KB Output is correct
7 Correct 27 ms 53256 KB Output is correct
8 Correct 28 ms 53284 KB Output is correct
9 Correct 222 ms 82132 KB Output is correct
10 Correct 209 ms 81716 KB Output is correct
11 Correct 192 ms 81508 KB Output is correct
12 Correct 247 ms 81484 KB Output is correct
13 Execution timed out 3062 ms 92900 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 369 ms 80944 KB Output is correct
2 Correct 390 ms 84040 KB Output is correct
3 Correct 378 ms 84048 KB Output is correct
4 Correct 457 ms 84056 KB Output is correct
5 Correct 379 ms 82816 KB Output is correct
6 Correct 330 ms 84044 KB Output is correct
7 Correct 238 ms 70148 KB Output is correct
8 Correct 263 ms 70408 KB Output is correct
9 Correct 382 ms 84052 KB Output is correct
10 Correct 365 ms 84240 KB Output is correct
11 Correct 384 ms 84324 KB Output is correct
12 Correct 277 ms 70384 KB Output is correct
13 Correct 207 ms 67368 KB Output is correct
14 Correct 256 ms 68568 KB Output is correct
15 Correct 239 ms 68868 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 83340 KB Output is correct
2 Correct 116 ms 83148 KB Output is correct
3 Correct 117 ms 83248 KB Output is correct
4 Correct 119 ms 83244 KB Output is correct
5 Correct 108 ms 79340 KB Output is correct
6 Correct 27 ms 53356 KB Output is correct
7 Correct 31 ms 53176 KB Output is correct
8 Correct 29 ms 53224 KB Output is correct
9 Correct 158 ms 75656 KB Output is correct
10 Correct 121 ms 75120 KB Output is correct
11 Correct 121 ms 75172 KB Output is correct
12 Correct 113 ms 74720 KB Output is correct
13 Correct 132 ms 81428 KB Output is correct
14 Correct 26 ms 52740 KB Output is correct
15 Correct 27 ms 52832 KB Output is correct
16 Correct 31 ms 52868 KB Output is correct
17 Correct 26 ms 52820 KB Output is correct
18 Correct 27 ms 52820 KB Output is correct
19 Correct 29 ms 53040 KB Output is correct
20 Correct 31 ms 53064 KB Output is correct
21 Correct 28 ms 53064 KB Output is correct
22 Correct 33 ms 53276 KB Output is correct
23 Correct 29 ms 53332 KB Output is correct
24 Correct 28 ms 53272 KB Output is correct
25 Correct 27 ms 53332 KB Output is correct
26 Correct 29 ms 53244 KB Output is correct
27 Correct 29 ms 53308 KB Output is correct
28 Correct 29 ms 53456 KB Output is correct
29 Correct 30 ms 53284 KB Output is correct
30 Correct 34 ms 53296 KB Output is correct
31 Correct 28 ms 53116 KB Output is correct
32 Correct 29 ms 53276 KB Output is correct
33 Correct 30 ms 53024 KB Output is correct
34 Correct 28 ms 53076 KB Output is correct
35 Correct 27 ms 52896 KB Output is correct
36 Correct 138 ms 85640 KB Output is correct
37 Correct 152 ms 86180 KB Output is correct
38 Correct 129 ms 87848 KB Output is correct
39 Correct 180 ms 88676 KB Output is correct
40 Correct 238 ms 86464 KB Output is correct
41 Correct 28 ms 53452 KB Output is correct
42 Correct 27 ms 53256 KB Output is correct
43 Correct 28 ms 53284 KB Output is correct
44 Correct 222 ms 82132 KB Output is correct
45 Correct 209 ms 81716 KB Output is correct
46 Correct 192 ms 81508 KB Output is correct
47 Correct 247 ms 81484 KB Output is correct
48 Execution timed out 3062 ms 92900 KB Time limit exceeded
49 Halted 0 ms 0 KB -