oj.uz

Submission #464301

# Submission time Handle Problem Language Result Execution time Memory
464301 2021-08-12T19:33:31 Z Return_0 Sumtree (INOI20_sumtree) C++17
50 / 100
 614 ms 64452 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long long lol;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

const lol inf = sizeof(lol) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 5e5 + 7;

inline lol bpow (lol x, ll n) { lol t = 1; for (; n; n >>= 1, x = x * x % mod) if (n & 1) t = t * x % mod; return t; }
inline lol Inv (cl &x) { return bpow(x, mod - 2); }

lol f [N], inv [N], ans;
ll tin [N], tout [N], rtin [N], c [N], sz [N], n, r, q, zero, T;
vector <ll> adj [N];

void DFS (cl &v = 1, cl &pr = 0) {
	rtin[tin[v] = ++T] = v;
	for (auto &u : adj[v]) if (u != pr) DFS(u, v);
	tout[v] = T;
}

struct segtree {
	ll l, r, mx;
	segtree *lt, *rt;
	inline segtree (cl &L = 1, cl &R = N - 2) : l(L), r(R), mx(0) {}

	void build () {
		if (l == r) return;
		lt = new segtree (l, mid);
		rt = new segtree (mid + 1, r);
		lt->build();
		rt->build();
	}

	void upd (cl &pos, cl &x) {
		if (l == r) { mx = x; return; }
		if (pos <= lt->r) lt->upd(pos, x);
		else rt->upd(pos, x);
		mx = max(lt->mx, rt->mx);
	}

	ll ask (cl &qr, cl &x) {
		if (qr < l || mx < x) return 0;
		if (l == r) return l;
		if (r <= qr) {
			if (rt->mx >= x) return rt->ask(qr, x);
			return lt->ask(qr, x);
		}
		ll p = rt->ask(qr, x);
		if (!p) p = lt->ask(qr, x);
		return p;
	}
} seg;

struct fenwick {
	ll fen [N];
	fenwick () { memset(fen, 0, sizeof fen); }
	inline void add (ll i, cl &x) { for (; i < N; i += i & -i) fen[i] += x; }
	inline ll ask (ll l, ll r) {
		ll ret = 0;
		for (; r; r -= r & -r) ret += fen[r];
		for (l--; l; l -= l & -l) ret -= fen[l];
		return ret;
	}
} fen, fen2;

inline lol nCr (cl &n, cl &r) { while(r < 0 || n < r); return f[n] * inv[r] % mod * inv[n - r] % mod; }

