oj.uz

Submission #960520

# Submission time Handle Problem Language Result Execution time Memory
960520 2024-04-10T15:03:27 Z pcc Election Campaign (JOI15_election_campaign) C++17
100 / 100
 91 ms 38860 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll int
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("popcnt,sse4,avx2")

const int mxn = 1e5+10;
int N,Q;

vector<int> tree[mxn];
vector<pair<pii,int>> req[mxn];

namespace HLD{
	int idx[mxn],link_top[mxn],par[mxn],dep[mxn],bs[mxn],sz[mxn];
	ll bit[mxn];
	bitset<mxn> done;
	void modify(int p,ll v){
		done[p] = true;
		bit[p] = bit[p+1]+v;
		return;
		/*
		for(;p<mxn;p+=p&-p)bit[p] += v;
		return;

	   */
	}
	ll getval(int s,int e){
		if(!done[s])return bit[s+1]-bit[e+1];
		return bit[s]-bit[e+1];
		/*
		int re = 0;
		for(;e>0;e-= e&-e)re += bit[e];
		s--;
		for(;s>0;s-= s&-s)re -= bit[s];
		return re;

	   */
	}
	int cnt = 0;
	void dfs1(int now){
		sz[now] = 1;
		for(auto nxt:tree[now]){
			if(nxt == par[now])continue;
			par[nxt] = now;
			dep[nxt] = dep[now]+1;
			dfs1(nxt);
			sz[now] += sz[nxt];
			if(!bs[now]||sz[bs[now]]<sz[nxt])bs[now] = nxt;
		}
		return;
	}
	void dfs2(int now,int top){
		idx[now] = ++cnt;
		link_top[now] = top;
		if(bs[now])dfs2(bs[now],top);
		for(auto nxt:tree[now]){
			if(nxt == par[now]||nxt == bs[now])continue;
			dfs2(nxt,nxt);
		}
		return;
	}
	int LCA1(int a,int b){
		int ta = link_top[a],tb = link_top[b];
		while(ta != tb){
			if(dep[ta]<dep[tb]){
				swap(a,b);
				swap(ta,tb);
			}
			a = par[ta];ta = link_top[a];
		}
		return (idx[a]<idx[b]?a:b);
	}
	int LCA(int a,int b){
		int re = 0;
		int ta = link_top[a],tb = link_top[b];
		while(ta != tb){
			if(dep[ta]<dep[tb]){
				swap(a,b);
				swap(ta,tb);
			}
			re += getval(idx[ta],idx[a]);
			a = par[ta];ta = link_top[a];
		}
		if(idx[a]>idx[b])swap(a,b);
		re += getval(idx[a],idx[b]);
		return re;
	}
}

