oj.uz

답안 #960518

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960518 2024-04-10T15:00:15 Z pcc Election Campaign (JOI15_election_campaign) C++17
100 / 100
 147 ms 22796 KB 
#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>
 
 
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];
	void modify(int p,ll v){
		for(;p<mxn;p+=p&-p)bit[p] += v;
		return;
	}
	ll getval(int s,int e){
		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){
		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 7512 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 37 ms 12884 KB Output is correct
6 Correct 34 ms 20564 KB Output is correct
7 Correct 39 ms 17932 KB Output is correct
8 Correct 26 ms 12624 KB Output is correct
9 Correct 39 ms 16524 KB Output is correct
10 Correct 32 ms 12628 KB Output is correct

Subtask #2
5.0 / 5.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 7772 KB Output is correct
4 Correct 60 ms 22644 KB Output is correct
5 Correct 58 ms 22612 KB Output is correct
6 Correct 72 ms 22608 KB Output is correct
7 Correct 65 ms 22608 KB Output is correct
8 Correct 59 ms 22608 KB Output is correct
9 Correct 57 ms 22608 KB Output is correct
10 Correct 61 ms 22568 KB Output is correct

Subtask #3
5.0 / 5.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 7772 KB Output is correct
4 Correct 60 ms 22644 KB Output is correct
5 Correct 58 ms 22612 KB Output is correct
6 Correct 72 ms 22608 KB Output is correct
7 Correct 65 ms 22608 KB Output is correct
8 Correct 59 ms 22608 KB Output is correct
9 Correct 57 ms 22608 KB Output is correct
10 Correct 61 ms 22568 KB Output is correct
11 Correct 7 ms 8284 KB Output is correct
12 Correct 60 ms 22796 KB Output is correct
13 Correct 62 ms 22560 KB Output is correct
14 Correct 61 ms 22656 KB Output is correct
15 Correct 70 ms 22612 KB Output is correct
16 Correct 61 ms 22608 KB Output is correct
17 Correct 62 ms 22564 KB Output is correct
18 Correct 66 ms 22708 KB Output is correct
19 Correct 63 ms 22700 KB Output is correct
20 Correct 73 ms 22596 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 14448 KB Output is correct
2 Correct 58 ms 22560 KB Output is correct
3 Correct 88 ms 19716 KB Output is correct
4 Correct 74 ms 14224 KB Output is correct
5 Correct 83 ms 19016 KB Output is correct
6 Correct 68 ms 14148 KB Output is correct
7 Correct 80 ms 18756 KB Output is correct
8 Correct 116 ms 14632 KB Output is correct
9 Correct 57 ms 22652 KB Output is correct
10 Correct 90 ms 17932 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 7512 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 37 ms 12884 KB Output is correct
6 Correct 34 ms 20564 KB Output is correct
7 Correct 39 ms 17932 KB Output is correct
8 Correct 26 ms 12624 KB Output is correct
9 Correct 39 ms 16524 KB Output is correct
10 Correct 32 ms 12628 KB Output is correct
11 Correct 2 ms 7512 KB Output is correct
12 Correct 2 ms 7600 KB Output is correct
13 Correct 3 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 7516 KB Output is correct
17 Correct 2 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 3 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 7512 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 37 ms 12884 KB Output is correct
6 Correct 34 ms 20564 KB Output is correct
7 Correct 39 ms 17932 KB Output is correct
8 Correct 26 ms 12624 KB Output is correct
9 Correct 39 ms 16524 KB Output is correct
10 Correct 32 ms 12628 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 2 ms 7772 KB Output is correct
14 Correct 60 ms 22644 KB Output is correct
15 Correct 58 ms 22612 KB Output is correct
16 Correct 72 ms 22608 KB Output is correct
17 Correct 65 ms 22608 KB Output is correct
18 Correct 59 ms 22608 KB Output is correct
19 Correct 57 ms 22608 KB Output is correct
20 Correct 61 ms 22568 KB Output is correct
21 Correct 7 ms 8284 KB Output is correct
22 Correct 60 ms 22796 KB Output is correct
23 Correct 62 ms 22560 KB Output is correct
24 Correct 61 ms 22656 KB Output is correct
25 Correct 70 ms 22612 KB Output is correct
26 Correct 61 ms 22608 KB Output is correct
27 Correct 62 ms 22564 KB Output is correct
28 Correct 66 ms 22708 KB Output is correct
29 Correct 63 ms 22700 KB Output is correct
30 Correct 73 ms 22596 KB Output is correct
31 Correct 137 ms 14448 KB Output is correct
32 Correct 58 ms 22560 KB Output is correct
33 Correct 88 ms 19716 KB Output is correct
34 Correct 74 ms 14224 KB Output is correct
35 Correct 83 ms 19016 KB Output is correct
36 Correct 68 ms 14148 KB Output is correct
37 Correct 80 ms 18756 KB Output is correct
38 Correct 116 ms 14632 KB Output is correct
39 Correct 57 ms 22652 KB Output is correct
40 Correct 90 ms 17932 KB Output is correct
41 Correct 2 ms 7512 KB Output is correct
42 Correct 2 ms 7600 KB Output is correct
43 Correct 3 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 7516 KB Output is correct
47 Correct 2 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 3 ms 7772 KB Output is correct
51 Correct 94 ms 14668 KB Output is correct
52 Correct 69 ms 22576 KB Output is correct
53 Correct 84 ms 18068 KB Output is correct
54 Correct 71 ms 14100 KB Output is correct
55 Correct 147 ms 14476 KB Output is correct
56 Correct 64 ms 22612 KB Output is correct
57 Correct 79 ms 18604 KB Output is correct
58 Correct 68 ms 14088 KB Output is correct
59 Correct 92 ms 14672 KB Output is correct
60 Correct 64 ms 22608 KB Output is correct
61 Correct 81 ms 18768 KB Output is correct
62 Correct 73 ms 14012 KB Output is correct
63 Correct 143 ms 14464 KB Output is correct
64 Correct 83 ms 22600 KB Output is correct
65 Correct 84 ms 18520 KB Output is correct
66 Correct 62 ms 14104 KB Output is correct
67 Correct 126 ms 14340 KB Output is correct
68 Correct 61 ms 22544 KB Output is correct
69 Correct 79 ms 17444 KB Output is correct
70 Correct 72 ms 14388 KB Output is correct