oj.uz

Submission #784101

# Submission time Handle Problem Language Result Execution time Memory
784101 2023-07-15T16:42:40 Z amirhoseinfar1385 Sumtree (INOI20_sumtree) C++17
100 / 100
 1302 ms 262340 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<<19);
 
struct segment{
	set<pair<int,int>>seg[(1<<20)];
	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<<20)];
	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<<20)];
	segres(){
		for(int i=kaf;i<(1<<20);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 101 ms 81484 KB Output is correct
2 Correct 112 ms 81404 KB Output is correct
3 Correct 125 ms 81388 KB Output is correct
4 Correct 116 ms 81500 KB Output is correct
5 Correct 94 ms 77532 KB Output is correct
6 Correct 35 ms 63440 KB Output is correct
7 Correct 35 ms 63264 KB Output is correct
8 Correct 34 ms 63296 KB Output is correct
9 Correct 114 ms 73868 KB Output is correct
10 Correct 101 ms 73804 KB Output is correct
11 Correct 114 ms 73848 KB Output is correct
12 Correct 96 ms 73296 KB Output is correct
13 Correct 115 ms 80444 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 63188 KB Output is correct
2 Correct 33 ms 63052 KB Output is correct
3 Correct 35 ms 63192 KB Output is correct
4 Correct 33 ms 63072 KB Output is correct
5 Correct 38 ms 63236 KB Output is correct
6 Correct 39 ms 63348 KB Output is correct
7 Correct 38 ms 63308 KB Output is correct
8 Correct 38 ms 63336 KB Output is correct
9 Correct 40 ms 63420 KB Output is correct
10 Correct 40 ms 63612 KB Output is correct
11 Correct 42 ms 63692 KB Output is correct
12 Correct 36 ms 63468 KB Output is correct
13 Correct 42 ms 63636 KB Output is correct
14 Correct 41 ms 63636 KB Output is correct
15 Correct 49 ms 63948 KB Output is correct
16 Correct 44 ms 63428 KB Output is correct
17 Correct 42 ms 63564 KB Output is correct
18 Correct 42 ms 63480 KB Output is correct
19 Correct 39 ms 63444 KB Output is correct
20 Correct 38 ms 63336 KB Output is correct
21 Correct 38 ms 63308 KB Output is correct
22 Correct 37 ms 63336 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 86380 KB Output is correct
2 Correct 184 ms 91724 KB Output is correct
3 Correct 135 ms 87500 KB Output is correct
4 Correct 293 ms 100756 KB Output is correct
5 Correct 806 ms 144828 KB Output is correct
6 Correct 48 ms 64076 KB Output is correct
7 Correct 38 ms 63456 KB Output is correct
8 Correct 39 ms 63700 KB Output is correct
9 Correct 319 ms 83480 KB Output is correct
10 Correct 294 ms 81960 KB Output is correct
11 Correct 264 ms 81396 KB Output is correct
12 Correct 296 ms 81952 KB Output is correct
13 Correct 1002 ms 225036 KB Output is correct
14 Correct 919 ms 215536 KB Output is correct
15 Correct 1302 ms 262340 KB Output is correct
16 Correct 1243 ms 252880 KB Output is correct
17 Correct 925 ms 215308 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 444 ms 78604 KB Output is correct
2 Correct 436 ms 78628 KB Output is correct
3 Correct 459 ms 78612 KB Output is correct
4 Correct 464 ms 78620 KB Output is correct
5 Correct 454 ms 78164 KB Output is correct
6 Correct 467 ms 78576 KB Output is correct
7 Correct 361 ms 71952 KB Output is correct
8 Correct 387 ms 71892 KB Output is correct
9 Correct 447 ms 78660 KB Output is correct
10 Correct 451 ms 78644 KB Output is correct
11 Correct 471 ms 78540 KB Output is correct
12 Correct 373 ms 71916 KB Output is correct
13 Correct 294 ms 69324 KB Output is correct
14 Correct 321 ms 70304 KB Output is correct
15 Correct 336 ms 70352 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 81484 KB Output is correct
2 Correct 112 ms 81404 KB Output is correct
3 Correct 125 ms 81388 KB Output is correct
4 Correct 116 ms 81500 KB Output is correct
5 Correct 94 ms 77532 KB Output is correct
6 Correct 35 ms 63440 KB Output is correct
7 Correct 35 ms 63264 KB Output is correct
8 Correct 34 ms 63296 KB Output is correct
9 Correct 114 ms 73868 KB Output is correct
10 Correct 101 ms 73804 KB Output is correct
11 Correct 114 ms 73848 KB Output is correct
12 Correct 96 ms 73296 KB Output is correct
13 Correct 115 ms 80444 KB Output is correct
14 Correct 34 ms 63188 KB Output is correct
15 Correct 33 ms 63052 KB Output is correct
16 Correct 35 ms 63192 KB Output is correct
17 Correct 33 ms 63072 KB Output is correct
18 Correct 38 ms 63236 KB Output is correct
19 Correct 39 ms 63348 KB Output is correct
20 Correct 38 ms 63308 KB Output is correct
21 Correct 38 ms 63336 KB Output is correct
22 Correct 40 ms 63420 KB Output is correct
23 Correct 40 ms 63612 KB Output is correct
24 Correct 42 ms 63692 KB Output is correct
25 Correct 36 ms 63468 KB Output is correct
26 Correct 42 ms 63636 KB Output is correct
27 Correct 41 ms 63636 KB Output is correct
28 Correct 49 ms 63948 KB Output is correct
29 Correct 44 ms 63428 KB Output is correct
30 Correct 42 ms 63564 KB Output is correct
31 Correct 42 ms 63480 KB Output is correct
32 Correct 39 ms 63444 KB Output is correct
33 Correct 38 ms 63336 KB Output is correct
34 Correct 38 ms 63308 KB Output is correct
35 Correct 37 ms 63336 KB Output is correct
36 Correct 130 ms 86380 KB Output is correct
37 Correct 184 ms 91724 KB Output is correct
38 Correct 135 ms 87500 KB Output is correct
39 Correct 293 ms 100756 KB Output is correct
40 Correct 806 ms 144828 KB Output is correct
41 Correct 48 ms 64076 KB Output is correct
42 Correct 38 ms 63456 KB Output is correct
43 Correct 39 ms 63700 KB Output is correct
44 Correct 319 ms 83480 KB Output is correct
45 Correct 294 ms 81960 KB Output is correct
46 Correct 264 ms 81396 KB Output is correct
47 Correct 296 ms 81952 KB Output is correct
48 Correct 1002 ms 225036 KB Output is correct
49 Correct 919 ms 215536 KB Output is correct
50 Correct 1302 ms 262340 KB Output is correct
51 Correct 1243 ms 252880 KB Output is correct
52 Correct 925 ms 215308 KB Output is correct
53 Correct 444 ms 78604 KB Output is correct
54 Correct 436 ms 78628 KB Output is correct
55 Correct 459 ms 78612 KB Output is correct
56 Correct 464 ms 78620 KB Output is correct
57 Correct 454 ms 78164 KB Output is correct
58 Correct 467 ms 78576 KB Output is correct
59 Correct 361 ms 71952 KB Output is correct
60 Correct 387 ms 71892 KB Output is correct
61 Correct 447 ms 78660 KB Output is correct
62 Correct 451 ms 78644 KB Output is correct
63 Correct 471 ms 78540 KB Output is correct
64 Correct 373 ms 71916 KB Output is correct
65 Correct 294 ms 69324 KB Output is correct
66 Correct 321 ms 70304 KB Output is correct
67 Correct 336 ms 70352 KB Output is correct
68 Correct 38 ms 63092 KB Output is correct
69 Correct 42 ms 63148 KB Output is correct
70 Correct 577 ms 86232 KB Output is correct
71 Correct 504 ms 86272 KB Output is correct
72 Correct 548 ms 86380 KB Output is correct
73 Correct 530 ms 86200 KB Output is correct
74 Correct 679 ms 86664 KB Output is correct
75 Correct 677 ms 82372 KB Output is correct
76 Correct 504 ms 78584 KB Output is correct
77 Correct 552 ms 79092 KB Output is correct
78 Correct 553 ms 80188 KB Output is correct
79 Correct 509 ms 82440 KB Output is correct
80 Correct 631 ms 82192 KB Output is correct
81 Correct 606 ms 82740 KB Output is correct
82 Correct 337 ms 75816 KB Output is correct
83 Correct 381 ms 82924 KB Output is correct
84 Correct 413 ms 82164 KB Output is correct
85 Correct 392 ms 82164 KB Output is correct