int main ()
{
	cin.tie(0)->sync_with_stdio(false);

	f[0] = 1; for (lol i = 1; i < N; i++) f[i] = f[i - 1] * i % mod;
	inv[N - 1] = Inv(f[N - 1]); for (lol i = N; --i;) inv[i - 1] = inv[i] * i % mod;

	cin>> n >> r;
	for (ll v, u, i = 1; i < n; i++) {
		cin>> v >> u;
		adj[v].push_back(u); adj[u].push_back(v);
	}

	DFS();
	seg.r = n; seg.build();
	seg.upd(tin[1], tout[1]);
	c[1] = r; sz[1] = n;
	fen.add(tin[1], c[1]);
	fen2.add(tin[1], sz[1]);
	ans = nCr(c[1] + sz[1] - 1, sz[1] - 1);
	cout<< ans << '\n';

	cin>> q;
	for (ll tp, v; q--;) {
		cin>> tp >> v;
		if (tp == 1) {
			cin>> c[v];
			ll tot = fen.ask(tin[v], tout[v]);
			if (tot > c[v]) c[v] = -1, zero++;
			else {
				c[v] -= tot;
				ll par = rtin[seg.ask(tin[v], tout[v])];
				if (c[v] > c[par]) c[v] = -1, zero++;
				else {
					(ans *= Inv(nCr(c[par] + sz[par] - 1, sz[par] - 1))) %= mod;
					sz[v] = tout[v] - tin[v] + 1 - fen2.ask(tin[v], tout[v]);
					sz[par] -= sz[v];
					fen2.add(tin[par], -sz[v]);
					fen2.add(tin[v], sz[v]);
					c[par] -= c[v];
					fen.add(tin[par], -c[v]);
					fen.add(tin[v], c[v]);
					(ans *= nCr(c[par] + sz[par] - 1, sz[par] - 1)) %= mod;
					(ans *= nCr(c[v] + sz[v] - 1, sz[v] - 1)) %= mod;
					seg.upd(tin[v], tout[v]);
				}
			}
		} else {
			if (!~c[v]) c[v] = 0, zero--;
			else {
				seg.upd(tin[v], 0);
				ll par = rtin[seg.ask(tin[v], tout[v])];
				(ans *= Inv(nCr(c[par] + sz[par] - 1, sz[par] - 1))) %= mod;
				(ans *= Inv(nCr(c[v] + sz[v] - 1, sz[v] - 1))) %= mod;
				sz[par] += sz[v];
				fen2.add(tin[par], sz[v]);
				fen2.add(tin[v], -sz[v]);
				c[par] += c[v];
				fen.add(tin[par], c[v]);
				fen.add(tin[v], -c[v]);
				(ans *= nCr(c[par] + sz[par] - 1, sz[par] - 1)) %= mod;
			}
		}

		cout<< (zero ? 0LL : ans) << '\n';
	}

	cerr<< "\n" __TIMESTAMP__ " - Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
3 2
1 2
2 3
2
1 2 1
2 2

*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 53316 KB Output is correct
2 Correct 148 ms 53312 KB Output is correct
3 Correct 151 ms 53344 KB Output is correct
4 Correct 152 ms 53324 KB Output is correct
5 Correct 145 ms 52184 KB Output is correct
6 Correct 19 ms 24208 KB Output is correct
7 Correct 19 ms 24140 KB Output is correct
8 Correct 20 ms 24152 KB Output is correct
9 Correct 175 ms 51388 KB Output is correct
10 Correct 166 ms 51280 KB Output is correct
11 Correct 147 ms 51440 KB Output is correct
12 Correct 165 ms 49964 KB Output is correct
13 Correct 141 ms 50492 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23748 KB Output is correct
2 Correct 21 ms 23900 KB Output is correct
3 Correct 18 ms 23792 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 19 ms 23944 KB Output is correct
6 Correct 21 ms 24140 KB Output is correct
7 Correct 20 ms 24140 KB Output is correct
8 Correct 20 ms 24072 KB Output is correct
9 Correct 22 ms 24296 KB Output is correct
10 Correct 23 ms 24368 KB Output is correct
11 Correct 22 ms 24316 KB Output is correct
12 Correct 19 ms 24328 KB Output is correct
13 Correct 23 ms 24344 KB Output is correct
14 Correct 23 ms 24268 KB Output is correct
15 Correct 23 ms 24392 KB Output is correct
16 Correct 23 ms 24268 KB Output is correct
17 Correct 24 ms 24428 KB Output is correct
18 Correct 22 ms 24064 KB Output is correct
19 Correct 25 ms 24248 KB Output is correct
20 Correct 20 ms 24140 KB Output is correct
21 Correct 19 ms 24140 KB Output is correct
22 Correct 18 ms 23808 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 54724 KB Output is correct
2 Correct 213 ms 57652 KB Output is correct
3 Correct 174 ms 57508 KB Output is correct
4 Correct 267 ms 58180 KB Output is correct
5 Correct 375 ms 58688 KB Output is correct
6 Correct 20 ms 24260 KB Output is correct
7 Correct 19 ms 24224 KB Output is correct
8 Correct 20 ms 24300 KB Output is correct
9 Correct 390 ms 57424 KB Output is correct
10 Correct 334 ms 56948 KB Output is correct
11 Correct 323 ms 56764 KB Output is correct
12 Correct 218 ms 56112 KB Output is correct
13 Correct 400 ms 64452 KB Output is correct
14 Correct 407 ms 64316 KB Output is correct
15 Correct 407 ms 64424 KB Output is correct
16 Correct 398 ms 64324 KB Output is correct
17 Correct 398 ms 64396 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 55000 KB Output is correct
2 Correct 567 ms 59244 KB Output is correct
3 Correct 576 ms 59396 KB Output is correct
4 Correct 614 ms 59328 KB Output is correct
5 Correct 536 ms 57604 KB Output is correct
6 Correct 564 ms 59312 KB Output is correct
7 Correct 497 ms 43388 KB Output is correct
8 Correct 446 ms 43364 KB Output is correct
9 Correct 589 ms 59464 KB Output is correct
10 Correct 534 ms 59548 KB Output is correct
11 Correct 523 ms 59552 KB Output is correct
12 Correct 429 ms 43532 KB Output is correct
13 Incorrect 254 ms 41356 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 53316 KB Output is correct
2 Correct 148 ms 53312 KB Output is correct
3 Correct 151 ms 53344 KB Output is correct
4 Correct 152 ms 53324 KB Output is correct
5 Correct 145 ms 52184 KB Output is correct
6 Correct 19 ms 24208 KB Output is correct
7 Correct 19 ms 24140 KB Output is correct
8 Correct 20 ms 24152 KB Output is correct
9 Correct 175 ms 51388 KB Output is correct
10 Correct 166 ms 51280 KB Output is correct
11 Correct 147 ms 51440 KB Output is correct
12 Correct 165 ms 49964 KB Output is correct
13 Correct 141 ms 50492 KB Output is correct
14 Correct 18 ms 23748 KB Output is correct
15 Correct 21 ms 23900 KB Output is correct
16 Correct 18 ms 23792 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 19 ms 23944 KB Output is correct
19 Correct 21 ms 24140 KB Output is correct
20 Correct 20 ms 24140 KB Output is correct
21 Correct 20 ms 24072 KB Output is correct
22 Correct 22 ms 24296 KB Output is correct
23 Correct 23 ms 24368 KB Output is correct
24 Correct 22 ms 24316 KB Output is correct
25 Correct 19 ms 24328 KB Output is correct
26 Correct 23 ms 24344 KB Output is correct
27 Correct 23 ms 24268 KB Output is correct
28 Correct 23 ms 24392 KB Output is correct
29 Correct 23 ms 24268 KB Output is correct
30 Correct 24 ms 24428 KB Output is correct
31 Correct 22 ms 24064 KB Output is correct
32 Correct 25 ms 24248 KB Output is correct
33 Correct 20 ms 24140 KB Output is correct
34 Correct 19 ms 24140 KB Output is correct
35 Correct 18 ms 23808 KB Output is correct
36 Correct 173 ms 54724 KB Output is correct
37 Correct 213 ms 57652 KB Output is correct
38 Correct 174 ms 57508 KB Output is correct
39 Correct 267 ms 58180 KB Output is correct
40 Correct 375 ms 58688 KB Output is correct
41 Correct 20 ms 24260 KB Output is correct
42 Correct 19 ms 24224 KB Output is correct
43 Correct 20 ms 24300 KB Output is correct
44 Correct 390 ms 57424 KB Output is correct
45 Correct 334 ms 56948 KB Output is correct
46 Correct 323 ms 56764 KB Output is correct
47 Correct 218 ms 56112 KB Output is correct
48 Correct 400 ms 64452 KB Output is correct
49 Correct 407 ms 64316 KB Output is correct
50 Correct 407 ms 64424 KB Output is correct
51 Correct 398 ms 64324 KB Output is correct
52 Correct 398 ms 64396 KB Output is correct
53 Correct 561 ms 55000 KB Output is correct
54 Correct 567 ms 59244 KB Output is correct
55 Correct 576 ms 59396 KB Output is correct
56 Correct 614 ms 59328 KB Output is correct
57 Correct 536 ms 57604 KB Output is correct
58 Correct 564 ms 59312 KB Output is correct
59 Correct 497 ms 43388 KB Output is correct
60 Correct 446 ms 43364 KB Output is correct
61 Correct 589 ms 59464 KB Output is correct
62 Correct 534 ms 59548 KB Output is correct
63 Correct 523 ms 59552 KB Output is correct
64 Correct 429 ms 43532 KB Output is correct
65 Incorrect 254 ms 41356 KB Output isn't correct
66 Halted 0 ms 0 KB -