oj.uz

답안 #999112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999112 2024-06-15T06:50:23 Z vjudge1 Sumtree (INOI20_sumtree) C++17
100 / 100
 1055 ms 164812 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int MXN = 1e6 + 5;
const int LOG = 20;
const int mod = 1e9 + 7;

struct FindUp
{
	int sz;
	vector<int> st;
	void init(int n)
	{
		sz = n;
		st.assign((n + 1) << 2, 0);
	}
	void add(int l, int r, int x, int lx, int rx, int val)
	{
		if (l > rx || r < lx) return;
		if (l >= lx && r <= rx)
		{
			st[x] += val;
			return;
		}
		int mid = (l + r) >> 1;
		add(l, mid, 2*x, lx, rx, val);
		add(mid + 1, r, 2*x + 1, lx, rx, val);
	}
	int get(int l, int r, int x, int ind)
	{
		if (l == r) return st[x];
		int mid = (l + r) >> 1;
		if (ind <= mid) return st[x] + get(l, mid, 2*x, ind);
		else return st[x] + get(mid + 1, r, 2*x + 1, ind);
	}
};
struct FindVAL
{
	int sz;
	vector<int> st;
	void init(int n)
	{
		sz = n;
		st.assign((n + 1) << 2, 0);
	}
	void add(int l, int r, int x, int ind, int val)
	{
		if (l == r)
		{
			st[x] += val;
			return;
		}
		int mid = (l + r) >> 1;
		if (ind <= mid) add(l, mid, 2*x, ind, val);
		else add(mid + 1, r, 2*x + 1, ind, val);
		st[x] = st[2*x] + st[2*x + 1];
	}
	int get(int l, int r, int x, int lx, int rx)
	{
		if (l > rx || r < lx) return 0;
		if (l >= lx && r <= rx) return st[x];
		int mid = (l + r) >> 1;
		return get(l, mid, 2*x, lx, rx) + get(mid + 1, r, 2*x + 1, lx, rx);
	}
};

int n, r;
vector<int> adj[MXN];
int f[MXN], tag[MXN];
int p[LOG][MXN], sz[MXN];
int in[MXN], out[MXN], tim;
FindUp stup;
FindVAL stsz, sts;
int res = 1, z = 0;

int pw(int a, int b, int c)
{
	a %= c;
	int res = 1;
	while (b)
	{
		if (b & 1) res = (res * a) % mod;
		a = (a * a) % mod;
		b >>= 1;
	}
	return res;
}

int nck(int n, int k)
{
	if (min(n, k) < 0 || k > n) return 0;
	return (f[n] * pw((f[n - k] * f[k]) % mod, mod - 2, mod)) % mod;
}

void dfs(int a)
{
	sz[a] = 1;
	in[a] = ++tim;
	for (int &v : adj[a])
	{
		if (v == p[0][a]) continue;
		p[0][v] = a;
		dfs(v);
		sz[a] += sz[v];
 	}
	out[a] = tim;
}

int getco(int u)
{
	// cout << u << ' ' << sz[u] << ' ' << stsz.get(1, n, 1, in[u] + 1, out[u]) << ' ' << tag[u] << ' ' << sts.get(1, n, 1, in[u] + 1, out[u]) << '\n';
	return nck(sz[u] - stsz.get(1, n, 1, in[u] + 1, out[u]) - 1 + tag[u] - sts.get(1, n, 1, in[u] + 1, out[u]), tag[u] - sts.get(1, n, 1, in[u] + 1, out[u]));
}

int invalid(int u)
{
	return (sts.get(1, n, 1, in[u] + 1, out[u]) > tag[u]);
}

int UP(int u)
{
	int x = stup.get(1, n, 1, in[u]);
	for (int i = LOG - 1; i >= 0; i--)
	{
		if (stup.get(1, n, 1, in[p[i][u]]) == x) u = p[i][u];
	}
	return u;
}


signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	f[0] = 1;
	for (int i = 1; i < MXN; i++) 
	{
		f[i] = (f[i - 1] * i) % mod;
		tag[i] = -1;
	}
	cin >> n >> r;
	for (int i = 1; i < n; i++)
	{
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	int q;
	cin >> q;
	tag[1] = r;
	p[0][1] = 1;
	dfs(1);
	for (int i = 1; i < LOG; i++) for (int j = 1; j <= n; j++) p[i][j] = p[i - 1][p[i - 1][j]];
	stup.init(n), stsz.init(n), sts.init(n);
	stup.add(1, n, 1, 1, n, 1);
	stsz.add(1, n, 1, in[1], 1);
	res = getco(1);
	cout << res << '\n';
	while (q--)
	{
		int t;
		cin >> t;
		if (t == 1)
		{
			int u, v;
			cin >> u >> v;
			int P = UP(u);
			int S = stsz.get(1, n, 1, in[u] + 1, out[u]);
			tag[u] = v;
			int ff = invalid(P);
			if (!ff) res = (res * pw(getco(P), mod - 2, mod)) % mod;
			else z--;
			stsz.add(1, n, 1, in[u], -S + sz[u]);
			stsz.add(1, n, 1, in[P], S - sz[u]);
			
			S = sts.get(1, n, 1, in[u] + 1, out[u]);
			sts.add(1, n, 1, in[u], -S + tag[u]);
			sts.add(1, n, 1, in[P], S - tag[u]);
			ff = invalid(P);
			if (!ff) res = (res * getco(P)) % mod;
			else z++;
			ff = invalid(u);
			if (!ff) res = (res * getco(u)) % mod;
			else z++;
			stup.add(1, n, 1, in[u], out[u], 1);
		}
		else
		{
			int u;
			cin >> u;
			stup.add(1, n, 1, in[u], out[u], -1);
			int P = UP(u);
			int S = stsz.get(1, n, 1, in[u] + 1, out[u]);
			int ff = invalid(P);
			if (!ff) res = (res * pw(getco(P), mod - 2, mod)) % mod;
			else z--;
			ff = invalid(u);
			if (!ff) res = (res * pw(getco(u), mod - 2, mod)) % mod;
			else z--;
			stsz.add(1, n, 1, in[u], S - sz[u]);
			stsz.add(1, n, 1, in[P], -S + sz[u]);

			S = sts.get(1, n, 1, in[u] + 1, out[u]);
			sts.add(1, n, 1, in[u], S - tag[u]);
			sts.add(1, n, 1, in[P], -S + tag[u]);
			ff = invalid(P);
			if (!ff) res = (res * getco(P)) % mod;
			else z++;

			tag[u] = -1;
		}
		if (z) cout << 0 << '\n';
		else cout << res << '\n';
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 154192 KB Output is correct
2 Correct 86 ms 153784 KB Output is correct
3 Correct 92 ms 153936 KB Output is correct
4 Correct 93 ms 153940 KB Output is correct
5 Correct 79 ms 150356 KB Output is correct
6 Correct 17 ms 88668 KB Output is correct
7 Correct 16 ms 88412 KB Output is correct
8 Correct 16 ms 88536 KB Output is correct
9 Correct 77 ms 149332 KB Output is correct
10 Correct 81 ms 149216 KB Output is correct
11 Correct 81 ms 149328 KB Output is correct
12 Correct 93 ms 146004 KB Output is correct
13 Correct 85 ms 149148 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 85848 KB Output is correct
2 Correct 15 ms 85996 KB Output is correct
3 Correct 15 ms 86084 KB Output is correct
4 Correct 15 ms 85852 KB Output is correct
5 Correct 17 ms 86108 KB Output is correct
6 Correct 20 ms 86364 KB Output is correct
7 Correct 22 ms 86364 KB Output is correct
8 Correct 19 ms 86236 KB Output is correct
9 Correct 23 ms 88408 KB Output is correct
10 Correct 24 ms 88408 KB Output is correct
11 Correct 23 ms 88412 KB Output is correct
12 Correct 16 ms 88412 KB Output is correct
13 Correct 25 ms 88576 KB Output is correct
14 Correct 23 ms 88416 KB Output is correct
15 Correct 23 ms 88668 KB Output is correct
16 Correct 22 ms 88432 KB Output is correct
17 Correct 24 ms 88456 KB Output is correct
18 Correct 21 ms 86108 KB Output is correct
19 Correct 22 ms 88412 KB Output is correct
20 Correct 19 ms 86364 KB Output is correct
21 Correct 18 ms 86360 KB Output is correct
22 Correct 16 ms 85980 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 153580 KB Output is correct
2 Correct 180 ms 153692 KB Output is correct
3 Correct 125 ms 154068 KB Output is correct
4 Correct 297 ms 154304 KB Output is correct
5 Correct 531 ms 151636 KB Output is correct
6 Correct 18 ms 88664 KB Output is correct
7 Correct 17 ms 88412 KB Output is correct
8 Correct 19 ms 88576 KB Output is correct
9 Correct 490 ms 150296 KB Output is correct
10 Correct 400 ms 147028 KB Output is correct
11 Correct 364 ms 147028 KB Output is correct
12 Correct 355 ms 146500 KB Output is correct
13 Correct 516 ms 162248 KB Output is correct
14 Correct 492 ms 164812 KB Output is correct
15 Correct 484 ms 118752 KB Output is correct
16 Correct 516 ms 118812 KB Output is correct
17 Correct 488 ms 118860 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 715 ms 104048 KB Output is correct
2 Correct 728 ms 103508 KB Output is correct
3 Correct 708 ms 104016 KB Output is correct
4 Correct 731 ms 104016 KB Output is correct
5 Correct 721 ms 101844 KB Output is correct
6 Correct 697 ms 104020 KB Output is correct
7 Correct 603 ms 72784 KB Output is correct
8 Correct 690 ms 74176 KB Output is correct
9 Correct 768 ms 104020 KB Output is correct
10 Correct 703 ms 103808 KB Output is correct
11 Correct 672 ms 105296 KB Output is correct
12 Correct 597 ms 74068 KB Output is correct
13 Correct 334 ms 72528 KB Output is correct
14 Correct 391 ms 72548 KB Output is correct
15 Correct 448 ms 71252 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 154192 KB Output is correct
2 Correct 86 ms 153784 KB Output is correct
3 Correct 92 ms 153936 KB Output is correct
4 Correct 93 ms 153940 KB Output is correct
5 Correct 79 ms 150356 KB Output is correct
6 Correct 17 ms 88668 KB Output is correct
7 Correct 16 ms 88412 KB Output is correct
8 Correct 16 ms 88536 KB Output is correct
9 Correct 77 ms 149332 KB Output is correct
10 Correct 81 ms 149216 KB Output is correct
11 Correct 81 ms 149328 KB Output is correct
12 Correct 93 ms 146004 KB Output is correct
13 Correct 85 ms 149148 KB Output is correct
14 Correct 15 ms 85848 KB Output is correct
15 Correct 15 ms 85996 KB Output is correct
16 Correct 15 ms 86084 KB Output is correct
17 Correct 15 ms 85852 KB Output is correct
18 Correct 17 ms 86108 KB Output is correct
19 Correct 20 ms 86364 KB Output is correct
20 Correct 22 ms 86364 KB Output is correct
21 Correct 19 ms 86236 KB Output is correct
22 Correct 23 ms 88408 KB Output is correct
23 Correct 24 ms 88408 KB Output is correct
24 Correct 23 ms 88412 KB Output is correct
25 Correct 16 ms 88412 KB Output is correct
26 Correct 25 ms 88576 KB Output is correct
27 Correct 23 ms 88416 KB Output is correct
28 Correct 23 ms 88668 KB Output is correct
29 Correct 22 ms 88432 KB Output is correct
30 Correct 24 ms 88456 KB Output is correct
31 Correct 21 ms 86108 KB Output is correct
32 Correct 22 ms 88412 KB Output is correct
33 Correct 19 ms 86364 KB Output is correct
34 Correct 18 ms 86360 KB Output is correct
35 Correct 16 ms 85980 KB Output is correct
36 Correct 128 ms 153580 KB Output is correct
37 Correct 180 ms 153692 KB Output is correct
38 Correct 125 ms 154068 KB Output is correct
39 Correct 297 ms 154304 KB Output is correct
40 Correct 531 ms 151636 KB Output is correct
41 Correct 18 ms 88664 KB Output is correct
42 Correct 17 ms 88412 KB Output is correct
43 Correct 19 ms 88576 KB Output is correct
44 Correct 490 ms 150296 KB Output is correct
45 Correct 400 ms 147028 KB Output is correct
46 Correct 364 ms 147028 KB Output is correct
47 Correct 355 ms 146500 KB Output is correct
48 Correct 516 ms 162248 KB Output is correct
49 Correct 492 ms 164812 KB Output is correct
50 Correct 484 ms 118752 KB Output is correct
51 Correct 516 ms 118812 KB Output is correct
52 Correct 488 ms 118860 KB Output is correct
53 Correct 715 ms 104048 KB Output is correct
54 Correct 728 ms 103508 KB Output is correct
55 Correct 708 ms 104016 KB Output is correct
56 Correct 731 ms 104016 KB Output is correct
57 Correct 721 ms 101844 KB Output is correct
58 Correct 697 ms 104020 KB Output is correct
59 Correct 603 ms 72784 KB Output is correct
60 Correct 690 ms 74176 KB Output is correct
61 Correct 768 ms 104020 KB Output is correct
62 Correct 703 ms 103808 KB Output is correct
63 Correct 672 ms 105296 KB Output is correct
64 Correct 597 ms 74068 KB Output is correct
65 Correct 334 ms 72528 KB Output is correct
66 Correct 391 ms 72548 KB Output is correct
67 Correct 448 ms 71252 KB Output is correct
68 Correct 13 ms 39768 KB Output is correct
69 Correct 15 ms 39772 KB Output is correct
70 Correct 966 ms 113240 KB Output is correct
71 Correct 1055 ms 113064 KB Output is correct
72 Correct 881 ms 160596 KB Output is correct
73 Correct 871 ms 160596 KB Output is correct
74 Correct 1020 ms 160336 KB Output is correct
75 Correct 920 ms 157904 KB Output is correct
76 Correct 576 ms 155732 KB Output is correct
77 Correct 615 ms 155728 KB Output is correct
78 Correct 702 ms 154708 KB Output is correct
79 Correct 945 ms 158176 KB Output is correct
80 Correct 1020 ms 154452 KB Output is correct
81 Correct 940 ms 157780 KB Output is correct
82 Correct 373 ms 154380 KB Output is correct
83 Correct 532 ms 157008 KB Output is correct
84 Correct 505 ms 156244 KB Output is correct
85 Correct 510 ms 159064 KB Output is correct