답안 #960517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
960517	2024-04-10T14:59:46 Z	pcc	Election Campaign (JOI15_election_campaign)	C++17	100 / 100	103 ms	42704 KB

election_campaign

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#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;
	}
	pll LCA(int a,int b){
		pll re = pll(0,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.sc += getval(idx[ta],idx[a]);
			a = par[ta];ta = link_top[a];
		}
		if(idx[a]>idx[b])swap(a,b);
		re.sc += getval(idx[a],idx[b]);
		re.fs = a;
		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).sc+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::LCA(a,b).fs;
		req[h].push_back(make_pair(pii(a,b),c));
	}
	CALC::GO();
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	7516 KB	Output is correct
2	Correct	2 ms	7516 KB	Output is correct
3	Correct	2 ms	7516 KB	Output is correct
4	Correct	2 ms	7516 KB	Output is correct
5	Correct	42 ms	13140 KB	Output is correct
6	Correct	42 ms	37972 KB	Output is correct
7	Correct	47 ms	29148 KB	Output is correct
8	Correct	36 ms	12880 KB	Output is correct
9	Correct	53 ms	24368 KB	Output is correct
10	Correct	35 ms	12624 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	7512 KB	Output is correct
2	Correct	2 ms	7516 KB	Output is correct
3	Correct	2 ms	7912 KB	Output is correct
4	Correct	71 ms	39912 KB	Output is correct
5	Correct	72 ms	40016 KB	Output is correct
6	Correct	66 ms	39904 KB	Output is correct
7	Correct	66 ms	39920 KB	Output is correct
8	Correct	72 ms	40104 KB	Output is correct
9	Correct	64 ms	39840 KB	Output is correct
10	Correct	68 ms	39796 KB	Output is correct

Subtask #3
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	7512 KB	Output is correct
2	Correct	2 ms	7516 KB	Output is correct
3	Correct	2 ms	7912 KB	Output is correct
4	Correct	71 ms	39912 KB	Output is correct
5	Correct	72 ms	40016 KB	Output is correct
6	Correct	66 ms	39904 KB	Output is correct
7	Correct	66 ms	39920 KB	Output is correct
8	Correct	72 ms	40104 KB	Output is correct
9	Correct	64 ms	39840 KB	Output is correct
10	Correct	68 ms	39796 KB	Output is correct
11	Correct	6 ms	8284 KB	Output is correct
12	Correct	75 ms	40016 KB	Output is correct
13	Correct	71 ms	40032 KB	Output is correct
14	Correct	75 ms	40016 KB	Output is correct
15	Correct	74 ms	39916 KB	Output is correct
16	Correct	67 ms	39872 KB	Output is correct
17	Correct	76 ms	40020 KB	Output is correct
18	Correct	81 ms	39964 KB	Output is correct
19	Correct	73 ms	40016 KB	Output is correct
20	Correct	68 ms	40020 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	77 ms	14596 KB	Output is correct
2	Correct	77 ms	40200 KB	Output is correct
3	Correct	93 ms	31560 KB	Output is correct
4	Correct	66 ms	16644 KB	Output is correct
5	Correct	74 ms	31196 KB	Output is correct
6	Correct	61 ms	16580 KB	Output is correct
7	Correct	87 ms	30528 KB	Output is correct
8	Correct	74 ms	17200 KB	Output is correct
9	Correct	78 ms	42320 KB	Output is correct
10	Correct	78 ms	27604 KB	Output is correct

Subtask #5
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	7516 KB	Output is correct
2	Correct	2 ms	7516 KB	Output is correct
3	Correct	2 ms	7516 KB	Output is correct
4	Correct	2 ms	7516 KB	Output is correct
5	Correct	42 ms	13140 KB	Output is correct
6	Correct	42 ms	37972 KB	Output is correct
7	Correct	47 ms	29148 KB	Output is correct
8	Correct	36 ms	12880 KB	Output is correct
9	Correct	53 ms	24368 KB	Output is correct
10	Correct	35 ms	12624 KB	Output is correct
11	Correct	2 ms	7516 KB	Output is correct
12	Correct	2 ms	7768 KB	Output is correct
13	Correct	2 ms	7772 KB	Output is correct
14	Correct	2 ms	7516 KB	Output is correct
15	Correct	2 ms	7516 KB	Output is correct
16	Correct	2 ms	7772 KB	Output is correct
17	Correct	3 ms	7516 KB	Output is correct
18	Correct	2 ms	7772 KB	Output is correct
19	Correct	2 ms	7516 KB	Output is correct
20	Correct	2 ms	7772 KB	Output is correct

