oj.uz

답안 #831578

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831578 2023-08-20T10:41:50 Z rainboy Sumtree (INOI20_sumtree) C
100 / 100
 408 ms 48028 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	200000
#define A	300000
#define N_	(1 << 18)	/* N_ = pow2(ceil(log2(N + 1))) */
#define MD	1000000007
#define INF	0x3f3f3f3f

int min(int a, int b) { return a < b ? a : b; }

int vv[A + N + 1], ff[A + N + 1], gg[A + N + 1];

void init() {
	int i;

	ff[0] = gg[0] = 1;
	for (i = 1; i <= A + N; i++) {
		vv[i] = i == 1 ? 1 : (long long) vv[i - MD % i] * (MD / i + 1) % MD;
		ff[i] = (long long) ff[i - 1] * i % MD;
		gg[i] = (long long) gg[i - 1] * vv[i] % MD;
	}
}

int choose(int n, int k) {
	return (long long) ff[n] * gg[k] % MD * gg[n - k] % MD;
}

int *ej[N], eo[N];

void append(int i, int j) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
	ej[i][o] = j;
}

int ta[N], tb[N], qu[N];

void dfs(int p, int i) {
	static int time;
	int o;

	qu[ta[i] = time++] = i;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p)
			dfs(i, j);
	}
	tb[i] = time;
}

int h_, n_;

int mn[N_ * 2]; int kk[N_ * 2]; long long ss[N_ * 2]; int lz[N_];

void put(int i, int x) {
	mn[i] += x;
	if (i < n_)
		lz[i] += x;
}

void pus(int i) {
	if (lz[i])
		put(i << 1 | 0, lz[i]), put(i << 1 | 1, lz[i]), lz[i] = 0;
}

void pul(int i) {
	if (!lz[i]) {
		int l = i << 1, r = l | 1;

		if (mn[l] < mn[r])
			mn[i] = mn[l], kk[i] = kk[l], ss[i] = ss[l];
		else if (mn[l] > mn[r])
			mn[i] = mn[r], kk[i] = kk[r], ss[i] = ss[r];
		else
			mn[i] = mn[l], kk[i] = kk[l] + kk[r], ss[i] = ss[l] + ss[r];
	}
}

void push(int i) {
	int h;

	for (h = h_; h > 0; h--)
		pus(i >> h);
}

void pull(int i) {
	while (i > 1)
		pul(i >>= 1);
}

void update(int l, int r, int x) {
	int l_, r_;

	if (l > r)
		return;
	l_ = l += n_, r_ = r += n_;
	push(l_), push(r_);
	for ( ; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			put(l++, x);
		if ((r & 1) == 0)
			put(r--, x);
	}
	pull(l_), pull(r_);
}

void upd(int i, int k, int s) {
	i += n_;
	push(i), kk[i] = k, ss[i] = s, pull(i);
}

int query(int l, int r, int *k_, long long *s_) {
	int x, k;
	long long s;

	if (l > r) {
		*k_ = 0, *s_ = 0;
		return INF;
	}
	push(l += n_), push(r += n_);
	x = INF, k = 0, s = 0;
	for ( ; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1) {
			if (x > mn[l])
				x = mn[l], k = 0, s = 0;
			if (x == mn[l])
				k += kk[l], s += ss[l];
			l++;
		}
		if ((r & 1) == 0) {
			if (x > mn[r])
				x = mn[r], k = 0, s = 0;
			if (x == mn[r])
				k += kk[r], s += ss[r];
			r--;
		}
	}
	*k_ = k, *s_ = s;
	return x;
}

int prev(int r) {
	int l, x;

	push(r += n_);
	x = mn[r];
	for (l = 0 + n_; l <= r; l >>= 1, r >>= 1)
		if ((r & 1) == 0) {
			if (mn[r] < x) {
				while (r < n_) {
					pus(r);
					r = mn[r << 1 | 1] < x ? r << 1 | 1 : r << 1 | 0;
				}
				return r - n_;
			}
			r--;
		}
	return -1;
}

int st[N_ * 2];

void pul_(int i) {
	st[i] = (long long) st[i << 1 | 0] * st[i << 1 | 1] % MD;
}

void update_(int i, int x) {
	st[i += n_] = x;
	while (i > 1)
		pul_(i >>= 1);
}

void build(int n) {
	int i;

	h_ = 0;
	while (1 << h_ <= n)
		h_++;
	n_ = 1 << h_;
	for (i = 0; i < n_; i++)
		st[n_ + i] = 1;
	for (i = n_ - 1; i > 0; i--)
		pul(i), pul_(i);
}

