oj.uz

답안 #784066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784066 2023-07-15T15:43:03 Z amirhoseinfar1385 Sumtree (INOI20_sumtree) C++17
100 / 100
 1380 ms 338200 KB 
#include<bits/stdc++.h>
using namespace std;
int n,k;
const int maxn=200000+10,maxm=500000+10;
vector<int>adj[maxn],child[maxn];
int par[maxn],val[maxn],link[maxn],fres[maxn],wa[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<long long,long long>>seg[(1<<20)];
	pair<long long,long long> get(long long i){
		if(i==0){
			return make_pair(0,0);
		}
		if((long long)seg[i].size()==0){
			return get((i>>1));
		}
		auto x=*seg[i].rbegin();
		return max(get((i>>1)),x);
	}
	void del(long long i,long long l,long long r,long long tl,long long tr,long long 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 ;
		}
		long long m=(l+r)>>1;
		del((i<<1),l,m,tl,tr,w);
		del((i<<1)^1,m+1,r,tl,tr,w);
	}
 
	void upd(long long i,long long l,long long r,long long tl,long long tr,long long 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 ;
		}
		long long 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{
	long long seg[(1<<20)];
	long long pors(long long i,long long l,long long r,long long tl,long long tr){
		if(l>r||l>tr||r<tl||tl>tr){
			return 0;
		}
		if(l>=tl&&r<=tr){
			return seg[i];
		}
		long long m=(l+r)>>1;
		long long ret=pors((i<<1),l,m,tl,tr)+pors((i<<1)^1,m+1,r,tl,tr);
		return ret;
	}
	void upd(long long i,long long w){
		if(i==0){
			return ;
		}
		seg[i]+=w;
		upd((i>>1),w);
	}
}segjam,segted;
 
struct segres{
	long long seg[(1<<20)];
	segres(){
		for(long long i=kaf;i<(1<<20);i++){
			seg[i]=-1;
		}
		for(long long 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,long long w){
		if(l>r||l>tr||r<tl||tl>tr){
			return ;
		}
		if(l>=tl&&r<=tr){
			w%=mod;
			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++){
		fres[i]=-1;
		val[i]=-1;
	}
	fact[0]=1;
	for(long long i=1;i<maxm;i++){
		fact[i]=1ll*fact[i-1]*i%mod;
	}
	revfact[maxm-1]=mypow(fact[maxm-1],mod-2);
	for(long long i=maxm-2;i>=0;i--){
		revfact[i]=1ll*revfact[i+1]*(i+1)%mod;
	}
}
 
long long c(long long i,long long j){
	if(i<0||j<0||i<j){
		return 0;
	}
	long long ret=1ll*fact[i]*revfact[j]%mod*revfact[i-j]%mod;
	return ret;
}
 
void dfs(long long u,long long 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){
			child[u].push_back(x);
			dfs(x,u);
			cnt[u]+=cnt[x];
		}
	}
	stf[u].second=timea;
}
 
long long hes(long long a,long long b){
	a++;
	long long ret=c(b+a-1,a-1);	
	return ret;
}

int findp(int u,int av){
	if(u==av||val[u]==-1){
		return findp(par[u],av);
	}
	return u;
}

long long porsjam(int u,int av){
	long long ret=0;
	if(u!=av&&val[u]!=-1){
		ret+=val[u];
		return ret;
	}
	for(auto x:child[u]){
		ret+=porsjam(x,av);
	}
	return ret;
}

long long porsted(int u,int av){
	long long ret=0;
	if(u!=av&&val[u]!=-1){
		return ret;
	}
	for(auto x:child[u]){
		ret+=porsted(x,av);
	}
	ret++;
	return ret;
}

