oj.uz

Submission #784119

# Submission time Handle Problem Language Result Execution time Memory
784119 2023-07-15T17:49:35 Z amirhoseinfar1385 Sumtree (INOI20_sumtree) C++17
100 / 100
 1224 ms 236416 KB 
#include<bits/stdc++.h>
using namespace std;
int n,k;
const int maxn=200000+10,maxm=500000+10;
vector<int>adj[maxn];
int par[maxn],val[maxn],cnt[maxn],asd,timea=0,high[maxn],fact[maxm],revfact[maxm],mod=1e9+7;
pair<int,int>stf[maxn];
int kaf=(1<<18);
 
struct segment{
	set<pair<int,int>>seg[(1<<19)];
	pair<int,int> get(int i){
		if(i==0){
			return make_pair(0,0);
		}
		if((int)seg[i].size()==0){
			return get((i>>1));
		}
		auto x=*seg[i].rbegin();
		return max(get((i>>1)),x);
	}
	void del(int i,int l,int r,int tl,int tr,int w){
		if(l>r||l>tr||r<tl||tl>tr){
			return ;
		}
		if(l>=tl&&r<=tr){
			seg[i].erase(make_pair(high[w],w));
			return ;
		}
		int m=(l+r)>>1;
		del((i<<1),l,m,tl,tr,w);
		del((i<<1)^1,m+1,r,tl,tr,w);
	}
 
	void upd(int i,int l,int r,int tl,int tr,int w){
		if(l>r||l>tr||r<tl||tl>tr){
			return ;
		}
		if(l>=tl&&r<=tr){
			seg[i].insert(make_pair(high[w],w));
			return ;
		}
		int m=(l+r)>>1;
		upd((i<<1),l,m,tl,tr,w);
		upd((i<<1)^1,m+1,r,tl,tr,w);
	}
}segbal;
 
struct segjam{
	int seg[(1<<19)];
	int pors(int i,int l,int r,int tl,int tr){
		if(l>r||l>tr||r<tl||tl>tr){
			return 0;
		}
		if(l>=tl&&r<=tr){
			return seg[i];
		}
		int m=(l+r)>>1;
		int ret=pors((i<<1),l,m,tl,tr)+pors((i<<1)^1,m+1,r,tl,tr);
		return ret;
	}
	void upd(int i,int w){
		if(i==0){
			return ;
		}
		seg[i]+=w;
		upd((i>>1),w);
	}
}segjam,segted;
 
struct segres{
	int seg[(1<<19)];
	segres(){
		for(int i=kaf;i<(1<<19);i++){
			seg[i]=-1;
		}
		for(int i=1;i<kaf;i++){
			seg[i]=-1;
		}
	}
	void calc(int i){
		if(seg[(i<<1)]==-1&&seg[(i<<1)^1]==-1){
			seg[i]=-1;
			return ;
		}
		if(seg[(i<<1)]==-1){
			seg[i]=seg[(i<<1)^1];
			return ;
		}
		if(seg[(i<<1)^1]==-1){
			seg[i]=seg[(i<<1)];
			return ;
		}
		seg[i]=1ll*seg[(i<<1)^1]*seg[(i<<1)]%mod;
		return ;
	}
 
	void upd(int i,int l,int r,int tl,int tr,int w){
		if(l>r||l>tr||r<tl||tl>tr){
			return ;
		}
		if(l>=tl&&r<=tr){
			seg[i]=w;
			return ;
		}
		int m=(l+r)>>1;
		upd((i<<1),l,m,tl,tr,w);
		upd((i<<1)^1,m+1,r,tl,tr,w);
		calc(i);
	}
 
}res;
 
long long mypow(long long m,long long y){
	if(y==0){
		return 1;
	}
	long long p=mypow(m,(y>>1));
	p*=p;
	p%=mod;
	if(y&1){
		p*=m;
		p%=mod;
	}
	return p;
}
 
