oj.uz

Submission #464556

# Submission time Handle Problem Language Result Execution time Memory
464556 2021-08-13T12:15:41 Z Return_0 Sumtree (INOI20_sumtree) C++17
50 / 100
 591 ms 66844 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 long long ll;
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 ll inf = sizeof(ll) == 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 ll bpow (ll x, ll n) { ll t = 1; for (; n; n >>= 1, x = x * x % mod) if (n & 1) t = t * x % mod; return t; }
inline ll Inv (cl &x) { return bpow(x, mod - 2); }

ll 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 ll nCr (cl &n, cl &r) { return f[n] * inv[r] % mod * inv[n - r] % mod; }

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

	f[0] = 1; for (ll i = 1; i < N; i++) f[i] = f[i - 1] * i % mod;
	inv[N - 1] = Inv(f[N - 1]); for (ll 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];
			c[v] -= fen.ask(tin[v], tout[v]);
			ll par = rtin[seg.ask(tin[v], tout[v])];
			
			if (c[par] >= 0) (ans *= Inv(nCr(c[par] + sz[par] - 1, sz[par] - 1))) %= mod;
			else zero--;

			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]);
			
			if (c[par] >= 0) (ans *= nCr(c[par] + sz[par] - 1, sz[par] - 1)) %= mod;
			else zero++;

			if (c[v] >= 0) (ans *= nCr(c[v] + sz[v] - 1, sz[v] - 1)) %= mod;
			else zero++;

			seg.upd(tin[v], tout[v]);
		} else {
			seg.upd(tin[v], 0);
			ll par = rtin[seg.ask(tin[v], tout[v])];
			
			if (c[par] >= 0) (ans *= Inv(nCr(c[par] + sz[par] - 1, sz[par] - 1))) %= mod;
			else zero--;

			if (c[v] >= 0) (ans *= Inv(nCr(c[v] + sz[v] - 1, sz[v] - 1))) %= mod;
			else zero--;

			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]);
			
			if (c[v] >= 0) (ans *= nCr(c[par] + sz[par] - 1, sz[par] - 1)) %= mod;
			else zero++;
		}

		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 60612 KB Output is correct
