oj.uz

Submission #235899

# Submission time Handle Problem Language Result Execution time Memory
235899 2020-05-30T10:49:28 Z kshitij_sodani Election Campaign (JOI15_election_campaign) C++17
100 / 100
 410 ms 52348 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
llo n,m;
llo ac,bc,dd;
llo par[100001][20];
llo lev[100001];
vector<llo> adj[100001];
llo co=0;
llo st[100001];
llo en[100001];
llo dp[100001];
llo tree[400001];
llo lazy[400001];
vector<pair<pair<llo,llo>,pair<llo,llo>>> pre[100001];
vector<llo> pre2[100001];
void update(llo no,llo l,llo r,llo aa,llo bb,llo val){
	if(lazy[no]!=0){
		tree[no]+=lazy[no];
		if(l<r){
			lazy[no*2+1]+=lazy[no];
			lazy[no*2+2]+=lazy[no];
		}
		lazy[no]=0;
	}
	if(r<aa or l>bb){
		return;
	}
	if(aa<=l and r<=bb){
		tree[no]+=val;
		if(l<r){
			lazy[no*2+1]+=val;
			lazy[no*2+2]+=val;
		}
	}
	else{
		llo mid=(l+r)/2;
		update(no*2+1,l,mid,aa,bb,val);
		update(no*2+2,mid+1,r,aa,bb,val);
		tree[no]=tree[no*2+1]+tree[no*2+2];
	}
}
llo query(llo no,llo l,llo r,llo i){
	if(lazy[no]!=0){
		tree[no]+=lazy[no];
		if(l<r){
			lazy[no*2+1]+=lazy[no];
			lazy[no*2+2]+=lazy[no];
		}
		lazy[no]=0;
	}
	if(l==r){
		return tree[no];
	}
	llo mid=(l+r)/2;
	if(i<=mid){
		return query(no*2+1,l,mid,i);
	}
	else{
		return query(no*2+2,mid+1,r,i);
	}
}
llo dfs(llo no,llo par2=-1,llo levv=0){
	st[no]=co;
	co+=1;
	par[no][0]=par2;
	lev[no]=levv;
	for(auto j:adj[no]){
		if(j==par2){
			continue;
		}
		dfs(j,no,levv+1);
	}
	en[no]=co-1;
}
llo kk(llo aa,llo k){
	for(llo j=19;j>=0;j--){
		if((1<<j)&k){
			aa=par[aa][j];
		}
	}
	return aa;
}
pair<llo,pair<llo,llo>> lca(llo aa,llo bb){
	llo cc,dd;
	cc=aa;
	dd=bb;
	if(lev[aa]>lev[bb]){
		aa=kk(aa,abs(lev[bb]-lev[aa]));
		if(aa==bb){
			return {aa,{kk(cc,abs(lev[bb]-lev[cc])-1),-1}};
		}
	}
	else{
		bb=kk(bb,abs(lev[bb]-lev[aa]));
		if(aa==bb){
			return {aa,{-1,kk(dd,abs(lev[bb]-lev[dd])-1)}};
		}
	}
	for(llo j=19;j>=0;j--){
		if(par[aa][j]!=par[bb][j]){
			aa=par[aa][j];
			bb=par[bb][j];
		}
	}
	return {par[aa][0],{kk(cc,abs(lev[cc]-lev[par[aa][0]])-1),kk(dd,abs(lev[dd]-lev[par[aa][0]])-1)}};
}
llo dfs2(llo no,llo par2=-1){
	llo su=0;
	for(auto j:adj[no]){
		if(j!=par2){
			dfs2(j,no);
			su+=dp[j];
		}
	}
	dp[no]=su;
	for(llo j=0;j<pre[no].size();j++){
		pair<pair<llo,llo>,pair<llo,llo>> kk=pre[no][j];
		llo cost=pre2[no][j];
		if(kk.b.a==-1){
			cost+=su;
			cost-=dp[kk.b.b];

			cost+=query(0,0,n-1,st[kk.a.b]);
		}
		else if(kk.b.b==-1){
			cost+=su;
			cost-=dp[kk.b.a];
			cost+=query(0,0,n-1,st[kk.a.a]);
		}
		else{
			cost+=su;
			cost-=dp[kk.b.b];
			cost-=dp[kk.b.a];
			cost+=query(0,0,n-1,st[kk.a.b]);
			cost+=query(0,0,n-1,st[kk.a.a]);
		}
		dp[no]=max(dp[no],cost);
	}
	update(0,0,n-1,st[no],st[no],su);
	for(auto j:adj[no]){
		if(j==par2){
			continue;
		}
		update(0,0,n-1,st[j],en[j],su-dp[j]);
	}
}

