oj.uz

답안 #960724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960724 2024-04-11T01:25:55 Z pcc Election Campaign (JOI15_election_campaign) C++17
100 / 100
 117 ms 23816 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 2 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 32 ms 14072 KB Output is correct
6 Correct 23 ms 21588 KB Output is correct
7 Correct 31 ms 19164 KB Output is correct
8 Correct 20 ms 13656 KB Output is correct
9 Correct 27 ms 17488 KB Output is correct
10 Correct 18 ms 13640 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 8540 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 45 ms 23744 KB Output is correct
5 Correct 37 ms 23808 KB Output is correct
6 Correct 35 ms 23600 KB Output is correct
7 Correct 38 ms 23772 KB Output is correct
8 Correct 36 ms 23636 KB Output is correct
9 Correct 35 ms 23696 KB Output is correct
10 Correct 38 ms 23632 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 8540 KB Output is correct
3 Correct 2 ms 8792 KB Output is correct
4 Correct 45 ms 23744 KB Output is correct
5 Correct 37 ms 23808 KB Output is correct
6 Correct 35 ms 23600 KB Output is correct
7 Correct 38 ms 23772 KB Output is correct
8 Correct 36 ms 23636 KB Output is correct
9 Correct 35 ms 23696 KB Output is correct
10 Correct 38 ms 23632 KB Output is correct
11 Correct 6 ms 9052 KB Output is correct
12 Correct 41 ms 23600 KB Output is correct
13 Correct 37 ms 23780 KB Output is correct
14 Correct 38 ms 23656 KB Output is correct
15 Correct 38 ms 23636 KB Output is correct
16 Correct 38 ms 23672 KB Output is correct
17 Correct 38 ms 23740 KB Output is correct
18 Correct 37 ms 23776 KB Output is correct
19 Correct 36 ms 23632 KB Output is correct
20 Correct 37 ms 23800 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 15568 KB Output is correct
2 Correct 45 ms 23700 KB Output is correct
3 Correct 60 ms 20560 KB Output is correct
4 Correct 45 ms 15104 KB Output is correct
5 Correct 52 ms 20048 KB Output is correct
6 Correct 61 ms 15420 KB Output is correct
7 Correct 59 ms 19768 KB Output is correct
8 Correct 71 ms 15700 KB Output is correct
9 Correct 37 ms 23816 KB Output is correct
10 Correct 54 ms 18828 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 32 ms 14072 KB Output is correct
6 Correct 23 ms 21588 KB Output is correct
7 Correct 31 ms 19164 KB Output is correct
8 Correct 20 ms 13656 KB Output is correct
9 Correct 27 ms 17488 KB Output is correct
10 Correct 18 ms 13640 KB Output is correct
11 Correct 2 ms 8536 KB Output is correct
12 Correct 2 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 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 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 2 ms 8540 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 32 ms 14072 KB Output is correct
6 Correct 23 ms 21588 KB Output is correct
7 Correct 31 ms 19164 KB Output is correct
8 Correct 20 ms 13656 KB Output is correct
9 Correct 27 ms 17488 KB Output is correct
10 Correct 18 ms 13640 KB Output is correct
11 Correct 2 ms 8536 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8792 KB Output is correct
14 Correct 45 ms 23744 KB Output is correct
15 Correct 37 ms 23808 KB Output is correct
16 Correct 35 ms 23600 KB Output is correct
17 Correct 38 ms 23772 KB Output is correct
18 Correct 36 ms 23636 KB Output is correct
19 Correct 35 ms 23696 KB Output is correct
20 Correct 38 ms 23632 KB Output is correct
21 Correct 6 ms 9052 KB Output is correct
22 Correct 41 ms 23600 KB Output is correct
23 Correct 37 ms 23780 KB Output is correct
24 Correct 38 ms 23656 KB Output is correct
25 Correct 38 ms 23636 KB Output is correct
26 Correct 38 ms 23672 KB Output is correct
27 Correct 38 ms 23740 KB Output is correct
28 Correct 37 ms 23776 KB Output is correct
29 Correct 36 ms 23632 KB Output is correct
30 Correct 37 ms 23800 KB Output is correct
31 Correct 117 ms 15568 KB Output is correct
32 Correct 45 ms 23700 KB Output is correct
33 Correct 60 ms 20560 KB Output is correct
34 Correct 45 ms 15104 KB Output is correct
35 Correct 52 ms 20048 KB Output is correct
36 Correct 61 ms 15420 KB Output is correct
37 Correct 59 ms 19768 KB Output is correct
38 Correct 71 ms 15700 KB Output is correct
39 Correct 37 ms 23816 KB Output is correct
40 Correct 54 ms 18828 KB Output is correct
41 Correct 2 ms 8536 KB Output is correct
42 Correct 2 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 2 ms 8540 KB Output is correct
47 Correct 2 ms 8540 KB Output is correct
48 Correct 2 ms 8540 KB Output is correct
49 Correct 2 ms 8540 KB Output is correct
50 Correct 2 ms 8796 KB Output is correct
51 Correct 80 ms 15804 KB Output is correct
52 Correct 47 ms 23632 KB Output is correct
53 Correct 61 ms 19092 KB Output is correct
54 Correct 38 ms 15244 KB Output is correct
55 Correct 117 ms 15628 KB Output is correct
56 Correct 37 ms 23632 KB Output is correct
57 Correct 51 ms 19536 KB Output is correct
58 Correct 48 ms 15120 KB Output is correct
59 Correct 70 ms 15700 KB Output is correct
60 Correct 49 ms 23720 KB Output is correct
61 Correct 55 ms 19628 KB Output is correct
62 Correct 47 ms 14904 KB Output is correct
63 Correct 102 ms 15288 KB Output is correct
64 Correct 46 ms 23632 KB Output is correct
65 Correct 66 ms 19552 KB Output is correct
66 Correct 45 ms 15248 KB Output is correct
67 Correct 112 ms 15508 KB Output is correct
68 Correct 39 ms 23644 KB Output is correct
69 Correct 60 ms 18596 KB Output is correct
70 Correct 59 ms 15220 KB Output is correct