namespace CALC{
	ll ans = 0;
	ll sum[mxn],dp[mxn];
	void dfs(int now){
		sort(tree[now].begin(),tree[now].end(),[](int a,int b){return HLD::idx[a]>HLD::idx[b];});
		for(auto nxt:tree[now]){
			if(nxt == HLD::par[now])continue;
			dfs(nxt);
			sum[now] += dp[nxt];
		}
		dp[now] = max(dp[now],sum[now]);
		for(auto &i:req[now]){
			auto [a,b] = i.fs;
			int w = i.sc;
			ll ts = sum[now]+HLD::LCA(a,b)+w;
			dp[now] = max(dp[now],ts);
		}
		HLD::modify(HLD::idx[now],sum[now]-dp[now]);
	}
	void GO(){
		dfs(1);
		cout<<dp[1]<<'\n';
		return;
	}
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N;
	for(int i = 1;i<N;i++){
		int a,b;
		cin>>a>>b;
		tree[a].push_back(b);
		tree[b].push_back(a);
	}
	HLD::dfs1(1);
	HLD::dfs2(1,1);
	cin>>Q;
	while(Q--){
		int a,b,c;
		cin>>a>>b>>c;
		int h = HLD::LCA1(a,b);
		req[h].push_back(make_pair(pii(a,b),c));
	}
	CALC::GO();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8536 KB Output is correct
5 Correct 38 ms 11860 KB Output is correct
6 Correct 44 ms 36776 KB Output is correct
7 Correct 45 ms 27956 KB Output is correct
8 Correct 28 ms 12120 KB Output is correct
9 Correct 58 ms 23128 KB Output is correct
10 Correct 32 ms 12168 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8620 KB Output is correct
4 Correct 67 ms 38764 KB Output is correct
5 Correct 66 ms 38768 KB Output is correct
6 Correct 73 ms 38628 KB Output is correct
7 Correct 65 ms 38740 KB Output is correct
8 Correct 78 ms 38684 KB Output is correct
9 Correct 71 ms 38736 KB Output is correct
10 Correct 67 ms 38740 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8620 KB Output is correct
4 Correct 67 ms 38764 KB Output is correct
5 Correct 66 ms 38768 KB Output is correct
6 Correct 73 ms 38628 KB Output is correct
7 Correct 65 ms 38740 KB Output is correct
8 Correct 78 ms 38684 KB Output is correct
9 Correct 71 ms 38736 KB Output is correct
10 Correct 67 ms 38740 KB Output is correct
11 Correct 7 ms 9304 KB Output is correct
12 Correct 74 ms 38792 KB Output is correct
13 Correct 68 ms 38860 KB Output is correct
14 Correct 74 ms 38728 KB Output is correct
15 Correct 85 ms 38716 KB Output is correct
16 Correct 72 ms 38660 KB Output is correct
17 Correct 65 ms 38716 KB Output is correct
18 Correct 71 ms 38736 KB Output is correct
19 Correct 67 ms 38736 KB Output is correct
20 Correct 81 ms 38772 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 13324 KB Output is correct
2 Correct 70 ms 38820 KB Output is correct
3 Correct 85 ms 29260 KB Output is correct
4 Correct 56 ms 13908 KB Output is correct
5 Correct 71 ms 27484 KB Output is correct
6 Correct 68 ms 13772 KB Output is correct
7 Correct 85 ms 26972 KB Output is correct
8 Correct 72 ms 13648 KB Output is correct
9 Correct 75 ms 38724 KB Output is correct
10 Correct 78 ms 24076 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8536 KB Output is correct
5 Correct 38 ms 11860 KB Output is correct
6 Correct 44 ms 36776 KB Output is correct
7 Correct 45 ms 27956 KB Output is correct
8 Correct 28 ms 12120 KB Output is correct
9 Correct 58 ms 23128 KB Output is correct
10 Correct 32 ms 12168 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 3 ms 8796 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 3 ms 8540 KB Output is correct
18 Correct 3 ms 8536 KB Output is correct
19 Correct 2 ms 8360 KB Output is correct
20 Correct 3 ms 8796 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8536 KB Output is correct
5 Correct 38 ms 11860 KB Output is correct
6 Correct 44 ms 36776 KB Output is correct
7 Correct 45 ms 27956 KB Output is correct
8 Correct 28 ms 12120 KB Output is correct
9 Correct 58 ms 23128 KB Output is correct
10 Correct 32 ms 12168 KB Output is correct
11 Correct 2 ms 8280 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8620 KB Output is correct
14 Correct 67 ms 38764 KB Output is correct
15 Correct 66 ms 38768 KB Output is correct
16 Correct 73 ms 38628 KB Output is correct
17 Correct 65 ms 38740 KB Output is correct
18 Correct 78 ms 38684 KB Output is correct
19 Correct 71 ms 38736 KB Output is correct
20 Correct 67 ms 38740 KB Output is correct
21 Correct 7 ms 9304 KB Output is correct
22 Correct 74 ms 38792 KB Output is correct
23 Correct 68 ms 38860 KB Output is correct
24 Correct 74 ms 38728 KB Output is correct
25 Correct 85 ms 38716 KB Output is correct
26 Correct 72 ms 38660 KB Output is correct
27 Correct 65 ms 38716 KB Output is correct
28 Correct 71 ms 38736 KB Output is correct
29 Correct 67 ms 38736 KB Output is correct
30 Correct 81 ms 38772 KB Output is correct
31 Correct 83 ms 13324 KB Output is correct
32 Correct 70 ms 38820 KB Output is correct
33 Correct 85 ms 29260 KB Output is correct
34 Correct 56 ms 13908 KB Output is correct
35 Correct 71 ms 27484 KB Output is correct
36 Correct 68 ms 13772 KB Output is correct
37 Correct 85 ms 26972 KB Output is correct
38 Correct 72 ms 13648 KB Output is correct
39 Correct 75 ms 38724 KB Output is correct
40 Correct 78 ms 24076 KB Output is correct
41 Correct 3 ms 8540 KB Output is correct
42 Correct 3 ms 8796 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct
45 Correct 2 ms 8540 KB Output is correct
46 Correct 3 ms 8540 KB Output is correct
47 Correct 3 ms 8540 KB Output is correct
48 Correct 3 ms 8536 KB Output is correct
49 Correct 2 ms 8360 KB Output is correct
50 Correct 3 ms 8796 KB Output is correct
51 Correct 88 ms 13540 KB Output is correct
52 Correct 76 ms 38704 KB Output is correct
53 Correct 76 ms 24516 KB Output is correct
54 Correct 57 ms 13708 KB Output is correct
55 Correct 89 ms 13328 KB Output is correct
56 Correct 75 ms 38736 KB Output is correct
57 Correct 78 ms 25908 KB Output is correct
58 Correct 59 ms 13700 KB Output is correct
59 Correct 69 ms 13500 KB Output is correct
60 Correct 76 ms 38844 KB Output is correct
61 Correct 77 ms 26400 KB Output is correct
62 Correct 60 ms 13532 KB Output is correct
63 Correct 80 ms 13240 KB Output is correct
64 Correct 72 ms 38768 KB Output is correct
65 Correct 91 ms 26344 KB Output is correct
66 Correct 54 ms 13712 KB Output is correct
67 Correct 85 ms 13512 KB Output is correct
68 Correct 78 ms 38744 KB Output is correct
69 Correct 87 ms 22504 KB Output is correct
70 Correct 53 ms 14132 KB Output is correct