oj.uz

답안 #960872

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960872 2024-04-11T07:03:51 Z pcc Election Campaign (JOI15_election_campaign) C++17
100 / 100
 121 ms 26708 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];

inline char readchar() {
	const int S = 1<<20; // buffer size
	static char buf[S], *p = buf, *q = buf;
	if(p == q && (q = (p=buf)+fread(buf,1,S,stdin)) == buf) return EOF;
	return *p++;
}

inline int nextint() {
	int x = 0, c = readchar(), neg = false;
	while(('0' > c || c > '9') && c!='-' && c!=EOF) c = readchar();
	if(c == '-') neg = true, c = getchar();
	while('0' <= c && c <= '9') x = x*10 + (c^'0'), c = readchar();
	if(neg) x = -x;
	return x; // returns 0 if EOF
}

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);
		printf("%d\n",dp[1]);
		return;
	}
}

int main(){
	N = nextint();
	for(int i = 1;i<N;i++){
		int a,b;
		a = nextint(),b = nextint();
		tree[a].push_back(b);
		tree[b].push_back(a);
	}
	HLD::dfs1(1);
	HLD::dfs2(1,1);
	Q = nextint();
	while(Q--){
		int a,b,c;
		a = nextint();b = nextint();c = nextint();
		int h = HLD::LCA(a,b).fs;
		req[h].push_back(make_pair(pii(a,b),c));
	}
	CALC::GO();
}

Compilation message