int main(){
	memset(tree,0,sizeof(tree));
	memset(lazy,0,sizeof(lazy));
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(llo i=0;i<n-1;i++){
		cin>>ac>>bc;
		adj[ac-1].pb(bc-1);
		adj[bc-1].pb(ac-1);
	}
	dfs(0);
	cin>>m;
	for(llo j=1;j<20;j++){
		for(llo i=0;i<n;i++){
			if(par[i][j-1]==-1){
				par[i][j]=-1;
			}
			else{
				par[i][j]=par[par[i][j-1]][j-1];
			}
		}
	}
	for(llo i=0;i<m;i++){
		cin>>ac>>bc>>dd;
		pair<llo,pair<llo,llo>> cc=lca(ac-1,bc-1);
		pre[cc.a].pb({{ac-1,bc-1},cc.b});
		pre2[cc.a].pb(dd);
	//	cout<<cc.a<<","<<cc.b.a<<","<<cc.b.b<<endl;
	}
	dfs2(0);

	cout<<dp[0]<<endl;


	
	return 0;
}

Compilation message

election_campaign.cpp: In function 'llo dfs(llo, llo, llo)':
election_campaign.cpp:79:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
election_campaign.cpp: In function 'llo dfs2(llo, llo)':
election_campaign.cpp:121:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(llo j=0;j<pre[no].size();j++){
              ~^~~~~~~~~~~~~~~
election_campaign.cpp:151:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 13696 KB Output is correct
2 Correct 11 ms 13568 KB Output is correct
3 Correct 12 ms 13696 KB Output is correct
4 Correct 13 ms 13952 KB Output is correct
5 Correct 166 ms 36344 KB Output is correct
6 Correct 119 ms 44536 KB Output is correct
7 Correct 157 ms 42232 KB Output is correct
8 Correct 135 ms 37624 KB Output is correct
9 Correct 161 ms 40692 KB Output is correct
10 Correct 139 ms 37624 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 13696 KB Output is correct
2 Correct 12 ms 13696 KB Output is correct
3 Correct 13 ms 13952 KB Output is correct
4 Correct 254 ms 49732 KB Output is correct
5 Correct 259 ms 49656 KB Output is correct
6 Correct 217 ms 49512 KB Output is correct
7 Correct 258 ms 49528 KB Output is correct
8 Correct 254 ms 49656 KB Output is correct
9 Correct 213 ms 49528 KB Output is correct
10 Correct 255 ms 49528 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 13696 KB Output is correct
2 Correct 12 ms 13696 KB Output is correct
3 Correct 13 ms 13952 KB Output is correct
4 Correct 254 ms 49732 KB Output is correct
5 Correct 259 ms 49656 KB Output is correct
6 Correct 217 ms 49512 KB Output is correct
7 Correct 258 ms 49528 KB Output is correct
8 Correct 254 ms 49656 KB Output is correct
9 Correct 213 ms 49528 KB Output is correct
10 Correct 255 ms 49528 KB Output is correct
11 Correct 25 ms 15360 KB Output is correct
12 Correct 235 ms 49528 KB Output is correct
13 Correct 268 ms 49568 KB Output is correct
14 Correct 238 ms 49656 KB Output is correct
15 Correct 247 ms 49528 KB Output is correct
16 Correct 221 ms 49528 KB Output is correct
17 Correct 245 ms 49528 KB Output is correct
18 Correct 258 ms 49528 KB Output is correct
19 Correct 236 ms 49532 KB Output is correct
20 Correct 266 ms 49656 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 41060 KB Output is correct
2 Correct 233 ms 52088 KB Output is correct
3 Correct 365 ms 49144 KB Output is correct
4 Correct 214 ms 44264 KB Output is correct
5 Correct 313 ms 48624 KB Output is correct
6 Correct 228 ms 44256 KB Output is correct
7 Correct 369 ms 48104 KB Output is correct
8 Correct 302 ms 44124 KB Output is correct
9 Correct 210 ms 52088 KB Output is correct
10 Correct 375 ms 47056 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 13696 KB Output is correct
2 Correct 11 ms 13568 KB Output is correct
3 Correct 12 ms 13696 KB Output is correct
4 Correct 13 ms 13952 KB Output is correct
5 Correct 166 ms 36344 KB Output is correct
6 Correct 119 ms 44536 KB Output is correct
7 Correct 157 ms 42232 KB Output is correct
8 Correct 135 ms 37624 KB Output is correct
9 Correct 161 ms 40692 KB Output is correct
10 Correct 139 ms 37624 KB Output is correct
11 Correct 13 ms 14080 KB Output is correct
12 Correct 13 ms 14080 KB Output is correct
13 Correct 13 ms 14080 KB Output is correct
14 Correct 13 ms 13952 KB Output is correct
15 Correct 13 ms 14080 KB Output is correct
16 Correct 13 ms 13952 KB Output is correct
17 Correct 13 ms 13952 KB Output is correct
18 Correct 14 ms 14080 KB Output is correct
19 Correct 13 ms 14080 KB Output is correct
20 Correct 13 ms 14080 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 13696 KB Output is correct
2 Correct 11 ms 13568 KB Output is correct
3 Correct 12 ms 13696 KB Output is correct
4 Correct 13 ms 13952 KB Output is correct
5 Correct 166 ms 36344 KB Output is correct
6 Correct 119 ms 44536 KB Output is correct
7 Correct 157 ms 42232 KB Output is correct
8 Correct 135 ms 37624 KB Output is correct
9 Correct 161 ms 40692 KB Output is correct
10 Correct 139 ms 37624 KB Output is correct
11 Correct 12 ms 13696 KB Output is correct
12 Correct 12 ms 13696 KB Output is correct
13 Correct 13 ms 13952 KB Output is correct
14 Correct 254 ms 49732 KB Output is correct
15 Correct 259 ms 49656 KB Output is correct
16 Correct 217 ms 49512 KB Output is correct
17 Correct 258 ms 49528 KB Output is correct
18 Correct 254 ms 49656 KB Output is correct
19 Correct 213 ms 49528 KB Output is correct
20 Correct 255 ms 49528 KB Output is correct
21 Correct 25 ms 15360 KB Output is correct
22 Correct 235 ms 49528 KB Output is correct
23 Correct 268 ms 49568 KB Output is correct
24 Correct 238 ms 49656 KB Output is correct
25 Correct 247 ms 49528 KB Output is correct
26 Correct 221 ms 49528 KB Output is correct
27 Correct 245 ms 49528 KB Output is correct
28 Correct 258 ms 49528 KB Output is correct
29 Correct 236 ms 49532 KB Output is correct
30 Correct 266 ms 49656 KB Output is correct
31 Correct 276 ms 41060 KB Output is correct
32 Correct 233 ms 52088 KB Output is correct
33 Correct 365 ms 49144 KB Output is correct
34 Correct 214 ms 44264 KB Output is correct
35 Correct 313 ms 48624 KB Output is correct
36 Correct 228 ms 44256 KB Output is correct
37 Correct 369 ms 48104 KB Output is correct
38 Correct 302 ms 44124 KB Output is correct
39 Correct 210 ms 52088 KB Output is correct
40 Correct 375 ms 47056 KB Output is correct
41 Correct 13 ms 14080 KB Output is correct
42 Correct 13 ms 14080 KB Output is correct
43 Correct 13 ms 14080 KB Output is correct
44 Correct 13 ms 13952 KB Output is correct
45 Correct 13 ms 14080 KB Output is correct
46 Correct 13 ms 13952 KB Output is correct
47 Correct 13 ms 13952 KB Output is correct
48 Correct 14 ms 14080 KB Output is correct
49 Correct 13 ms 14080 KB Output is correct
50 Correct 13 ms 14080 KB Output is correct
51 Correct 279 ms 44656 KB Output is correct
52 Correct 285 ms 52216 KB Output is correct
53 Correct 410 ms 47332 KB Output is correct
54 Correct 207 ms 44136 KB Output is correct
55 Correct 277 ms 44004 KB Output is correct
56 Correct 249 ms 52348 KB Output is correct
57 Correct 339 ms 48632 KB Output is correct
58 Correct 219 ms 44008 KB Output is correct
59 Correct 288 ms 44392 KB Output is correct
60 Correct 262 ms 52216 KB Output is correct
61 Correct 310 ms 48496 KB Output is correct
62 Correct 224 ms 44260 KB Output is correct
63 Correct 273 ms 43484 KB Output is correct
64 Correct 247 ms 52344 KB Output is correct
65 Correct 388 ms 48244 KB Output is correct
66 Correct 212 ms 44124 KB Output is correct
67 Correct 261 ms 43992 KB Output is correct
68 Correct 238 ms 52216 KB Output is correct
69 Correct 328 ms 47244 KB Output is correct
70 Correct 220 ms 43716 KB Output is correct