oj.uz

Submission #784104

# Submission time Handle Problem Language Result Execution time Memory
784104 2023-07-15T16:48:46 Z amirhoseinfar1385 Sumtree (INOI20_sumtree) C++17
100 / 100
 1601 ms 262376 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 cmp {
    bool operator() (int a, int b) const {
        return high[a]<high[b];
    }
};

struct segment{
	set<int,cmp>seg[(1<<20)];
	int get(int i){
		if(i==0){
			return 0;
		}
		if((int)seg[i].size()==0){
			return get((i>>1));
		}
		auto x=*seg[i].rbegin();
		int z=get((i>>1));
		if(high[z]>high[x]){
			return z;
		}
		else{
			return 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(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(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);
	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);
	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 124 ms 81080 KB Output is correct
2 Correct 120 ms 81020 KB Output is correct
3 Correct 122 ms 81016 KB Output is correct
4 Correct 108 ms 81064 KB Output is correct
5 Correct 94 ms 77148 KB Output is correct
6 Correct 39 ms 63380 KB Output is correct
7 Correct 39 ms 63180 KB Output is correct
8 Correct 36 ms 63188 KB Output is correct
9 Correct 109 ms 73448 KB Output is correct
10 Correct 107 ms 73408 KB Output is correct
11 Correct 121 ms 73356 KB Output is correct
12 Correct 98 ms 72956 KB Output is correct
13 Correct 98 ms 80076 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 63192 KB Output is correct
2 Correct 39 ms 63188 KB Output is correct
3 Correct 36 ms 63168 KB Output is correct
4 Correct 36 ms 63124 KB Output is correct
5 Correct 37 ms 63200 KB Output is correct
6 Correct 39 ms 63380 KB Output is correct
7 Correct 38 ms 63304 KB Output is correct
8 Correct 40 ms 63248 KB Output is correct
9 Correct 47 ms 63444 KB Output is correct
10 Correct 44 ms 63568 KB Output is correct
11 Correct 47 ms 63676 KB Output is correct
12 Correct 37 ms 63440 KB Output is correct
13 Correct 43 ms 63564 KB Output is correct
14 Correct 43 ms 63568 KB Output is correct
15 Correct 45 ms 63880 KB Output is correct
16 Correct 40 ms 63444 KB Output is correct
17 Correct 45 ms 63500 KB Output is correct
18 Correct 43 ms 63568 KB Output is correct
19 Correct 41 ms 63428 KB Output is correct
20 Correct 39 ms 63352 KB Output is correct
21 Correct 39 ms 63240 KB Output is correct
22 Correct 36 ms 63132 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 86092 KB Output is correct
2 Correct 187 ms 91244 KB Output is correct
3 Correct 138 ms 87076 KB Output is correct
4 Correct 317 ms 100412 KB Output is correct
5 Correct 890 ms 144476 KB Output is correct
6 Correct 42 ms 64120 KB Output is correct
7 Correct 39 ms 63304 KB Output is correct
8 Correct 40 ms 63688 KB Output is correct
9 Correct 345 ms 83156 KB Output is correct
10 Correct 269 ms 81624 KB Output is correct
11 Correct 274 ms 81072 KB Output is correct
12 Correct 309 ms 81508 KB Output is correct
13 Correct 1253 ms 224656 KB Output is correct
14 Correct 1138 ms 215332 KB Output is correct
15 Correct 1601 ms 262376 KB Output is correct
16 Correct 1542 ms 252876 KB Output is correct
17 Correct 1117 ms 215284 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 78608 KB Output is correct
2 Correct 503 ms 78540 KB Output is correct
3 Correct 456 ms 78596 KB Output is correct
4 Correct 505 ms 78696 KB Output is correct
5 Correct 476 ms 77900 KB Output is correct
6 Correct 461 ms 78572 KB Output is correct
7 Correct 371 ms 71964 KB Output is correct
8 Correct 383 ms 71880 KB Output is correct
9 Correct 451 ms 78644 KB Output is correct
10 Correct 449 ms 78592 KB Output is correct
11 Correct 466 ms 78636 KB Output is correct
12 Correct 374 ms 71900 KB Output is correct
13 Correct 318 ms 69324 KB Output is correct
14 Correct 326 ms 70224 KB Output is correct
15 Correct 360 ms 70388 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 81080 KB Output is correct
2 Correct 120 ms 81020 KB Output is correct
3 Correct 122 ms 81016 KB Output is correct
4 Correct 108 ms 81064 KB Output is correct
5 Correct 94 ms 77148 KB Output is correct
6 Correct 39 ms 63380 KB Output is correct
7 Correct 39 ms 63180 KB Output is correct
8 Correct 36 ms 63188 KB Output is correct
9 Correct 109 ms 73448 KB Output is correct
10 Correct 107 ms 73408 KB Output is correct
11 Correct 121 ms 73356 KB Output is correct
12 Correct 98 ms 72956 KB Output is correct
13 Correct 98 ms 80076 KB Output is correct
14 Correct 37 ms 63192 KB Output is correct
15 Correct 39 ms 63188 KB Output is correct
16 Correct 36 ms 63168 KB Output is correct
17 Correct 36 ms 63124 KB Output is correct
18 Correct 37 ms 63200 KB Output is correct
19 Correct 39 ms 63380 KB Output is correct
20 Correct 38 ms 63304 KB Output is correct
21 Correct 40 ms 63248 KB Output is correct
22 Correct 47 ms 63444 KB Output is correct
23 Correct 44 ms 63568 KB Output is correct
24 Correct 47 ms 63676 KB Output is correct
25 Correct 37 ms 63440 KB Output is correct
26 Correct 43 ms 63564 KB Output is correct
27 Correct 43 ms 63568 KB Output is correct
28 Correct 45 ms 63880 KB Output is correct
29 Correct 40 ms 63444 KB Output is correct
30 Correct 45 ms 63500 KB Output is correct
31 Correct 43 ms 63568 KB Output is correct
32 Correct 41 ms 63428 KB Output is correct
33 Correct 39 ms 63352 KB Output is correct
34 Correct 39 ms 63240 KB Output is correct
35 Correct 36 ms 63132 KB Output is correct
36 Correct 139 ms 86092 KB Output is correct
37 Correct 187 ms 91244 KB Output is correct
38 Correct 138 ms 87076 KB Output is correct
39 Correct 317 ms 100412 KB Output is correct
40 Correct 890 ms 144476 KB Output is correct
41 Correct 42 ms 64120 KB Output is correct
42 Correct 39 ms 63304 KB Output is correct
43 Correct 40 ms 63688 KB Output is correct
44 Correct 345 ms 83156 KB Output is correct
45 Correct 269 ms 81624 KB Output is correct
46 Correct 274 ms 81072 KB Output is correct
47 Correct 309 ms 81508 KB Output is correct
48 Correct 1253 ms 224656 KB Output is correct
49 Correct 1138 ms 215332 KB Output is correct
50 Correct 1601 ms 262376 KB Output is correct
51 Correct 1542 ms 252876 KB Output is correct
52 Correct 1117 ms 215284 KB Output is correct
53 Correct 441 ms 78608 KB Output is correct
54 Correct 503 ms 78540 KB Output is correct
55 Correct 456 ms 78596 KB Output is correct
56 Correct 505 ms 78696 KB Output is correct
57 Correct 476 ms 77900 KB Output is correct
58 Correct 461 ms 78572 KB Output is correct
59 Correct 371 ms 71964 KB Output is correct
60 Correct 383 ms 71880 KB Output is correct
61 Correct 451 ms 78644 KB Output is correct
62 Correct 449 ms 78592 KB Output is correct
63 Correct 466 ms 78636 KB Output is correct
64 Correct 374 ms 71900 KB Output is correct
65 Correct 318 ms 69324 KB Output is correct
66 Correct 326 ms 70224 KB Output is correct
67 Correct 360 ms 70388 KB Output is correct
68 Correct 37 ms 63192 KB Output is correct
69 Correct 41 ms 63068 KB Output is correct
70 Correct 579 ms 86288 KB Output is correct
71 Correct 518 ms 86304 KB Output is correct
72 Correct 539 ms 86296 KB Output is correct
73 Correct 530 ms 86272 KB Output is correct
74 Correct 724 ms 86728 KB Output is correct
75 Correct 639 ms 82364 KB Output is correct
76 Correct 440 ms 78604 KB Output is correct
77 Correct 518 ms 79068 KB Output is correct
78 Correct 565 ms 80188 KB Output is correct
79 Correct 563 ms 82420 KB Output is correct
80 Correct 636 ms 82236 KB Output is correct
81 Correct 620 ms 82692 KB Output is correct
82 Correct 352 ms 75696 KB Output is correct
83 Correct 373 ms 83000 KB Output is correct
84 Correct 421 ms 82148 KB Output is correct
85 Correct 463 ms 82244 KB Output is correct