void upd(long long u,long long w){
	wa[u]=w;
	val[u]=w;
	long long pp=segbal.get(stf[u].first+kaf).second;
//	long long pp=findp(u,u);
	long long jam=segjam.pors(1,0,kaf-1,stf[u].first+1,stf[u].second);
//	long long jam=porsjam(u,u);
	long long ted=cnt[u]-segted.pors(1,0,kaf-1,stf[u].first+1,stf[u].second);
//	long long ted=porsted(u,u);
	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);
	long long jamp=segjam.pors(1,0,kaf-1,stf[pp].first+1,stf[pp].second);
//	long long jamp=porsjam(pp,pp);
	long long tedp=cnt[pp]-segted.pors(1,0,kaf-1,stf[pp].first+1,stf[pp].second);
//	long long tedp=porsted(pp,pp);
	long long fake=hes(tedp-1,val[pp]-jamp);
//	fres[stf[pp].first]=fake;
//	cout<<u<<" "<<pp<<" "<<jamp<<" "<<val[pp]<<" "<<tedp<<"\n";
	res.upd(1,0,kaf-1,stf[pp].first,stf[pp].first,fake);
	fake=hes(ted-1,val[u]-jam);
//	fres[stf[u].first]=fake;
	res.upd(1,0,kaf-1,stf[u].first,stf[u].first,fake);
}
 
void del(long long u){
	long long pp=segbal.get(stf[u].first+kaf).second;
//	long long pp=findp(u,u);
	long long jam=segjam.pors(1,0,kaf-1,stf[u].first+1,stf[u].second);
//	long long jam=porsjam(u,u);
	long long ted=cnt[u]-segted.pors(1,0,kaf-1,stf[u].first+1,stf[u].second);
//	long long ted=porsted(u,u);
	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;
	long long jamp=segjam.pors(1,0,kaf-1,stf[pp].first+1,stf[pp].second);
//	long long jamp=porsjam(pp,pp);
	long long tedp=cnt[pp]-segted.pors(1,0,kaf-1,stf[pp].first+1,stf[pp].second);
//	long long tedp=porsted(pp,pp);
	long long fake=hes(tedp-1,val[pp]-jamp);
	fres[stf[pp].first]=fake;
	fres[stf[u].first]=-1;
//	res.upd(1,0,kaf-1,stf[pp].first,stf[pp].first,-1);
	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);
//	val[u]=-1;
}
 
void calres(){
	long long ret=1;
	for(int i=stf[1].first;i<=stf[1].second;i++){
//		cout<<i<<" asd "<<fres[i]<<"\n";
		if(fres[i]==-1){
			continue;
		}
		ret*=fres[i];
		ret%=mod;
	}
	cout<<ret<<"\n";
}