void aval(){	
	for(int i=0;i<maxn;i++){
		val[i]=-1;
	}
	fact[0]=1;
	for(int i=1;i<maxm;i++){
		fact[i]=1ll*fact[i-1]*i%mod;
	}
	revfact[maxm-1]=mypow(fact[maxm-1],mod-2);
	for(int i=maxm-2;i>=0;i--){
		revfact[i]=1ll*revfact[i+1]*(i+1)%mod;
	}
}
 
inline int c(int i,int j){
	if(i<0||j<0||i<j){
		return 0;
	}
	int ret=1ll*fact[i]*revfact[j]%mod*revfact[i-j]%mod;
	return ret;
}
 
void dfs(int u,int para=0){
	cnt[u]=1;
	high[u]=high[para]+1;
	timea++;
	stf[u].first=timea;
	par[u]=para;
	for(auto x:adj[u]){
		if(x!=para){
			dfs(x,u);
			cnt[u]+=cnt[x];
		}
	}
	stf[u].second=timea;
}
 
inline int hes(int a,int b){
	a++;
	int ret=c(b+a-1,a-1);	
	return ret;
}
 
void upd(int u,int w){
	val[u]=w;
	int pp=segbal.get(stf[u].first+kaf).second;
	int jam=segjam.pors(1,0,kaf-1,stf[u].first+1,stf[u].second);
	int ted=cnt[u]-segted.pors(1,0,kaf-1,stf[u].first+1,stf[u].second);
	segted.upd(kaf+stf[u].first,ted);
	segted.upd(kaf+stf[pp].first,-ted);
	segbal.upd(1,0,kaf-1,stf[u].first+1,stf[u].second,u);
	segjam.upd(kaf+stf[u].first,-jam+w);
	segjam.upd(kaf+stf[pp].first,+jam-w);
	int jamp=segjam.pors(1,0,kaf-1,stf[pp].first+1,stf[pp].second);
	int tedp=cnt[pp]-segted.pors(1,0,kaf-1,stf[pp].first+1,stf[pp].second);
	int fake=hes(tedp-1,val[pp]-jamp);
	res.upd(1,0,kaf-1,stf[pp].first,stf[pp].first,fake);
	fake=hes(ted-1,val[u]-jam);
	res.upd(1,0,kaf-1,stf[u].first,stf[u].first,fake);
}
 