Subtask #6
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	7516 KB	Output is correct
2	Correct	2 ms	7516 KB	Output is correct
3	Correct	2 ms	7516 KB	Output is correct
4	Correct	2 ms	7516 KB	Output is correct
5	Correct	42 ms	13140 KB	Output is correct
6	Correct	42 ms	37972 KB	Output is correct
7	Correct	47 ms	29148 KB	Output is correct
8	Correct	36 ms	12880 KB	Output is correct
9	Correct	53 ms	24368 KB	Output is correct
10	Correct	35 ms	12624 KB	Output is correct
11	Correct	2 ms	7512 KB	Output is correct
12	Correct	2 ms	7516 KB	Output is correct
13	Correct	2 ms	7912 KB	Output is correct
14	Correct	71 ms	39912 KB	Output is correct
15	Correct	72 ms	40016 KB	Output is correct
16	Correct	66 ms	39904 KB	Output is correct
17	Correct	66 ms	39920 KB	Output is correct
18	Correct	72 ms	40104 KB	Output is correct
19	Correct	64 ms	39840 KB	Output is correct
20	Correct	68 ms	39796 KB	Output is correct
21	Correct	6 ms	8284 KB	Output is correct
22	Correct	75 ms	40016 KB	Output is correct
23	Correct	71 ms	40032 KB	Output is correct
24	Correct	75 ms	40016 KB	Output is correct
25	Correct	74 ms	39916 KB	Output is correct
26	Correct	67 ms	39872 KB	Output is correct
27	Correct	76 ms	40020 KB	Output is correct
28	Correct	81 ms	39964 KB	Output is correct
29	Correct	73 ms	40016 KB	Output is correct
30	Correct	68 ms	40020 KB	Output is correct
31	Correct	77 ms	14596 KB	Output is correct
32	Correct	77 ms	40200 KB	Output is correct
33	Correct	93 ms	31560 KB	Output is correct
34	Correct	66 ms	16644 KB	Output is correct
35	Correct	74 ms	31196 KB	Output is correct
36	Correct	61 ms	16580 KB	Output is correct
37	Correct	87 ms	30528 KB	Output is correct
38	Correct	74 ms	17200 KB	Output is correct
39	Correct	78 ms	42320 KB	Output is correct
40	Correct	78 ms	27604 KB	Output is correct
41	Correct	2 ms	7516 KB	Output is correct
42	Correct	2 ms	7768 KB	Output is correct
43	Correct	2 ms	7772 KB	Output is correct
44	Correct	2 ms	7516 KB	Output is correct
45	Correct	2 ms	7516 KB	Output is correct
46	Correct	2 ms	7772 KB	Output is correct
47	Correct	3 ms	7516 KB	Output is correct
48	Correct	2 ms	7772 KB	Output is correct
49	Correct	2 ms	7516 KB	Output is correct
50	Correct	2 ms	7772 KB	Output is correct
51	Correct	103 ms	17528 KB	Output is correct
52	Correct	78 ms	42656 KB	Output is correct
53	Correct	86 ms	28428 KB	Output is correct
54	Correct	60 ms	17040 KB	Output is correct
55	Correct	92 ms	17312 KB	Output is correct
56	Correct	74 ms	42612 KB	Output is correct
57	Correct	80 ms	29856 KB	Output is correct
58	Correct	59 ms	16748 KB	Output is correct
59	Correct	82 ms	17632 KB	Output is correct
60	Correct	69 ms	42576 KB	Output is correct
61	Correct	85 ms	30288 KB	Output is correct
62	Correct	64 ms	16640 KB	Output is correct
63	Correct	87 ms	17160 KB	Output is correct
64	Correct	70 ms	42580 KB	Output is correct
65	Correct	81 ms	30332 KB	Output is correct
66	Correct	54 ms	17036 KB	Output is correct
67	Correct	101 ms	17216 KB	Output is correct
68	Correct	71 ms	42704 KB	Output is correct
69	Correct	92 ms	26448 KB	Output is correct
70	Correct	58 ms	16948 KB	Output is correct

답안 #960517

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 5.0 / 5.0

Subtask #3 5.0 / 5.0

Subtask #4 30.0 / 30.0

Subtask #5 10.0 / 10.0

Subtask #6 40.0 / 40.0

Subtask #1
10.0 / 10.0

Subtask #2
5.0 / 5.0

Subtask #3
5.0 / 5.0

Subtask #4
30.0 / 30.0

Subtask #5
10.0 / 10.0

Subtask #6
40.0 / 40.0