oj.uz

Submission #464554

# Submission time Handle Problem Language Result Execution time Memory
464554 2021-08-13T12:13:23 Z Return_0 Sumtree (INOI20_sumtree) C++17
50 / 100
 608 ms 63028 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 {
	lol fen [N];
	fenwick () { memset(fen, 0, sizeof fen); }
	inline void add (ll i, const lol &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) { 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];
			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 167 ms 57292 KB Output is correct
2 Correct 156 ms 57300 KB Output is correct
3 Correct 162 ms 57284 KB Output is correct
4 Correct 230 ms 57352 KB Output is correct
5 Correct 144 ms 56276 KB Output is correct
6 Correct 20 ms 28148 KB Output is correct
7 Correct 23 ms 28100 KB Output is correct
8 Correct 24 ms 28148 KB Output is correct
9 Correct 190 ms 55436 KB Output is correct
10 Correct 165 ms 55364 KB Output is correct
11 Correct 197 ms 55420 KB Output is correct
12 Correct 173 ms 54084 KB Output is correct
13 Correct 163 ms 54556 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 21 ms 27644 KB Output is correct
3 Correct 23 ms 27736 KB Output is correct
4 Correct 19 ms 27660 KB Output is correct
5 Correct 21 ms 27860 KB Output is correct
6 Correct 23 ms 27984 KB Output is correct
7 Correct 24 ms 27980 KB Output is correct
8 Correct 22 ms 28032 KB Output is correct
9 Correct 25 ms 28248 KB Output is correct
10 Correct 24 ms 28236 KB Output is correct
11 Correct 25 ms 28304 KB Output is correct
12 Correct 21 ms 28228 KB Output is correct
13 Correct 24 ms 28228 KB Output is correct
14 Correct 24 ms 28176 KB Output is correct
15 Correct 24 ms 28244 KB Output is correct
16 Correct 24 ms 28236 KB Output is correct
17 Correct 24 ms 28248 KB Output is correct
18 Correct 23 ms 27980 KB Output is correct
19 Correct 25 ms 28168 KB Output is correct
20 Correct 24 ms 28060 KB Output is correct
21 Correct 22 ms 28096 KB Output is correct
22 Correct 20 ms 27808 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 58804 KB Output is correct
2 Correct 256 ms 59092 KB Output is correct
3 Correct 193 ms 58952 KB Output is correct
4 Correct 296 ms 59304 KB Output is correct
5 Correct 366 ms 58928 KB Output is correct
6 Correct 22 ms 28236 KB Output is correct
7 Correct 21 ms 28236 KB Output is correct
8 Correct 22 ms 28236 KB Output is correct
9 Correct 382 ms 57944 KB Output is correct
10 Correct 357 ms 57656 KB Output is correct
11 Correct 330 ms 57688 KB Output is correct
12 Correct 380 ms 57128 KB Output is correct
13 Correct 340 ms 63028 KB Output is correct
14 Correct 335 ms 62920 KB Output is correct
15 Correct 325 ms 62968 KB Output is correct
16 Correct 324 ms 62968 KB Output is correct
17 Correct 336 ms 62884 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 608 ms 58960 KB Output is correct
2 Correct 566 ms 58788 KB Output is correct
3 Correct 524 ms 58944 KB Output is correct
4 Correct 549 ms 59104 KB Output is correct
5 Correct 581 ms 57420 KB Output is correct
6 Correct 549 ms 59008 KB Output is correct
7 Correct 418 ms 44332 KB Output is correct
8 Correct 423 ms 44420 KB Output is correct
9 Correct 527 ms 58984 KB Output is correct
10 Correct 525 ms 59012 KB Output is correct
11 Correct 528 ms 59012 KB Output is correct
12 Correct 395 ms 44392 KB Output is correct
13 Incorrect 263 ms 42236 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 57292 KB Output is correct
2 Correct 156 ms 57300 KB Output is correct
3 Correct 162 ms 57284 KB Output is correct
4 Correct 230 ms 57352 KB Output is correct
5 Correct 144 ms 56276 KB Output is correct
6 Correct 20 ms 28148 KB Output is correct
7 Correct 23 ms 28100 KB Output is correct
8 Correct 24 ms 28148 KB Output is correct
9 Correct 190 ms 55436 KB Output is correct
10 Correct 165 ms 55364 KB Output is correct
11 Correct 197 ms 55420 KB Output is correct
12 Correct 173 ms 54084 KB Output is correct
13 Correct 163 ms 54556 KB Output is correct
14 Correct 19 ms 27724 KB Output is correct
15 Correct 21 ms 27644 KB Output is correct
16 Correct 23 ms 27736 KB Output is correct
17 Correct 19 ms 27660 KB Output is correct
18 Correct 21 ms 27860 KB Output is correct
19 Correct 23 ms 27984 KB Output is correct
20 Correct 24 ms 27980 KB Output is correct
21 Correct 22 ms 28032 KB Output is correct
22 Correct 25 ms 28248 KB Output is correct
23 Correct 24 ms 28236 KB Output is correct
24 Correct 25 ms 28304 KB Output is correct
25 Correct 21 ms 28228 KB Output is correct
26 Correct 24 ms 28228 KB Output is correct
27 Correct 24 ms 28176 KB Output is correct
28 Correct 24 ms 28244 KB Output is correct
29 Correct 24 ms 28236 KB Output is correct
30 Correct 24 ms 28248 KB Output is correct
31 Correct 23 ms 27980 KB Output is correct
32 Correct 25 ms 28168 KB Output is correct
33 Correct 24 ms 28060 KB Output is correct
34 Correct 22 ms 28096 KB Output is correct
35 Correct 20 ms 27808 KB Output is correct
36 Correct 176 ms 58804 KB Output is correct
37 Correct 256 ms 59092 KB Output is correct
38 Correct 193 ms 58952 KB Output is correct
39 Correct 296 ms 59304 KB Output is correct
40 Correct 366 ms 58928 KB Output is correct
41 Correct 22 ms 28236 KB Output is correct
42 Correct 21 ms 28236 KB Output is correct
43 Correct 22 ms 28236 KB Output is correct
44 Correct 382 ms 57944 KB Output is correct
45 Correct 357 ms 57656 KB Output is correct
46 Correct 330 ms 57688 KB Output is correct
47 Correct 380 ms 57128 KB Output is correct
48 Correct 340 ms 63028 KB Output is correct
49 Correct 335 ms 62920 KB Output is correct
50 Correct 325 ms 62968 KB Output is correct
51 Correct 324 ms 62968 KB Output is correct
52 Correct 336 ms 62884 KB Output is correct
53 Correct 608 ms 58960 KB Output is correct
54 Correct 566 ms 58788 KB Output is correct
55 Correct 524 ms 58944 KB Output is correct
56 Correct 549 ms 59104 KB Output is correct
57 Correct 581 ms 57420 KB Output is correct
58 Correct 549 ms 59008 KB Output is correct
59 Correct 418 ms 44332 KB Output is correct
60 Correct 423 ms 44420 KB Output is correct
61 Correct 527 ms 58984 KB Output is correct
62 Correct 525 ms 59012 KB Output is correct
63 Correct 528 ms 59012 KB Output is correct
64 Correct 395 ms 44392 KB Output is correct
65 Incorrect 263 ms 42236 KB Output isn't correct
66 Halted 0 ms 0 KB -