oj.uz

답안 #960716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960716 2024-04-11T01:08:35 Z pcc Election Campaign (JOI15_election_campaign) C++17
100 / 100
 95 ms 29012 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,rt;
 
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(rt);
		cout<<dp[rt]<<'\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);
	}
  rt = min(N,(N+3)>>1);
	HLD::dfs1(rt);
	HLD::dfs2(rt,rt);
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 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 8792 KB Output is correct
5 Correct 36 ms 11828 KB Output is correct
6 Correct 35 ms 24156 KB Output is correct
7 Correct 54 ms 21152 KB Output is correct
8 Correct 28 ms 12124 KB Output is correct
9 Correct 39 ms 20600 KB Output is correct
10 Correct 31 ms 12124 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 56 ms 26208 KB Output is correct
5 Correct 69 ms 26312 KB Output is correct
6 Correct 56 ms 26196 KB Output is correct
7 Correct 70 ms 26192 KB Output is correct
8 Correct 57 ms 26192 KB Output is correct
9 Correct 58 ms 26228 KB Output is correct
10 Correct 59 ms 26272 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 56 ms 26208 KB Output is correct
5 Correct 69 ms 26312 KB Output is correct
6 Correct 56 ms 26196 KB Output is correct
7 Correct 70 ms 26192 KB Output is correct
8 Correct 57 ms 26192 KB Output is correct
9 Correct 58 ms 26228 KB Output is correct
10 Correct 59 ms 26272 KB Output is correct
11 Correct 8 ms 9052 KB Output is correct
12 Correct 61 ms 26192 KB Output is correct
13 Correct 64 ms 26080 KB Output is correct
14 Correct 67 ms 26192 KB Output is correct
15 Correct 78 ms 26192 KB Output is correct
16 Correct 60 ms 26196 KB Output is correct
17 Correct 57 ms 26192 KB Output is correct
18 Correct 70 ms 26192 KB Output is correct
19 Correct 57 ms 26196 KB Output is correct
20 Correct 58 ms 26192 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 13452 KB Output is correct
2 Correct 56 ms 26324 KB Output is correct
3 Correct 95 ms 27232 KB Output is correct
4 Correct 59 ms 13656 KB Output is correct
5 Correct 70 ms 23004 KB Output is correct
6 Correct 57 ms 13772 KB Output is correct
7 Correct 78 ms 28728 KB Output is correct
8 Correct 73 ms 13456 KB Output is correct
9 Correct 57 ms 26316 KB Output is correct
10 Correct 75 ms 28416 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 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 8792 KB Output is correct
5 Correct 36 ms 11828 KB Output is correct
6 Correct 35 ms 24156 KB Output is correct
7 Correct 54 ms 21152 KB Output is correct
8 Correct 28 ms 12124 KB Output is correct
9 Correct 39 ms 20600 KB Output is correct
10 Correct 31 ms 12124 KB Output is correct
11 Correct 3 ms 8552 KB Output is correct
12 Correct 3 ms 8540 KB Output is correct
13 Correct 2 ms 8696 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Correct 3 ms 8536 KB Output is correct
16 Correct 3 ms 8536 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 3 ms 8628 KB Output is correct
19 Correct 2 ms 8588 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 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 8792 KB Output is correct
5 Correct 36 ms 11828 KB Output is correct
6 Correct 35 ms 24156 KB Output is correct
7 Correct 54 ms 21152 KB Output is correct
8 Correct 28 ms 12124 KB Output is correct
9 Correct 39 ms 20600 KB Output is correct
10 Correct 31 ms 12124 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 56 ms 26208 KB Output is correct
15 Correct 69 ms 26312 KB Output is correct
16 Correct 56 ms 26196 KB Output is correct
17 Correct 70 ms 26192 KB Output is correct
18 Correct 57 ms 26192 KB Output is correct
19 Correct 58 ms 26228 KB Output is correct
20 Correct 59 ms 26272 KB Output is correct
21 Correct 8 ms 9052 KB Output is correct
22 Correct 61 ms 26192 KB Output is correct
23 Correct 64 ms 26080 KB Output is correct
24 Correct 67 ms 26192 KB Output is correct
25 Correct 78 ms 26192 KB Output is correct
26 Correct 60 ms 26196 KB Output is correct
27 Correct 57 ms 26192 KB Output is correct
28 Correct 70 ms 26192 KB Output is correct
29 Correct 57 ms 26196 KB Output is correct
30 Correct 58 ms 26192 KB Output is correct
31 Correct 77 ms 13452 KB Output is correct
32 Correct 56 ms 26324 KB Output is correct
33 Correct 95 ms 27232 KB Output is correct
34 Correct 59 ms 13656 KB Output is correct
35 Correct 70 ms 23004 KB Output is correct
36 Correct 57 ms 13772 KB Output is correct
37 Correct 78 ms 28728 KB Output is correct
38 Correct 73 ms 13456 KB Output is correct
39 Correct 57 ms 26316 KB Output is correct
40 Correct 75 ms 28416 KB Output is correct
41 Correct 3 ms 8552 KB Output is correct
42 Correct 3 ms 8540 KB Output is correct
43 Correct 2 ms 8696 KB Output is correct
44 Correct 3 ms 8540 KB Output is correct
45 Correct 3 ms 8536 KB Output is correct
46 Correct 3 ms 8536 KB Output is correct
47 Correct 2 ms 8540 KB Output is correct
48 Correct 3 ms 8628 KB Output is correct
49 Correct 2 ms 8588 KB Output is correct
50 Correct 2 ms 8540 KB Output is correct
51 Correct 79 ms 13840 KB Output is correct
52 Correct 60 ms 26196 KB Output is correct
53 Correct 80 ms 26144 KB Output is correct
54 Correct 53 ms 13860 KB Output is correct
55 Correct 80 ms 13424 KB Output is correct
56 Correct 62 ms 26288 KB Output is correct
57 Correct 74 ms 29012 KB Output is correct
58 Correct 61 ms 13572 KB Output is correct
59 Correct 70 ms 13504 KB Output is correct
60 Correct 68 ms 26332 KB Output is correct
61 Correct 75 ms 21896 KB Output is correct
62 Correct 57 ms 13740 KB Output is correct
63 Correct 79 ms 13224 KB Output is correct
64 Correct 59 ms 26224 KB Output is correct
65 Correct 84 ms 27428 KB Output is correct
66 Correct 53 ms 13848 KB Output is correct
67 Correct 82 ms 13064 KB Output is correct
68 Correct 64 ms 26324 KB Output is correct
69 Correct 71 ms 23640 KB Output is correct
70 Correct 52 ms 13712 KB Output is correct