oj.uz

Submission #464561

# Submission time Handle Problem Language Result Execution time Memory
464561 2021-08-13T12:27:28 Z Return_0 Sumtree (INOI20_sumtree) C++17
30 / 100
 656 ms 122176 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; }

inline void obd (cl &x) { if (!x) zero++; else (ans *= x) %= mod; } // mul
inline void OBD (cl &x) { if (!x) zero--; else (ans *= x) %= mod; } // div

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])];
			OBD(Inv(nCr(c[par] + sz[par] - 1, sz[par] - 1)));
			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]);
			obd(nCr(c[par] + sz[par] - 1, sz[par] - 1));
			obd(nCr(c[v] + sz[v] - 1, sz[v] - 1));
			seg.upd(tin[v], tout[v]);
		} else {
			seg.upd(tin[v], 0);
			ll par = rtin[seg.ask(tin[v], tout[v])];
			OBD(Inv(nCr(c[par] + sz[par] - 1, sz[par] - 1)));
			OBD(Inv(nCr(c[v] + sz[v] - 1, sz[v] - 1)));
			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]);
			obd(nCr(c[par] + sz[par] - 1, sz[par] - 1));
		}

		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 168 ms 60548 KB Output is correct
2 Correct 163 ms 60588 KB Output is correct
3 Correct 164 ms 60580 KB Output is correct
4 Correct 189 ms 60532 KB Output is correct
5 Correct 164 ms 58436 KB Output is correct
6 Correct 21 ms 28152 KB Output is correct
7 Correct 21 ms 28172 KB Output is correct
8 Correct 20 ms 28108 KB Output is correct
9 Correct 182 ms 58712 KB Output is correct
10 Correct 166 ms 58448 KB Output is correct
11 Correct 168 ms 58632 KB Output is correct
12 Correct 161 ms 57028 KB Output is correct
13 Correct 160 ms 57500 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 27648 KB Output is correct
2 Correct 19 ms 27672 KB Output is correct
3 Correct 19 ms 27724 KB Output is correct
4 Correct 19 ms 27724 KB Output is correct
5 Correct 22 ms 27764 KB Output is correct
6 Correct 23 ms 28064 KB Output is correct
7 Correct 22 ms 28108 KB Output is correct
8 Correct 22 ms 28100 KB Output is correct
9 Correct 25 ms 28272 KB Output is correct
10 Correct 25 ms 28280 KB Output is correct
11 Correct 24 ms 28280 KB Output is correct
12 Correct 21 ms 28236 KB Output is correct
13 Correct 24 ms 28296 KB Output is correct
14 Correct 24 ms 28280 KB Output is correct
15 Correct 24 ms 28320 KB Output is correct
16 Correct 24 ms 28236 KB Output is correct
17 Correct 25 ms 28268 KB Output is correct
18 Correct 22 ms 27844 KB Output is correct
19 Correct 24 ms 28236 KB Output is correct
20 Correct 22 ms 28092 KB Output is correct
21 Correct 24 ms 28044 KB Output is correct
22 Correct 22 ms 27832 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 63620 KB Output is correct
2 Correct 216 ms 63812 KB Output is correct
3 Correct 195 ms 63880 KB Output is correct
4 Correct 284 ms 64196 KB Output is correct
5 Correct 395 ms 62628 KB Output is correct
6 Correct 24 ms 28312 KB Output is correct
7 Correct 23 ms 28252 KB Output is correct
8 Correct 24 ms 28244 KB Output is correct
9 Correct 479 ms 62752 KB Output is correct
10 Correct 390 ms 62492 KB Output is correct
11 Correct 355 ms 62556 KB Output is correct
12 Runtime error 227 ms 122176 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 63736 KB Output is correct
2 Correct 656 ms 63652 KB Output is correct
3 Correct 584 ms 63900 KB Output is correct
4 Correct 591 ms 63728 KB Output is correct
5 Correct 591 ms 61892 KB Output is correct
6 Correct 582 ms 63800 KB Output is correct
7 Correct 398 ms 46740 KB Output is correct
8 Correct 443 ms 46696 KB Output is correct
9 Correct 567 ms 63828 KB Output is correct
10 Correct 538 ms 63768 KB Output is correct
11 Correct 552 ms 63776 KB Output is correct
12 Correct 425 ms 46744 KB Output is correct
13 Incorrect 301 ms 43996 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 60548 KB Output is correct
2 Correct 163 ms 60588 KB Output is correct
3 Correct 164 ms 60580 KB Output is correct
4 Correct 189 ms 60532 KB Output is correct
5 Correct 164 ms 58436 KB Output is correct
6 Correct 21 ms 28152 KB Output is correct
7 Correct 21 ms 28172 KB Output is correct
8 Correct 20 ms 28108 KB Output is correct
9 Correct 182 ms 58712 KB Output is correct
10 Correct 166 ms 58448 KB Output is correct
11 Correct 168 ms 58632 KB Output is correct
12 Correct 161 ms 57028 KB Output is correct
13 Correct 160 ms 57500 KB Output is correct
14 Correct 19 ms 27648 KB Output is correct
15 Correct 19 ms 27672 KB Output is correct
16 Correct 19 ms 27724 KB Output is correct
17 Correct 19 ms 27724 KB Output is correct
18 Correct 22 ms 27764 KB Output is correct
19 Correct 23 ms 28064 KB Output is correct
20 Correct 22 ms 28108 KB Output is correct
21 Correct 22 ms 28100 KB Output is correct
22 Correct 25 ms 28272 KB Output is correct
23 Correct 25 ms 28280 KB Output is correct
24 Correct 24 ms 28280 KB Output is correct
25 Correct 21 ms 28236 KB Output is correct
26 Correct 24 ms 28296 KB Output is correct
27 Correct 24 ms 28280 KB Output is correct
28 Correct 24 ms 28320 KB Output is correct
29 Correct 24 ms 28236 KB Output is correct
30 Correct 25 ms 28268 KB Output is correct
31 Correct 22 ms 27844 KB Output is correct
32 Correct 24 ms 28236 KB Output is correct
33 Correct 22 ms 28092 KB Output is correct
34 Correct 24 ms 28044 KB Output is correct
35 Correct 22 ms 27832 KB Output is correct
36 Correct 201 ms 63620 KB Output is correct
37 Correct 216 ms 63812 KB Output is correct
38 Correct 195 ms 63880 KB Output is correct
39 Correct 284 ms 64196 KB Output is correct
40 Correct 395 ms 62628 KB Output is correct
41 Correct 24 ms 28312 KB Output is correct
42 Correct 23 ms 28252 KB Output is correct
43 Correct 24 ms 28244 KB Output is correct
44 Correct 479 ms 62752 KB Output is correct
45 Correct 390 ms 62492 KB Output is correct
46 Correct 355 ms 62556 KB Output is correct
47 Runtime error 227 ms 122176 KB Execution killed with signal 11
48 Halted 0 ms 0 KB -