election_campaign.cpp: In function 'void CALC::GO()':
election_campaign.cpp:109:12: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
  109 |   printf("%d\n",dp[1]);
      |           ~^    ~~~~~
      |            |        |
      |            int      long long int
      |           %lld

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 31 ms 15316 KB Output is correct
6 Correct 26 ms 22872 KB Output is correct
7 Correct 40 ms 20216 KB Output is correct
8 Correct 19 ms 14680 KB Output is correct
9 Correct 36 ms 18532 KB Output is correct
10 Correct 23 ms 14684 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8636 KB Output is correct
4 Correct 51 ms 26076 KB Output is correct
5 Correct 39 ms 26068 KB Output is correct
6 Correct 38 ms 26188 KB Output is correct
7 Correct 36 ms 26192 KB Output is correct
8 Correct 37 ms 26196 KB Output is correct
9 Correct 39 ms 26196 KB Output is correct
10 Correct 40 ms 26016 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8636 KB Output is correct
4 Correct 51 ms 26076 KB Output is correct
5 Correct 39 ms 26068 KB Output is correct
6 Correct 38 ms 26188 KB Output is correct
7 Correct 36 ms 26192 KB Output is correct
8 Correct 37 ms 26196 KB Output is correct
9 Correct 39 ms 26196 KB Output is correct
10 Correct 40 ms 26016 KB Output is correct
11 Correct 4 ms 9560 KB Output is correct
12 Correct 41 ms 26396 KB Output is correct
13 Correct 39 ms 26708 KB Output is correct
14 Correct 43 ms 26448 KB Output is correct
15 Correct 42 ms 26452 KB Output is correct
16 Correct 37 ms 26448 KB Output is correct
17 Correct 38 ms 26448 KB Output is correct
18 Correct 42 ms 26488 KB Output is correct
19 Correct 40 ms 26448 KB Output is correct
20 Correct 41 ms 26536 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 17952 KB Output is correct
2 Correct 36 ms 26192 KB Output is correct
3 Correct 76 ms 23184 KB Output is correct
4 Correct 51 ms 17764 KB Output is correct
5 Correct 55 ms 22604 KB Output is correct
6 Correct 45 ms 17744 KB Output is correct
7 Correct 66 ms 22240 KB Output is correct
8 Correct 85 ms 18412 KB Output is correct
9 Correct 40 ms 26240 KB Output is correct
10 Correct 59 ms 21164 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 31 ms 15316 KB Output is correct
6 Correct 26 ms 22872 KB Output is correct
7 Correct 40 ms 20216 KB Output is correct
8 Correct 19 ms 14680 KB Output is correct
9 Correct 36 ms 18532 KB Output is correct
10 Correct 23 ms 14684 KB Output is correct
11 Correct 3 ms 8536 KB Output is correct
12 Correct 3 ms 8796 KB Output is correct
13 Correct 2 ms 8636 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8636 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8796 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 31 ms 15316 KB Output is correct
6 Correct 26 ms 22872 KB Output is correct
7 Correct 40 ms 20216 KB Output is correct
8 Correct 19 ms 14680 KB Output is correct
9 Correct 36 ms 18532 KB Output is correct
10 Correct 23 ms 14684 KB Output is correct
11 Correct 2 ms 8536 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct
13 Correct 2 ms 8636 KB Output is correct
14 Correct 51 ms 26076 KB Output is correct
15 Correct 39 ms 26068 KB Output is correct
16 Correct 38 ms 26188 KB Output is correct
17 Correct 36 ms 26192 KB Output is correct
18 Correct 37 ms 26196 KB Output is correct
19 Correct 39 ms 26196 KB Output is correct
20 Correct 40 ms 26016 KB Output is correct
21 Correct 4 ms 9560 KB Output is correct
22 Correct 41 ms 26396 KB Output is correct
23 Correct 39 ms 26708 KB Output is correct
24 Correct 43 ms 26448 KB Output is correct
25 Correct 42 ms 26452 KB Output is correct
26 Correct 37 ms 26448 KB Output is correct
27 Correct 38 ms 26448 KB Output is correct
28 Correct 42 ms 26488 KB Output is correct
29 Correct 40 ms 26448 KB Output is correct
30 Correct 41 ms 26536 KB Output is correct
31 Correct 106 ms 17952 KB Output is correct
32 Correct 36 ms 26192 KB Output is correct
33 Correct 76 ms 23184 KB Output is correct
34 Correct 51 ms 17764 KB Output is correct
35 Correct 55 ms 22604 KB Output is correct
36 Correct 45 ms 17744 KB Output is correct
37 Correct 66 ms 22240 KB Output is correct
38 Correct 85 ms 18412 KB Output is correct
39 Correct 40 ms 26240 KB Output is correct
40 Correct 59 ms 21164 KB Output is correct
41 Correct 3 ms 8536 KB Output is correct
42 Correct 3 ms 8796 KB Output is correct
43 Correct 2 ms 8636 KB Output is correct
44 Correct 2 ms 8536 KB Output is correct
45 Correct 2 ms 8540 KB Output is correct
46 Correct 2 ms 8540 KB Output is correct
47 Correct 2 ms 8540 KB Output is correct
48 Correct 2 ms 8636 KB Output is correct
49 Correct 2 ms 8540 KB Output is correct
50 Correct 2 ms 8796 KB Output is correct
51 Correct 76 ms 18516 KB Output is correct
52 Correct 40 ms 26452 KB Output is correct
53 Correct 70 ms 21768 KB Output is correct
54 Correct 43 ms 18064 KB Output is correct
55 Correct 102 ms 18248 KB Output is correct
56 Correct 40 ms 26452 KB Output is correct
57 Correct 61 ms 22352 KB Output is correct
58 Correct 54 ms 17928 KB Output is correct
59 Correct 84 ms 18604 KB Output is correct
60 Correct 39 ms 26484 KB Output is correct
61 Correct 54 ms 22612 KB Output is correct
62 Correct 64 ms 17708 KB Output is correct
63 Correct 105 ms 18104 KB Output is correct
64 Correct 38 ms 26452 KB Output is correct
65 Correct 58 ms 22428 KB Output is correct
66 Correct 43 ms 17804 KB Output is correct
67 Correct 121 ms 18248 KB Output is correct
68 Correct 41 ms 26308 KB Output is correct
69 Correct 53 ms 21328 KB Output is correct
70 Correct 45 ms 17964 KB Output is correct