void tof(){
	//cout<<porsted(1,1)<<" "<<porsjam(1,1)<<"\n";
	fres[stf[1].first]=hes(porsted(1,1)-1,val[1]-porsjam(1,1));
	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);
	link[1]=0;
}
 

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	aval();
	cin>>n>>k;
	for(long long i=0;i<n-1;i++){
		long long u,v;
		cin>>u>>v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs(1);
//	segjam.upd(stf[1].first+kaf,k);
	val[1]=k;
	tof();
	long long q;
	cin>>q;
	asd=1;
	cout<<res.seg[1]<<"\n";
//	calres();
	for(;asd<=q;asd++){
		long long qq;
		cin>>qq;
		if(qq==1){
			long long u,w;
			cin>>u>>w;
			upd(u,w);
		}
		else{
			long long u;
			cin>>u;
			del(u);
		}
		cout<<res.seg[1]<<"\n";
//		calres();
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 94616 KB Output is correct
2 Correct 135 ms 94628 KB Output is correct
3 Correct 135 ms 94540 KB Output is correct
4 Correct 139 ms 94628 KB Output is correct
5 Correct 118 ms 92928 KB Output is correct
6 Correct 43 ms 73128 KB Output is correct
7 Correct 44 ms 72756 KB Output is correct
8 Correct 44 ms 72860 KB Output is correct
9 Correct 141 ms 86328 KB Output is correct
10 Correct 141 ms 86208 KB Output is correct
11 Correct 157 ms 86220 KB Output is correct
12 Correct 133 ms 85624 KB Output is correct
13 Correct 118 ms 93260 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 72684 KB Output is correct
2 Correct 41 ms 72768 KB Output is correct
3 Correct 40 ms 72696 KB Output is correct
4 Correct 40 ms 72664 KB Output is correct
5 Correct 46 ms 72980 KB Output is correct
6 Correct 45 ms 73028 KB Output is correct
7 Correct 45 ms 73016 KB Output is correct
8 Correct 44 ms 73072 KB Output is correct
9 Correct 44 ms 73164 KB Output is correct
10 Correct 46 ms 73308 KB Output is correct
11 Correct 47 ms 73312 KB Output is correct
12 Correct 42 ms 73164 KB Output is correct
13 Correct 47 ms 73324 KB Output is correct
14 Correct 47 ms 73288 KB Output is correct
15 Correct 49 ms 73768 KB Output is correct
16 Correct 45 ms 73112 KB Output is correct
17 Correct 46 ms 73336 KB Output is correct
18 Correct 47 ms 73180 KB Output is correct
19 Correct 45 ms 73036 KB Output is correct
20 Correct 43 ms 73040 KB Output is correct
21 Correct 42 ms 73036 KB Output is correct
22 Correct 40 ms 72780 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 167 ms 104216 KB Output is correct
2 Correct 230 ms 111012 KB Output is correct
3 Correct 166 ms 105440 KB Output is correct
4 Correct 343 ms 123068 KB Output is correct
5 Correct 882 ms 185156 KB Output is correct
6 Correct 46 ms 74092 KB Output is correct
7 Correct 44 ms 73104 KB Output is correct
8 Correct 45 ms 73544 KB Output is correct
9 Correct 388 ms 101704 KB Output is correct
10 Correct 328 ms 99732 KB Output is correct
11 Correct 304 ms 99020 KB Output is correct
12 Correct 356 ms 99824 KB Output is correct
13 Correct 1056 ms 287968 KB Output is correct
14 Correct 971 ms 275524 KB Output is correct
15 Correct 1380 ms 338200 KB Output is correct
16 Correct 1282 ms 325624 KB Output is correct
17 Correct 981 ms 275404 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 535 ms 95460 KB Output is correct
2 Correct 528 ms 95436 KB Output is correct
3 Correct 531 ms 95560 KB Output is correct
4 Correct 531 ms 95464 KB Output is correct
5 Correct 510 ms 94284 KB Output is correct
6 Correct 526 ms 95440 KB Output is correct
7 Correct 398 ms 85040 KB Output is correct
8 Correct 406 ms 85136 KB Output is correct
9 Correct 519 ms 95420 KB Output is correct
10 Correct 514 ms 95372 KB Output is correct
11 Correct 507 ms 95304 KB Output is correct
12 Correct 391 ms 85216 KB Output is correct
13 Correct 306 ms 80732 KB Output is correct
14 Correct 336 ms 83052 KB Output is correct
15 Correct 347 ms 83532 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 94616 KB Output is correct
2 Correct 135 ms 94628 KB Output is correct
3 Correct 135 ms 94540 KB Output is correct
4 Correct 139 ms 94628 KB Output is correct
5 Correct 118 ms 92928 KB Output is correct
6 Correct 43 ms 73128 KB Output is correct
7 Correct 44 ms 72756 KB Output is correct
8 Correct 44 ms 72860 KB Output is correct
9 Correct 141 ms 86328 KB Output is correct
10 Correct 141 ms 86208 KB Output is correct
11 Correct 157 ms 86220 KB Output is correct
12 Correct 133 ms 85624 KB Output is correct
13 Correct 118 ms 93260 KB Output is correct
14 Correct 41 ms 72684 KB Output is correct
15 Correct 41 ms 72768 KB Output is correct
16 Correct 40 ms 72696 KB Output is correct
17 Correct 40 ms 72664 KB Output is correct
18 Correct 46 ms 72980 KB Output is correct
19 Correct 45 ms 73028 KB Output is correct
20 Correct 45 ms 73016 KB Output is correct
21 Correct 44 ms 73072 KB Output is correct
22 Correct 44 ms 73164 KB Output is correct
23 Correct 46 ms 73308 KB Output is correct
24 Correct 47 ms 73312 KB Output is correct
25 Correct 42 ms 73164 KB Output is correct
26 Correct 47 ms 73324 KB Output is correct
27 Correct 47 ms 73288 KB Output is correct
28 Correct 49 ms 73768 KB Output is correct
29 Correct 45 ms 73112 KB Output is correct
30 Correct 46 ms 73336 KB Output is correct
31 Correct 47 ms 73180 KB Output is correct
32 Correct 45 ms 73036 KB Output is correct
33 Correct 43 ms 73040 KB Output is correct
34 Correct 42 ms 73036 KB Output is correct
35 Correct 40 ms 72780 KB Output is correct
36 Correct 167 ms 104216 KB Output is correct
37 Correct 230 ms 111012 KB Output is correct
38 Correct 166 ms 105440 KB Output is correct
39 Correct 343 ms 123068 KB Output is correct
40 Correct 882 ms 185156 KB Output is correct
41 Correct 46 ms 74092 KB Output is correct
42 Correct 44 ms 73104 KB Output is correct
43 Correct 45 ms 73544 KB Output is correct
44 Correct 388 ms 101704 KB Output is correct
45 Correct 328 ms 99732 KB Output is correct
46 Correct 304 ms 99020 KB Output is correct
47 Correct 356 ms 99824 KB Output is correct
48 Correct 1056 ms 287968 KB Output is correct
49 Correct 971 ms 275524 KB Output is correct
50 Correct 1380 ms 338200 KB Output is correct
51 Correct 1282 ms 325624 KB Output is correct
52 Correct 981 ms 275404 KB Output is correct
53 Correct 535 ms 95460 KB Output is correct
54 Correct 528 ms 95436 KB Output is correct
55 Correct 531 ms 95560 KB Output is correct
56 Correct 531 ms 95464 KB Output is correct
57 Correct 510 ms 94284 KB Output is correct
58 Correct 526 ms 95440 KB Output is correct
59 Correct 398 ms 85040 KB Output is correct
60 Correct 406 ms 85136 KB Output is correct
61 Correct 519 ms 95420 KB Output is correct
62 Correct 514 ms 95372 KB Output is correct
63 Correct 507 ms 95304 KB Output is correct
64 Correct 391 ms 85216 KB Output is correct
65 Correct 306 ms 80732 KB Output is correct
66 Correct 336 ms 83052 KB Output is correct
67 Correct 347 ms 83532 KB Output is correct
68 Correct 44 ms 72660 KB Output is correct
69 Correct 43 ms 72780 KB Output is correct
70 Correct 576 ms 103632 KB Output is correct
71 Correct 576 ms 103732 KB Output is correct
72 Correct 580 ms 103684 KB Output is correct
73 Correct 591 ms 103684 KB Output is correct
74 Correct 769 ms 104284 KB Output is correct
75 Correct 675 ms 100776 KB Output is correct
76 Correct 541 ms 95480 KB Output is correct
77 Correct 554 ms 96128 KB Output is correct
78 Correct 639 ms 97744 KB Output is correct
79 Correct 651 ms 99436 KB Output is correct
80 Correct 729 ms 99076 KB Output is correct
81 Correct 765 ms 99828 KB Output is correct
82 Correct 413 ms 89692 KB Output is correct
83 Correct 433 ms 96504 KB Output is correct
84 Correct 467 ms 95884 KB Output is correct
85 Correct 429 ms 95856 KB Output is correct