int main() {
	static int aa[N];
	int n, q, h, i, j, p;

	init();
	scanf("%d%d", &n, &aa[0]);
	for (i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (h = 0; h < n - 1; h++) {
		scanf("%d%d", &i, &j), i--, j--;
		append(i, j), append(j, i);
	}
	dfs(-1, 0);
	build(n);
	update(1, n - 1, 1), upd(0, n, aa[0]);
	update_(0, choose(aa[0] + n - 1, n - 1));
	scanf("%d", &q);
	printf("%d\n", st[1]);
	while (q--) {
		int t, k;
		long long s;

		scanf("%d%d", &t, &i), i--;
		if (t == 1) {
			scanf("%d", &aa[i]);
			update(ta[i] + 1, tb[i] - 1, 1), upd(ta[i], tb[i] - ta[i], aa[i]);
			query(ta[i] + 1, tb[i] - 1, &k, &s);
			update_(ta[i], aa[i] < s ? 0 : choose(aa[i] - s + tb[i] - ta[i] - k - 1, tb[i] - ta[i] - k - 1));
			p = qu[prev(ta[i])];
			query(ta[p] + 1, tb[p] - 1, &k, &s);
			update_(ta[p], aa[p] < s ? 0 : choose(aa[p] - s + tb[p] - ta[p] - k - 1, tb[p] - ta[p] - k - 1));
		} else {
			update(ta[i] + 1, tb[i] - 1, -1), upd(ta[i], 0, 0);
			update_(ta[i], 1);
			p = qu[prev(ta[i])];
			query(ta[p] + 1, tb[p] - 1, &k, &s);
			update_(ta[p], aa[p] < s ? 0 : choose(aa[p] - s + tb[p] - ta[p] - k - 1, tb[p] - ta[p] - k - 1));
		}
		printf("%d\n", st[1]);
	}
	return 0;
}

Compilation message

Main.c: In function 'append':
Main.c:34:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   34 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
Main.c: In function 'main':
Main.c:195:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  195 |  scanf("%d%d", &n, &aa[0]);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~
Main.c:199:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  199 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~
Main.c:206:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  206 |  scanf("%d", &q);
      |  ^~~~~~~~~~~~~~~
Main.c:212:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  212 |   scanf("%d%d", &t, &i), i--;
      |   ^~~~~~~~~~~~~~~~~~~~~
Main.c:214:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  214 |    scanf("%d", &aa[i]);
      |    ^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 29692 KB Output is correct
2 Correct 91 ms 29612 KB Output is correct
3 Correct 66 ms 29608 KB Output is correct
4 Correct 75 ms 29740 KB Output is correct
5 Correct 58 ms 26412 KB Output is correct
6 Correct 7 ms 6612 KB Output is correct
7 Correct 7 ms 6484 KB Output is correct
8 Correct 7 ms 6472 KB Output is correct
9 Correct 78 ms 23752 KB Output is correct
10 Correct 106 ms 23788 KB Output is correct
11 Correct 67 ms 23744 KB Output is correct
12 Correct 73 ms 23332 KB Output is correct
13 Correct 64 ms 28596 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 6100 KB Output is correct
2 Correct 7 ms 6220 KB Output is correct
3 Correct 7 ms 6172 KB Output is correct
4 Correct 7 ms 6204 KB Output is correct
5 Correct 8 ms 6296 KB Output is correct
6 Correct 9 ms 6436 KB Output is correct
7 Correct 9 ms 6432 KB Output is correct
8 Correct 9 ms 6452 KB Output is correct
9 Correct 10 ms 6656 KB Output is correct
10 Correct 10 ms 6612 KB Output is correct
11 Correct 10 ms 6688 KB Output is correct
12 Correct 8 ms 6560 KB Output is correct
13 Correct 11 ms 6568 KB Output is correct
14 Correct 11 ms 6564 KB Output is correct
15 Correct 12 ms 6812 KB Output is correct
16 Correct 10 ms 6612 KB Output is correct
17 Correct 10 ms 6560 KB Output is correct
18 Correct 9 ms 6380 KB Output is correct
19 Correct 10 ms 6612 KB Output is correct
20 Correct 8 ms 6356 KB Output is correct
21 Correct 9 ms 6392 KB Output is correct
22 Correct 7 ms 6172 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 33868 KB Output is correct
2 Correct 105 ms 36812 KB Output is correct
3 Correct 82 ms 36852 KB Output is correct
4 Correct 150 ms 37704 KB Output is correct
5 Correct 276 ms 36052 KB Output is correct
6 Correct 8 ms 6692 KB Output is correct
7 Correct 8 ms 6536 KB Output is correct
8 Correct 8 ms 6612 KB Output is correct
9 Correct 217 ms 32936 KB Output is correct
10 Correct 204 ms 32380 KB Output is correct
11 Correct 190 ms 32288 KB Output is correct
12 Correct 264 ms 32300 KB Output is correct
13 Correct 346 ms 47900 KB Output is correct
14 Correct 354 ms 48028 KB Output is correct
15 Correct 343 ms 47832 KB Output is correct
16 Correct 358 ms 47928 KB Output is correct
17 Correct 358 ms 47864 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 350 ms 30428 KB Output is correct
2 Correct 328 ms 34812 KB Output is correct
3 Correct 390 ms 34852 KB Output is correct
4 Correct 360 ms 34892 KB Output is correct
5 Correct 319 ms 33872 KB Output is correct
6 Correct 387 ms 34720 KB Output is correct
7 Correct 252 ms 22144 KB Output is correct
8 Correct 258 ms 22328 KB Output is correct
9 Correct 328 ms 34824 KB Output is correct
10 Correct 327 ms 34936 KB Output is correct
11 Correct 321 ms 35088 KB Output is correct
12 Correct 255 ms 22420 KB Output is correct
13 Correct 231 ms 19132 KB Output is correct
14 Correct 243 ms 20772 KB Output is correct
15 Correct 245 ms 20996 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 29692 KB Output is correct
2 Correct 91 ms 29612 KB Output is correct
3 Correct 66 ms 29608 KB Output is correct
4 Correct 75 ms 29740 KB Output is correct
5 Correct 58 ms 26412 KB Output is correct
6 Correct 7 ms 6612 KB Output is correct
7 Correct 7 ms 6484 KB Output is correct
8 Correct 7 ms 6472 KB Output is correct
9 Correct 78 ms 23752 KB Output is correct
10 Correct 106 ms 23788 KB Output is correct
11 Correct 67 ms 23744 KB Output is correct
12 Correct 73 ms 23332 KB Output is correct
13 Correct 64 ms 28596 KB Output is correct
14 Correct 7 ms 6100 KB Output is correct
15 Correct 7 ms 6220 KB Output is correct
16 Correct 7 ms 6172 KB Output is correct
17 Correct 7 ms 6204 KB Output is correct
18 Correct 8 ms 6296 KB Output is correct
19 Correct 9 ms 6436 KB Output is correct
20 Correct 9 ms 6432 KB Output is correct
21 Correct 9 ms 6452 KB Output is correct
22 Correct 10 ms 6656 KB Output is correct
23 Correct 10 ms 6612 KB Output is correct
24 Correct 10 ms 6688 KB Output is correct
25 Correct 8 ms 6560 KB Output is correct
26 Correct 11 ms 6568 KB Output is correct
27 Correct 11 ms 6564 KB Output is correct
28 Correct 12 ms 6812 KB Output is correct
29 Correct 10 ms 6612 KB Output is correct
30 Correct 10 ms 6560 KB Output is correct
31 Correct 9 ms 6380 KB Output is correct
32 Correct 10 ms 6612 KB Output is correct
33 Correct 8 ms 6356 KB Output is correct
34 Correct 9 ms 6392 KB Output is correct
35 Correct 7 ms 6172 KB Output is correct
36 Correct 93 ms 33868 KB Output is correct
37 Correct 105 ms 36812 KB Output is correct
38 Correct 82 ms 36852 KB Output is correct
39 Correct 150 ms 37704 KB Output is correct
40 Correct 276 ms 36052 KB Output is correct
41 Correct 8 ms 6692 KB Output is correct
42 Correct 8 ms 6536 KB Output is correct
43 Correct 8 ms 6612 KB Output is correct
44 Correct 217 ms 32936 KB Output is correct
45 Correct 204 ms 32380 KB Output is correct
46 Correct 190 ms 32288 KB Output is correct
47 Correct 264 ms 32300 KB Output is correct
48 Correct 346 ms 47900 KB Output is correct
49 Correct 354 ms 48028 KB Output is correct
50 Correct 343 ms 47832 KB Output is correct
51 Correct 358 ms 47928 KB Output is correct
52 Correct 358 ms 47864 KB Output is correct
53 Correct 350 ms 30428 KB Output is correct
54 Correct 328 ms 34812 KB Output is correct
55 Correct 390 ms 34852 KB Output is correct
56 Correct 360 ms 34892 KB Output is correct
57 Correct 319 ms 33872 KB Output is correct
58 Correct 387 ms 34720 KB Output is correct
59 Correct 252 ms 22144 KB Output is correct
60 Correct 258 ms 22328 KB Output is correct
61 Correct 328 ms 34824 KB Output is correct
62 Correct 327 ms 34936 KB Output is correct
63 Correct 321 ms 35088 KB Output is correct
64 Correct 255 ms 22420 KB Output is correct
65 Correct 231 ms 19132 KB Output is correct
66 Correct 243 ms 20772 KB Output is correct
67 Correct 245 ms 20996 KB Output is correct
68 Correct 7 ms 6228 KB Output is correct
69 Correct 6 ms 6228 KB Output is correct
70 Correct 393 ms 40996 KB Output is correct
71 Correct 377 ms 40996 KB Output is correct
72 Correct 396 ms 41048 KB Output is correct
73 Correct 408 ms 40948 KB Output is correct
74 Correct 404 ms 40816 KB Output is correct
75 Correct 399 ms 37720 KB Output is correct
76 Correct 332 ms 34868 KB Output is correct
77 Correct 318 ms 34732 KB Output is correct
78 Correct 398 ms 33780 KB Output is correct
79 Correct 374 ms 37848 KB Output is correct
80 Correct 404 ms 36828 KB Output is correct
81 Correct 389 ms 37548 KB Output is correct
82 Correct 298 ms 30888 KB Output is correct
83 Correct 277 ms 36060 KB Output is correct
84 Correct 298 ms 35580 KB Output is correct
85 Correct 282 ms 35412 KB Output is correct