void del(int u){
	int pp=segbal.get(stf[u].first+kaf).second;
	int jam=segjam.pors(1,0,kaf-1,stf[u].first+1,stf[u].second);
	int ted=cnt[u]-segted.pors(1,0,kaf-1,stf[u].first+1,stf[u].second);
	segted.upd(kaf+stf[u].first,-ted);
	segted.upd(kaf+stf[pp].first,+ted);
	segbal.del(1,0,kaf-1,stf[u].first+1,stf[u].second,u);
	segjam.upd(kaf+stf[u].first,+jam-val[u]);
	segjam.upd(kaf+stf[pp].first,-jam+val[u]);
	val[u]=-1;
	int jamp=segjam.pors(1,0,kaf-1,stf[pp].first+1,stf[pp].second);
	int tedp=cnt[pp]-segted.pors(1,0,kaf-1,stf[pp].first+1,stf[pp].second);
	int fake=hes(tedp-1,val[pp]-jamp);
	res.upd(1,0,kaf-1,stf[pp].first,stf[pp].first,fake);
	res.upd(1,0,kaf-1,stf[u].first,stf[u].first,-1);
}
void tof(){
	res.upd(1,0,kaf-1,stf[1].first,stf[1].first,hes(n-1,val[1]));
	segbal.upd(1,0,kaf-1,stf[1].first+1,stf[1].second,1);
}
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	aval();
	cin>>n>>k;
	for(int i=0;i<n-1;i++){
		int u,v;
		cin>>u>>v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs(1);
	val[1]=k;
	tof();
	int q;
	cin>>q;
	asd=1;
	cout<<res.seg[1]<<"\n";
	for(;asd<=q;asd++){
		int qq;
		cin>>qq;
		if(qq==1){
			int u,w;
			cin>>u>>w;
			upd(u,w);
		}
		else{
			int u;
			cin>>u;
			del(u);
		}
		cout<<res.seg[1]<<"\n";
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 55240 KB Output is correct
2 Correct 112 ms 55208 KB Output is correct
3 Correct 123 ms 55328 KB Output is correct
4 Correct 120 ms 55292 KB Output is correct
5 Correct 103 ms 51272 KB Output is correct
6 Correct 28 ms 36744 KB Output is correct
7 Correct 27 ms 36540 KB Output is correct
8 Correct 28 ms 36556 KB Output is correct
9 Correct 132 ms 47684 KB Output is correct
10 Correct 104 ms 47640 KB Output is correct
11 Correct 99 ms 47632 KB Output is correct
12 Correct 106 ms 47156 KB Output is correct
13 Correct 109 ms 54312 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 36500 KB Output is correct
2 Correct 27 ms 36484 KB Output is correct
3 Correct 28 ms 36500 KB Output is correct
4 Correct 27 ms 36436 KB Output is correct
5 Correct 28 ms 36520 KB Output is correct
6 Correct 30 ms 36672 KB Output is correct
7 Correct 32 ms 36668 KB Output is correct
8 Correct 30 ms 36680 KB Output is correct
9 Correct 31 ms 36808 KB Output is correct
10 Correct 33 ms 36872 KB Output is correct
11 Correct 34 ms 36984 KB Output is correct
12 Correct 28 ms 36848 KB Output is correct
13 Correct 33 ms 36948 KB Output is correct
14 Correct 34 ms 36944 KB Output is correct
15 Correct 36 ms 37276 KB Output is correct
16 Correct 31 ms 36692 KB Output is correct
17 Correct 34 ms 36820 KB Output is correct
18 Correct 35 ms 36808 KB Output is correct
19 Correct 32 ms 36692 KB Output is correct
20 Correct 29 ms 36616 KB Output is correct
21 Correct 30 ms 36680 KB Output is correct
22 Correct 27 ms 36492 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 60288 KB Output is correct
2 Correct 227 ms 65432 KB Output is correct
3 Correct 132 ms 61132 KB Output is correct
4 Correct 305 ms 74368 KB Output is correct
5 Correct 852 ms 118504 KB Output is correct
6 Correct 31 ms 37460 KB Output is correct
7 Correct 29 ms 36732 KB Output is correct
8 Correct 31 ms 37068 KB Output is correct
9 Correct 316 ms 57268 KB Output is correct
10 Correct 270 ms 55636 KB Output is correct
11 Correct 288 ms 55284 KB Output is correct
12 Correct 323 ms 55544 KB Output is correct
13 Correct 984 ms 198840 KB Output is correct
14 Correct 887 ms 189580 KB Output is correct
15 Correct 1224 ms 236416 KB Output is correct
16 Correct 1166 ms 227012 KB Output is correct
17 Correct 888 ms 189416 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 53292 KB Output is correct
2 Correct 456 ms 52784 KB Output is correct
3 Correct 465 ms 52796 KB Output is correct
4 Correct 465 ms 52824 KB Output is correct
5 Correct 438 ms 52136 KB Output is correct
6 Correct 452 ms 52840 KB Output is correct
7 Correct 363 ms 46100 KB Output is correct
8 Correct 346 ms 46156 KB Output is correct
9 Correct 454 ms 52984 KB Output is correct
10 Correct 426 ms 52852 KB Output is correct
11 Correct 395 ms 52812 KB Output is correct
12 Correct 352 ms 46120 KB Output is correct
13 Correct 299 ms 43512 KB Output is correct
14 Correct 302 ms 44536 KB Output is correct
15 Correct 311 ms 44512 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 55240 KB Output is correct
2 Correct 112 ms 55208 KB Output is correct
3 Correct 123 ms 55328 KB Output is correct
4 Correct 120 ms 55292 KB Output is correct
5 Correct 103 ms 51272 KB Output is correct
6 Correct 28 ms 36744 KB Output is correct
7 Correct 27 ms 36540 KB Output is correct
8 Correct 28 ms 36556 KB Output is correct
9 Correct 132 ms 47684 KB Output is correct
10 Correct 104 ms 47640 KB Output is correct
11 Correct 99 ms 47632 KB Output is correct
12 Correct 106 ms 47156 KB Output is correct
13 Correct 109 ms 54312 KB Output is correct
14 Correct 26 ms 36500 KB Output is correct
15 Correct 27 ms 36484 KB Output is correct
16 Correct 28 ms 36500 KB Output is correct
17 Correct 27 ms 36436 KB Output is correct
18 Correct 28 ms 36520 KB Output is correct
19 Correct 30 ms 36672 KB Output is correct
20 Correct 32 ms 36668 KB Output is correct
21 Correct 30 ms 36680 KB Output is correct
22 Correct 31 ms 36808 KB Output is correct
23 Correct 33 ms 36872 KB Output is correct
24 Correct 34 ms 36984 KB Output is correct
25 Correct 28 ms 36848 KB Output is correct
26 Correct 33 ms 36948 KB Output is correct
27 Correct 34 ms 36944 KB Output is correct
28 Correct 36 ms 37276 KB Output is correct
29 Correct 31 ms 36692 KB Output is correct
30 Correct 34 ms 36820 KB Output is correct
31 Correct 35 ms 36808 KB Output is correct
32 Correct 32 ms 36692 KB Output is correct
33 Correct 29 ms 36616 KB Output is correct
34 Correct 30 ms 36680 KB Output is correct
35 Correct 27 ms 36492 KB Output is correct
36 Correct 133 ms 60288 KB Output is correct
37 Correct 227 ms 65432 KB Output is correct
38 Correct 132 ms 61132 KB Output is correct
39 Correct 305 ms 74368 KB Output is correct
40 Correct 852 ms 118504 KB Output is correct
41 Correct 31 ms 37460 KB Output is correct
42 Correct 29 ms 36732 KB Output is correct
43 Correct 31 ms 37068 KB Output is correct
44 Correct 316 ms 57268 KB Output is correct
45 Correct 270 ms 55636 KB Output is correct
46 Correct 288 ms 55284 KB Output is correct
47 Correct 323 ms 55544 KB Output is correct
48 Correct 984 ms 198840 KB Output is correct
49 Correct 887 ms 189580 KB Output is correct
50 Correct 1224 ms 236416 KB Output is correct
51 Correct 1166 ms 227012 KB Output is correct
52 Correct 888 ms 189416 KB Output is correct
53 Correct 563 ms 53292 KB Output is correct
54 Correct 456 ms 52784 KB Output is correct
55 Correct 465 ms 52796 KB Output is correct
56 Correct 465 ms 52824 KB Output is correct
57 Correct 438 ms 52136 KB Output is correct
58 Correct 452 ms 52840 KB Output is correct
59 Correct 363 ms 46100 KB Output is correct
60 Correct 346 ms 46156 KB Output is correct
61 Correct 454 ms 52984 KB Output is correct
62 Correct 426 ms 52852 KB Output is correct
63 Correct 395 ms 52812 KB Output is correct
64 Correct 352 ms 46120 KB Output is correct
65 Correct 299 ms 43512 KB Output is correct
66 Correct 302 ms 44536 KB Output is correct
67 Correct 311 ms 44512 KB Output is correct
68 Correct 27 ms 36468 KB Output is correct
69 Correct 27 ms 36420 KB Output is correct
70 Correct 514 ms 60404 KB Output is correct
71 Correct 504 ms 60500 KB Output is correct
72 Correct 518 ms 60504 KB Output is correct
73 Correct 536 ms 60424 KB Output is correct
74 Correct 719 ms 60892 KB Output is correct
75 Correct 688 ms 56680 KB Output is correct
76 Correct 500 ms 52812 KB Output is correct
77 Correct 460 ms 53316 KB Output is correct
78 Correct 492 ms 54492 KB Output is correct
79 Correct 480 ms 56660 KB Output is correct
80 Correct 637 ms 56316 KB Output is correct
81 Correct 610 ms 56884 KB Output is correct
82 Correct 330 ms 49996 KB Output is correct
83 Correct 336 ms 57056 KB Output is correct
84 Correct 394 ms 56436 KB Output is correct
85 Correct 384 ms 56428 KB Output is correct