2 Correct 168 ms 60620 KB Output is correct
3 Correct 175 ms 60556 KB Output is correct
4 Correct 168 ms 60652 KB Output is correct
5 Correct 145 ms 58516 KB Output is correct
6 Correct 20 ms 28236 KB Output is correct
7 Correct 20 ms 28196 KB Output is correct
8 Correct 23 ms 28160 KB Output is correct
9 Correct 175 ms 58632 KB Output is correct
10 Correct 172 ms 58460 KB Output is correct
11 Correct 165 ms 58652 KB Output is correct
12 Correct 165 ms 57032 KB Output is correct
13 Correct 146 ms 57496 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27724 KB Output is correct
2 Correct 19 ms 27724 KB Output is correct
3 Correct 19 ms 27744 KB Output is correct
4 Correct 21 ms 27620 KB Output is correct
5 Correct 33 ms 27716 KB Output is correct
6 Correct 21 ms 28108 KB Output is correct
7 Correct 22 ms 28108 KB Output is correct
8 Correct 22 ms 28096 KB Output is correct
9 Correct 24 ms 28256 KB Output is correct
10 Correct 24 ms 28320 KB Output is correct
11 Correct 24 ms 28192 KB Output is correct
12 Correct 21 ms 28184 KB Output is correct
13 Correct 25 ms 28268 KB Output is correct
14 Correct 24 ms 28272 KB Output is correct
15 Correct 26 ms 28228 KB Output is correct
16 Correct 24 ms 28268 KB Output is correct
17 Correct 28 ms 28244 KB Output is correct
18 Correct 22 ms 27852 KB Output is correct
19 Correct 24 ms 28268 KB Output is correct
20 Correct 25 ms 27976 KB Output is correct
21 Correct 22 ms 27980 KB Output is correct
22 Correct 20 ms 27724 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 63648 KB Output is correct
2 Correct 212 ms 63836 KB Output is correct
3 Correct 188 ms 63800 KB Output is correct
4 Correct 263 ms 64200 KB Output is correct
5 Correct 383 ms 62696 KB Output is correct
6 Correct 22 ms 28284 KB Output is correct
7 Correct 20 ms 28148 KB Output is correct
8 Correct 22 ms 28220 KB Output is correct
9 Correct 413 ms 62756 KB Output is correct
10 Correct 348 ms 62400 KB Output is correct
11 Correct 333 ms 62472 KB Output is correct
12 Correct 366 ms 61988 KB Output is correct
13 Correct 326 ms 66764 KB Output is correct
14 Correct 337 ms 66844 KB Output is correct
15 Correct 322 ms 66764 KB Output is correct
16 Correct 338 ms 66724 KB Output is correct
17 Correct 328 ms 66748 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 579 ms 63796 KB Output is correct
2 Correct 567 ms 63524 KB Output is correct
3 Correct 557 ms 63824 KB Output is correct
4 Correct 544 ms 63732 KB Output is correct
5 Correct 544 ms 61824 KB Output is correct
6 Correct 591 ms 63776 KB Output is correct
7 Correct 430 ms 46660 KB Output is correct
8 Correct 438 ms 46660 KB Output is correct
9 Correct 577 ms 63756 KB Output is correct
10 Correct 531 ms 63788 KB Output is correct
11 Correct 519 ms 63792 KB Output is correct
12 Correct 416 ms 46736 KB Output is correct
13 Incorrect 281 ms 43652 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 60612 KB Output is correct
2 Correct 168 ms 60620 KB Output is correct
3 Correct 175 ms 60556 KB Output is correct
4 Correct 168 ms 60652 KB Output is correct
5 Correct 145 ms 58516 KB Output is correct
6 Correct 20 ms 28236 KB Output is correct
7 Correct 20 ms 28196 KB Output is correct
8 Correct 23 ms 28160 KB Output is correct
9 Correct 175 ms 58632 KB Output is correct
10 Correct 172 ms 58460 KB Output is correct
11 Correct 165 ms 58652 KB Output is correct
12 Correct 165 ms 57032 KB Output is correct
13 Correct 146 ms 57496 KB Output is correct
14 Correct 19 ms 27724 KB Output is correct
15 Correct 19 ms 27724 KB Output is correct
16 Correct 19 ms 27744 KB Output is correct
17 Correct 21 ms 27620 KB Output is correct
18 Correct 33 ms 27716 KB Output is correct
19 Correct 21 ms 28108 KB Output is correct
20 Correct 22 ms 28108 KB Output is correct
21 Correct 22 ms 28096 KB Output is correct
22 Correct 24 ms 28256 KB Output is correct
23 Correct 24 ms 28320 KB Output is correct
24 Correct 24 ms 28192 KB Output is correct
25 Correct 21 ms 28184 KB Output is correct
26 Correct 25 ms 28268 KB Output is correct
27 Correct 24 ms 28272 KB Output is correct
28 Correct 26 ms 28228 KB Output is correct
29 Correct 24 ms 28268 KB Output is correct
30 Correct 28 ms 28244 KB Output is correct
31 Correct 22 ms 27852 KB Output is correct
32 Correct 24 ms 28268 KB Output is correct
33 Correct 25 ms 27976 KB Output is correct
34 Correct 22 ms 27980 KB Output is correct
35 Correct 20 ms 27724 KB Output is correct
36 Correct 181 ms 63648 KB Output is correct
37 Correct 212 ms 63836 KB Output is correct
38 Correct 188 ms 63800 KB Output is correct
39 Correct 263 ms 64200 KB Output is correct
40 Correct 383 ms 62696 KB Output is correct
41 Correct 22 ms 28284 KB Output is correct
42 Correct 20 ms 28148 KB Output is correct
43 Correct 22 ms 28220 KB Output is correct
44 Correct 413 ms 62756 KB Output is correct
45 Correct 348 ms 62400 KB Output is correct
46 Correct 333 ms 62472 KB Output is correct
47 Correct 366 ms 61988 KB Output is correct
48 Correct 326 ms 66764 KB Output is correct
49 Correct 337 ms 66844 KB Output is correct
50 Correct 322 ms 66764 KB Output is correct
51 Correct 338 ms 66724 KB Output is correct
52 Correct 328 ms 66748 KB Output is correct
53 Correct 579 ms 63796 KB Output is correct
54 Correct 567 ms 63524 KB Output is correct
55 Correct 557 ms 63824 KB Output is correct
56 Correct 544 ms 63732 KB Output is correct
57 Correct 544 ms 61824 KB Output is correct
58 Correct 591 ms 63776 KB Output is correct
59 Correct 430 ms 46660 KB Output is correct
60 Correct 438 ms 46660 KB Output is correct
61 Correct 577 ms 63756 KB Output is correct
62 Correct 531 ms 63788 KB Output is correct
63 Correct 519 ms 63792 KB Output is correct
64 Correct 416 ms 46736 KB Output is correct
65 Incorrect 281 ms 43652 KB Output isn't correct
66 Halted 0 ms 0 KB -