oj.uz

답안 #624200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624200 2022-08-07T12:32:43 Z Arinoor Sumtree (INOI20_sumtree) C++17
100 / 100
 583 ms 57856 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb				push_back
#define mp				make_pair
#define fi				first
#define se				second
#define all(x)			x.begin(), x.end()
#define bug(x)			cout << #x << " : " << x << '\n'
#define ios				ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)

typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 2e5 + 10;
const int maxlg = 19;
const int maxf = 1e6 + 10;
const int mod = 1e9 + 7;
const int inf = 1e9 + 10;

int n, fact[maxf], invfact[maxf];
int val[maxn], tag[maxn];
int par[maxn][maxlg], sz[maxn], st[maxn], ed[maxn], tme = 1;
int fenC[maxn], fenS[maxn], fenP[maxn];
vector<int> G[maxn];

int add(int a, int b){
	int c = a + b;
	if(c >= mod) c -= mod;
	if(c < 0) c += mod;
	return c;
}

int mul(int a, int b){
	return 1ll * a * b % mod;
}

int pwr(int a, int b){
	int res = 1;
	for(; b; b >>= 1, a = mul(a, a)) if(b & 1) res = mul(res, a);
	return res;
}

int inv(int a){
	return pwr(a, mod - 2);
}

int C(int a, int b){
	if(a > b)
		return 0;
	return mul(fact[b], mul(invfact[a], invfact[b - a]));
}

void update_fact(){
	fact[0] = 1;
	for(int i = 1; i < maxf; i ++)
		fact[i] = mul(fact[i - 1], i);
	invfact[maxf - 1] = inv(fact[maxf - 1]);
	for(int i = maxf - 2; ~i; i --)
		invfact[i] = mul(invfact[i + 1], i + 1);
}

void add(int *fen, int i, int x){
	for(; i <= n; i += i & -i)
		fen[i] += x;
}

int get(int *fen, int i){
	int res = 0;
	for(; i; i -= i & -i)
		res += fen[i];
	return res;
}

int get(int *fen, int l, int r){
	return get(fen, r) - get(fen, l);
}

void dfs(int v, int p = 0){
	par[v][0] = p;
	for(int i = 1; i < maxlg and par[v][i - 1]; i ++)
		par[v][i] = par[par[v][i - 1]][i - 1];
	st[v] = tme;
	sz[v] = 1;
	for(int u : G[v]){
		if(u ^ p){
			tme ++;
			dfs(u, v);
			sz[v] += sz[u];
		}
	}
	ed[v] = tme;
}

int get_val(int v){
	int cnt = sz[v] - get(fenC, st[v], ed[v]);
	int sum = tag[v] - get(fenS, st[v], ed[v]);
	return C(cnt - 1, cnt + sum - 1);
}

int find(int v){
	int x = get(fenP, st[v]);
	for(int i = maxlg - 1; ~i; i --){
		int u = par[v][i];
		if(!u) continue;
		if(get(fenP, st[u]) == x)
			v = u;
	}
	return par[v][0];
}

