oj.uz

Submission #363790

# Submission time Handle Problem Language Result Execution time Memory
363790 2021-02-07T09:27:37 Z Bill_00 Election Campaign (JOI15_election_campaign) C++14
10 / 100
 1000 ms 44396 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define N 100001
typedef long long ll;
const long long MOD=1000000007;
using namespace std;
struct plan{
	ll x,y,votes;
};

ll timer,m,n,l,k,sz[N],h[N],seg[N];
ll tin[N],tout[N],up[N][20];
ll in[N],out[N],tree[4*N+4];

vector<plan>path[N];
vector<ll>adj[N];

void dfs(ll node,ll par=1){
	tin[node]=++timer;
	up[node][0]=par;
	for(ll i=1;i<=l;i++){
		up[node][i]=up[up[node][i-1]][i-1];
	}
	sz[node]=1;
	for(ll x:adj[node]){
		if(x!=par){
			dfs(x,node);
			sz[node]+=sz[x];
		} 
	}
	tout[node]=++timer;
}

void dfs1(ll node,ll par,ll head){
	seg[node]=++k;
	h[node]=head;
	pair<ll,ll>bigchild={0,-1};
	for(ll x:adj[node]){
		if(x!=par) bigchild=max(bigchild,{sz[x],x});
	}
	if(bigchild.ss!=-1) dfs1(bigchild.ss,node,head);
	for(ll x:adj[node]){
		if(x!=par && x!=bigchild.ss) dfs1(x,node,x);
	}
}

bool is(ll a,ll b){
	return (tin[a]<=tin[b] && tout[b]<=tout[a]);
}

ll lca(ll a,ll b){
	if(is(a,b)) return a;
	if(is(b,a)) return b;
	for(ll i=l;i>=0;i--){
		if(!is(up[a][i],b)) a=up[a][i];
	}
	return up[a][0];
}

ll query(ll id,ll l,ll r,ll L,ll R){
	if(r<L || R<l) return 0;
	if(L<=l && r<=R) return tree[id];
	ll m=(l+r)>>1;
	return query(id*2,l,m,L,R)+query(id*2+1,m+1,r,L,R);
}

void update(ll id,ll l,ll r,ll x,ll val){
	if(l==r){
		tree[id]=val;
		return;
	}
	ll m=(l+r)>>1;
	if(m>=x) update(id*2,l,m,x,val);
	else update(id*2+1,m+1,r,x,val);
	tree[id]=tree[id*2]+tree[id*2+1];
}

ll p(ll a,ll b){
	if(is(h[a],b)) return query(1,1,k,seg[b],seg[a]);
	return query(1,1,k,seg[h[a]],seg[a])+p(up[a][0],b);
}

void solve(ll node,ll par=1){
	for(ll x:adj[node]){
		if(x!=par){
			solve(x,node);
			out[node]+=in[x];
		} 
	}
	in[node]=out[node];
	for(plan xx:path[node]){
		ll a=xx.x;
		ll b=xx.y;
		ll c=xx.votes;
		in[node]=max(in[node],p(a,node)+p(b,node)+c+out[node]);
	}
	update(1,1,k,seg[node],out[node]-in[node]);
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	l=ceil(log2(n));
	for(int i=1;i<n;i++){
		int a,b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}	
	dfs(1);
	dfs1(1,1,1);
	cin >> m;
	while(m--){
		ll a,b,c;
		cin >> a >> b >> c;
		ll x=lca(a,b);
		path[x].pb({a,b,c});
	}
	solve(1);
	cout << in[1];
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5356 KB Output is correct
5 Correct 170 ms 32108 KB Output is correct
6 Correct 88 ms 40812 KB Output is correct
7 Correct 161 ms 37868 KB Output is correct
8 Correct 113 ms 31468 KB Output is correct
9 Incorrect 194 ms 36012 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5484 KB Output is correct
4 Correct 169 ms 44268 KB Output is correct
5 Correct 173 ms 44268 KB Output is correct
6 Correct 168 ms 44268 KB Output is correct
7 Correct 179 ms 44396 KB Output is correct
8 Correct 170 ms 44292 KB Output is correct
9 Correct 166 ms 44396 KB Output is correct
10 Correct 202 ms 44300 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5484 KB Output is correct
4 Correct 169 ms 44268 KB Output is correct
5 Correct 173 ms 44268 KB Output is correct
6 Correct 168 ms 44268 KB Output is correct
7 Correct 179 ms 44396 KB Output is correct
8 Correct 170 ms 44292 KB Output is correct
9 Correct 166 ms 44396 KB Output is correct
10 Correct 202 ms 44300 KB Output is correct
11 Correct 17 ms 6380 KB Output is correct
12 Correct 176 ms 44268 KB Output is correct
13 Correct 208 ms 44396 KB Output is correct
14 Correct 162 ms 44268 KB Output is correct
15 Correct 176 ms 44396 KB Output is correct
16 Correct 170 ms 44268 KB Output is correct
17 Correct 175 ms 44268 KB Output is correct
18 Correct 174 ms 44344 KB Output is correct
19 Correct 198 ms 44268 KB Output is correct
20 Correct 206 ms 44268 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 754 ms 35104 KB Output is correct
2 Correct 161 ms 44268 KB Output is correct
3 Execution timed out 1084 ms 41128 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5356 KB Output is correct
5 Correct 170 ms 32108 KB Output is correct
6 Correct 88 ms 40812 KB Output is correct
7 Correct 161 ms 37868 KB Output is correct
8 Correct 113 ms 31468 KB Output is correct
9 Incorrect 194 ms 36012 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5356 KB Output is correct
5 Correct 170 ms 32108 KB Output is correct
6 Correct 88 ms 40812 KB Output is correct
7 Correct 161 ms 37868 KB Output is correct
8 Correct 113 ms 31468 KB Output is correct
9 Incorrect 194 ms 36012 KB Output isn't correct
10 Halted 0 ms 0 KB -