oj.uz

Submission #960723

# Submission time Handle Problem Language Result Execution time Memory
960723 2024-04-11T01:24:34 Z pcc Election Campaign (JOI15_election_campaign) C++17
100 / 100
 158 ms 22776 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(){
	scanf("%d",&N);
	for(int i = 1;i<N;i++){
		int a,b;
		scanf("%d%d",&a,&b);
		tree[a].push_back(b);
		tree[b].push_back(a);
	}
	HLD::dfs1(1);
	HLD::dfs2(1,1);
	scanf("%d",&Q);
	while(Q--){
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		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
election_campaign.cpp: In function 'int main()':
election_campaign.cpp:115:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |  scanf("%d",&N);
      |  ~~~~~^~~~~~~~~
election_campaign.cpp:118:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |   scanf("%d%d",&a,&b);
      |   ~~~~~^~~~~~~~~~~~~~
election_campaign.cpp:124:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  124 |  scanf("%d",&Q);
      |  ~~~~~^~~~~~~~~
election_campaign.cpp:127:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  127 |   scanf("%d%d%d",&a,&b,&c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 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 55 ms 12960 KB Output is correct
6 Correct 34 ms 20564 KB Output is correct
7 Correct 43 ms 17856 KB Output is correct
8 Correct 41 ms 12484 KB Output is correct
9 Correct 45 ms 16472 KB Output is correct
10 Correct 32 ms 12532 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7516 KB Output is correct
2 Correct 2 ms 7468 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 67 ms 22776 KB Output is correct
5 Correct 73 ms 22672 KB Output is correct
6 Correct 71 ms 22632 KB Output is correct
7 Correct 67 ms 22756 KB Output is correct
8 Correct 67 ms 22612 KB Output is correct
9 Correct 73 ms 22724 KB Output is correct
10 Correct 77 ms 22768 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7516 KB Output is correct
2 Correct 2 ms 7468 KB Output is correct
3 Correct 2 ms 7772 KB Output is correct
4 Correct 67 ms 22776 KB Output is correct
5 Correct 73 ms 22672 KB Output is correct
6 Correct 71 ms 22632 KB Output is correct
7 Correct 67 ms 22756 KB Output is correct
8 Correct 67 ms 22612 KB Output is correct
9 Correct 73 ms 22724 KB Output is correct
10 Correct 77 ms 22768 KB Output is correct
11 Correct 10 ms 8024 KB Output is correct
12 Correct 69 ms 22608 KB Output is correct
13 Correct 69 ms 22652 KB Output is correct
14 Correct 68 ms 22724 KB Output is correct
15 Correct 78 ms 22588 KB Output is correct
16 Correct 77 ms 22600 KB Output is correct
17 Correct 74 ms 22616 KB Output is correct
18 Correct 78 ms 22608 KB Output is correct
19 Correct 68 ms 22608 KB Output is correct
20 Correct 91 ms 22572 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 14500 KB Output is correct
2 Correct 67 ms 22708 KB Output is correct
3 Correct 102 ms 19532 KB Output is correct
4 Correct 78 ms 14068 KB Output is correct
5 Correct 90 ms 18984 KB Output is correct
6 Correct 75 ms 14024 KB Output is correct
7 Correct 99 ms 18868 KB Output is correct
8 Correct 124 ms 14836 KB Output is correct
9 Correct 66 ms 22756 KB Output is correct
10 Correct 91 ms 17768 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 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 55 ms 12960 KB Output is correct
6 Correct 34 ms 20564 KB Output is correct
7 Correct 43 ms 17856 KB Output is correct
8 Correct 41 ms 12484 KB Output is correct
9 Correct 45 ms 16472 KB Output is correct
10 Correct 32 ms 12532 KB Output is correct
11 Correct 3 ms 7512 KB Output is correct
12 Correct 2 ms 7596 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7516 KB Output is correct
15 Correct 3 ms 7516 KB Output is correct
16 Correct 2 ms 7512 KB Output is correct
17 Correct 2 ms 7516 KB Output is correct
18 Correct 2 ms 7512 KB Output is correct
19 Correct 2 ms 7600 KB Output is correct
20 Correct 2 ms 7772 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7512 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 55 ms 12960 KB Output is correct
6 Correct 34 ms 20564 KB Output is correct
7 Correct 43 ms 17856 KB Output is correct
8 Correct 41 ms 12484 KB Output is correct
9 Correct 45 ms 16472 KB Output is correct
10 Correct 32 ms 12532 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 2 ms 7468 KB Output is correct
13 Correct 2 ms 7772 KB Output is correct
14 Correct 67 ms 22776 KB Output is correct
15 Correct 73 ms 22672 KB Output is correct
16 Correct 71 ms 22632 KB Output is correct
17 Correct 67 ms 22756 KB Output is correct
18 Correct 67 ms 22612 KB Output is correct
19 Correct 73 ms 22724 KB Output is correct
20 Correct 77 ms 22768 KB Output is correct
21 Correct 10 ms 8024 KB Output is correct
22 Correct 69 ms 22608 KB Output is correct
23 Correct 69 ms 22652 KB Output is correct
24 Correct 68 ms 22724 KB Output is correct
25 Correct 78 ms 22588 KB Output is correct
26 Correct 77 ms 22600 KB Output is correct
27 Correct 74 ms 22616 KB Output is correct
28 Correct 78 ms 22608 KB Output is correct
29 Correct 68 ms 22608 KB Output is correct
30 Correct 91 ms 22572 KB Output is correct
31 Correct 158 ms 14500 KB Output is correct
32 Correct 67 ms 22708 KB Output is correct
33 Correct 102 ms 19532 KB Output is correct
34 Correct 78 ms 14068 KB Output is correct
35 Correct 90 ms 18984 KB Output is correct
36 Correct 75 ms 14024 KB Output is correct
37 Correct 99 ms 18868 KB Output is correct
38 Correct 124 ms 14836 KB Output is correct
39 Correct 66 ms 22756 KB Output is correct
40 Correct 91 ms 17768 KB Output is correct
41 Correct 3 ms 7512 KB Output is correct
42 Correct 2 ms 7596 KB Output is correct
43 Correct 2 ms 7516 KB Output is correct
44 Correct 2 ms 7516 KB Output is correct
45 Correct 3 ms 7516 KB Output is correct
46 Correct 2 ms 7512 KB Output is correct
47 Correct 2 ms 7516 KB Output is correct
48 Correct 2 ms 7512 KB Output is correct
49 Correct 2 ms 7600 KB Output is correct
50 Correct 2 ms 7772 KB Output is correct
51 Correct 125 ms 14744 KB Output is correct
52 Correct 71 ms 22672 KB Output is correct
53 Correct 100 ms 18032 KB Output is correct
54 Correct 74 ms 14084 KB Output is correct
55 Correct 136 ms 14604 KB Output is correct
56 Correct 83 ms 22560 KB Output is correct
57 Correct 95 ms 18700 KB Output is correct
58 Correct 79 ms 13952 KB Output is correct
59 Correct 115 ms 14604 KB Output is correct
60 Correct 94 ms 22608 KB Output is correct
61 Correct 86 ms 18832 KB Output is correct
62 Correct 83 ms 13836 KB Output is correct
63 Correct 143 ms 14436 KB Output is correct
64 Correct 72 ms 22716 KB Output is correct
65 Correct 89 ms 18696 KB Output is correct
66 Correct 74 ms 14292 KB Output is correct
67 Correct 138 ms 14520 KB Output is correct
68 Correct 69 ms 22576 KB Output is correct
69 Correct 83 ms 17492 KB Output is correct
70 Correct 74 ms 14136 KB Output is correct