int main(){
	ios;
	update_fact();
	int r;
	cin >> n >> r;
	for(int i = 0; i < n - 1; i ++){
		int u, v;
		cin >> u >> v;
		G[u].pb(v);
		G[v].pb(u);
	}
	dfs(1);
	memset(tag, -1, sizeof tag);
	tag[1] = r;
	add(fenP, st[1] + 1, 1); add(fenP, ed[1] + 1, -1);
	fill_n(val, maxn, 1);
	int ans = val[1] = get_val(1);
	cout << ans << '\n';
	int q; cin >> q;
	int Cnt = 0;
	while(q--){
		int t, v;
		cin >> t >> v;
		int p = find(v);
		if(t == 1){
			cin >> tag[v];
			int cnt = sz[v] - get(fenC, st[v], ed[v]);
			int sum = tag[v] - get(fenS, st[v], ed[v]);
			add(fenC, st[v], cnt);
			add(fenS, st[v], sum);
			add(fenC, st[p], -cnt);
			add(fenS, st[p], -sum);
			add(fenP, st[v] + 1, 1); add(fenP, ed[v] + 1, -1);
			val[v] = get_val(v);
			if(val[v])
				ans = mul(ans, val[v]);
			else
				Cnt ++;
			if(inv(val[p]))
				ans = mul(ans, inv(val[p]));
			else
				Cnt --;
			val[p] = get_val(p);
			if(val[p])
				ans = mul(ans, val[p]);
			else
				Cnt ++;
		}
		else{
			int cnt = sz[v] - get(fenC, st[v], ed[v]);
			int sum = tag[v] - get(fenS, st[v], ed[v]);
			add(fenC, st[v], -cnt);
			add(fenS, st[v], -sum);
			add(fenC, st[p], cnt);
			add(fenS, st[p], sum);
			add(fenP, st[v] + 1, -1); add(fenP, ed[v] + 1, 1);
			if(inv(val[v]))
				ans = mul(ans, inv(val[v]));
			else
				Cnt --;
			val[v] = 1;
			if(inv(val[p]))
				ans = mul(ans, inv(val[p]));
			else
				Cnt --;
			val[p] = get_val(p);
			if(val[p])
				ans = mul(ans, val[p]);
			else
				Cnt ++;
			tag[v] = -1;
		}
		if(Cnt)
			cout << "0\n";
		else
			cout << ans << '\n';
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 45692 KB Output is correct
2 Correct 152 ms 45784 KB Output is correct
3 Correct 147 ms 45852 KB Output is correct
4 Correct 158 ms 45716 KB Output is correct
5 Correct 121 ms 41772 KB Output is correct
6 Correct 22 ms 14940 KB Output is correct
7 Correct 20 ms 14792 KB Output is correct
8 Correct 20 ms 14796 KB Output is correct
9 Correct 138 ms 38120 KB Output is correct
10 Correct 139 ms 38116 KB Output is correct
11 Correct 139 ms 38092 KB Output is correct
12 Correct 150 ms 36872 KB Output is correct
13 Correct 148 ms 43452 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 14420 KB Output is correct
2 Correct 19 ms 14392 KB Output is correct
3 Correct 20 ms 14552 KB Output is correct
4 Correct 20 ms 14452 KB Output is correct
5 Correct 19 ms 14436 KB Output is correct
6 Correct 22 ms 14660 KB Output is correct
7 Correct 23 ms 14696 KB Output is correct
8 Correct 24 ms 14676 KB Output is correct
9 Correct 23 ms 14848 KB Output is correct
10 Correct 24 ms 14832 KB Output is correct
11 Correct 22 ms 14932 KB Output is correct
12 Correct 20 ms 14868 KB Output is correct
13 Correct 23 ms 14832 KB Output is correct
14 Correct 23 ms 14796 KB Output is correct
15 Correct 22 ms 14964 KB Output is correct
16 Correct 22 ms 14764 KB Output is correct
17 Correct 26 ms 14900 KB Output is correct
18 Correct 22 ms 14572 KB Output is correct
19 Correct 26 ms 14860 KB Output is correct
20 Correct 21 ms 14620 KB Output is correct
21 Correct 21 ms 14724 KB Output is correct
22 Correct 22 ms 14484 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 47392 KB Output is correct
2 Correct 184 ms 47700 KB Output is correct
3 Correct 167 ms 48088 KB Output is correct
4 Correct 274 ms 48416 KB Output is correct
5 Correct 277 ms 45280 KB Output is correct
6 Correct 22 ms 15052 KB Output is correct
7 Correct 23 ms 14780 KB Output is correct
8 Correct 23 ms 14888 KB Output is correct
9 Correct 279 ms 41452 KB Output is correct
10 Correct 235 ms 41132 KB Output is correct
11 Correct 261 ms 41088 KB Output is correct
12 Correct 236 ms 40632 KB Output is correct
13 Correct 263 ms 57744 KB Output is correct
14 Correct 284 ms 57852 KB Output is correct
15 Correct 275 ms 57784 KB Output is correct
16 Correct 271 ms 57808 KB Output is correct
17 Correct 276 ms 57856 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 365 ms 42436 KB Output is correct
2 Correct 406 ms 42444 KB Output is correct
3 Correct 361 ms 42388 KB Output is correct
4 Correct 382 ms 42380 KB Output is correct
5 Correct 380 ms 41024 KB Output is correct
6 Correct 405 ms 42376 KB Output is correct
7 Correct 294 ms 29444 KB Output is correct
8 Correct 277 ms 29404 KB Output is correct
9 Correct 427 ms 42444 KB Output is correct
10 Correct 394 ms 42444 KB Output is correct
11 Correct 361 ms 42360 KB Output is correct
12 Correct 296 ms 29396 KB Output is correct
13 Correct 206 ms 27304 KB Output is correct
14 Correct 231 ms 27804 KB Output is correct
15 Correct 248 ms 27856 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 45692 KB Output is correct
2 Correct 152 ms 45784 KB Output is correct
3 Correct 147 ms 45852 KB Output is correct
4 Correct 158 ms 45716 KB Output is correct
5 Correct 121 ms 41772 KB Output is correct
6 Correct 22 ms 14940 KB Output is correct
7 Correct 20 ms 14792 KB Output is correct
8 Correct 20 ms 14796 KB Output is correct
9 Correct 138 ms 38120 KB Output is correct
10 Correct 139 ms 38116 KB Output is correct
11 Correct 139 ms 38092 KB Output is correct
12 Correct 150 ms 36872 KB Output is correct
13 Correct 148 ms 43452 KB Output is correct
14 Correct 19 ms 14420 KB Output is correct
15 Correct 19 ms 14392 KB Output is correct
16 Correct 20 ms 14552 KB Output is correct
17 Correct 20 ms 14452 KB Output is correct
18 Correct 19 ms 14436 KB Output is correct
19 Correct 22 ms 14660 KB Output is correct
20 Correct 23 ms 14696 KB Output is correct
21 Correct 24 ms 14676 KB Output is correct
22 Correct 23 ms 14848 KB Output is correct
23 Correct 24 ms 14832 KB Output is correct
24 Correct 22 ms 14932 KB Output is correct
25 Correct 20 ms 14868 KB Output is correct
26 Correct 23 ms 14832 KB Output is correct
27 Correct 23 ms 14796 KB Output is correct
28 Correct 22 ms 14964 KB Output is correct
29 Correct 22 ms 14764 KB Output is correct
30 Correct 26 ms 14900 KB Output is correct
31 Correct 22 ms 14572 KB Output is correct
32 Correct 26 ms 14860 KB Output is correct
33 Correct 21 ms 14620 KB Output is correct
34 Correct 21 ms 14724 KB Output is correct
35 Correct 22 ms 14484 KB Output is correct
36 Correct 164 ms 47392 KB Output is correct
37 Correct 184 ms 47700 KB Output is correct
38 Correct 167 ms 48088 KB Output is correct
39 Correct 274 ms 48416 KB Output is correct
40 Correct 277 ms 45280 KB Output is correct
41 Correct 22 ms 15052 KB Output is correct
42 Correct 23 ms 14780 KB Output is correct
43 Correct 23 ms 14888 KB Output is correct
44 Correct 279 ms 41452 KB Output is correct
45 Correct 235 ms 41132 KB Output is correct
46 Correct 261 ms 41088 KB Output is correct
47 Correct 236 ms 40632 KB Output is correct
48 Correct 263 ms 57744 KB Output is correct
49 Correct 284 ms 57852 KB Output is correct
50 Correct 275 ms 57784 KB Output is correct
51 Correct 271 ms 57808 KB Output is correct
52 Correct 276 ms 57856 KB Output is correct
53 Correct 365 ms 42436 KB Output is correct
54 Correct 406 ms 42444 KB Output is correct
55 Correct 361 ms 42388 KB Output is correct
56 Correct 382 ms 42380 KB Output is correct
57 Correct 380 ms 41024 KB Output is correct
58 Correct 405 ms 42376 KB Output is correct
59 Correct 294 ms 29444 KB Output is correct
60 Correct 277 ms 29404 KB Output is correct
61 Correct 427 ms 42444 KB Output is correct
62 Correct 394 ms 42444 KB Output is correct
63 Correct 361 ms 42360 KB Output is correct
64 Correct 296 ms 29396 KB Output is correct
65 Correct 206 ms 27304 KB Output is correct
66 Correct 231 ms 27804 KB Output is correct
67 Correct 248 ms 27856 KB Output is correct
68 Correct 21 ms 14420 KB Output is correct
69 Correct 24 ms 14420 KB Output is correct
70 Correct 510 ms 50160 KB Output is correct
71 Correct 522 ms 50000 KB Output is correct
72 Correct 553 ms 49980 KB Output is correct
73 Correct 556 ms 49984 KB Output is correct
74 Correct 583 ms 50048 KB Output is correct
75 Correct 522 ms 46128 KB Output is correct
76 Correct 350 ms 42336 KB Output is correct
77 Correct 403 ms 42436 KB Output is correct
78 Correct 445 ms 41320 KB Output is correct
79 Correct 497 ms 46188 KB Output is correct
80 Correct 509 ms 44852 KB Output is correct
81 Correct 475 ms 45892 KB Output is correct
82 Correct 326 ms 40092 KB Output is correct
83 Correct 325 ms 47564 KB Output is correct
84 Correct 404 ms 46764 KB Output is correct
85 Correct 381 ms 46780 KB Output is correct