Submission #59217

# Submission time Handle Problem Language Result Execution time Memory
59217 2018-07-21T07:34:30 Z gusfring Election Campaign (JOI15_election_campaign) C++14
100 / 100
760 ms 96844 KB
#include <bits/stdc++.h>
using namespace std;
const int MAX = (1e5)+1;
 
int n, m;
vector<int> g[MAX];
vector<tuple<int,int,int> > paths[MAX];
 
int d[MAX];
vector<int> anc[MAX];
void init_lca(int u, int p) {
	for(int v: g[u]) if(v != p) {
		d[v] = d[u] + 1;
		anc[v].push_back(u);
		for(int j = 0; 1 << j+1 <= d[v]; j++)
			anc[v].push_back(anc[anc[v][j]][j]);
		init_lca(v, u);
	}
}
int query_lca(int u, int v) {
	if(d[u] > d[v]) {
		int diff = d[u] - d[v];
		for(int j = anc[u].size()-1; j >= 0; j--) if(diff >> j & 1) u = anc[u][j];
	} else if(d[u] < d[v]) {
		int diff = d[v] - d[u];
		for(int j = anc[v].size()-1; j >= 0; j--) if(diff >> j & 1) v = anc[v][j];
	}
	if(u == v) return u;
	for(int j = anc[u].size()-1; j >= 0; j--) if(j < anc[u].size() && anc[u][j] != anc[v][j]) {
		u = anc[u][j];
		v = anc[v][j];
	}
	return anc[u][0];
}
 
int dp[MAX], sum[MAX], c[MAX];
map<int, int> mpf[MAX];
void dfs(int u, int p) {
	for(int v: g[u]) if(v != p) {
		dfs(v, u);
		sum[u] += dp[v];
		if(mpf[v].size() > mpf[u].size()) {
			mpf[u].swap(mpf[v]);
			swap(c[u], c[v]);
		}
		for(auto pp: mpf[v]) mpf[u][pp.first] = pp.second + c[v] - c[u];
	}
	dp[u] = sum[u];
	for(auto path: paths[u]) {
		int a, b, w;
		tie(a, b, w) = path;
		int down1 = (a != u ? mpf[u][a] + c[u] : 0);
		int down2 = (b != u ? mpf[u][b] + c[u] : 0);
		dp[u] = max(sum[u] + down1 + down2 + w, dp[u]);
	}
	mpf[u][u] = -c[u];
	c[u] += sum[u] - dp[u];
}
 
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	bool ok = true, ok2 = true;
	for(int i = 1, u, v; i < n; i++) {
		cin >> u >> v; --u; --v;
		if(u != v - 1) ok = false;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	init_lca(0, -1);
	cin >> m;
	for(int i = 0, u, v, w; i < m; i++) {
		cin >> u >> v >> w; --u; --v;
		if(w != 1) ok2 = false;
		paths[query_lca(u, v)].emplace_back(u, v, w);
	}
	dfs(0, -1);
	cout << dp[0];
}

Compilation message

election_campaign.cpp: In function 'void init_lca(int, int)':
election_campaign.cpp:15:24: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   for(int j = 0; 1 << j+1 <= d[v]; j++)
                       ~^~
election_campaign.cpp: In function 'int query_lca(int, int)':
election_campaign.cpp:29:49: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = anc[u].size()-1; j >= 0; j--) if(j < anc[u].size() && anc[u][j] != anc[v][j]) {
                                               ~~^~~~~~~~~~~~~~~
election_campaign.cpp: In function 'int main()':
election_campaign.cpp:64:7: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
  bool ok = true, ok2 = true;
       ^~
election_campaign.cpp:64:18: warning: variable 'ok2' set but not used [-Wunused-but-set-variable]
  bool ok = true, ok2 = true;
                  ^~~
# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 16 ms 12272 KB Output is correct
3 Correct 15 ms 12272 KB Output is correct
4 Correct 16 ms 12364 KB Output is correct
5 Correct 426 ms 49692 KB Output is correct
6 Correct 163 ms 49692 KB Output is correct
7 Correct 487 ms 49692 KB Output is correct
8 Correct 348 ms 49692 KB Output is correct
9 Correct 426 ms 49692 KB Output is correct
10 Correct 404 ms 49692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 49692 KB Output is correct
2 Correct 12 ms 49692 KB Output is correct
3 Correct 14 ms 49692 KB Output is correct
4 Correct 412 ms 49692 KB Output is correct
5 Correct 449 ms 49692 KB Output is correct
6 Correct 322 ms 49692 KB Output is correct
7 Correct 317 ms 49692 KB Output is correct
8 Correct 496 ms 49692 KB Output is correct
9 Correct 325 ms 49692 KB Output is correct
10 Correct 481 ms 49692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 49692 KB Output is correct
2 Correct 12 ms 49692 KB Output is correct
3 Correct 14 ms 49692 KB Output is correct
4 Correct 412 ms 49692 KB Output is correct
5 Correct 449 ms 49692 KB Output is correct
6 Correct 322 ms 49692 KB Output is correct
7 Correct 317 ms 49692 KB Output is correct
8 Correct 496 ms 49692 KB Output is correct
9 Correct 325 ms 49692 KB Output is correct
10 Correct 481 ms 49692 KB Output is correct
11 Correct 25 ms 49692 KB Output is correct
12 Correct 457 ms 49692 KB Output is correct
13 Correct 493 ms 49692 KB Output is correct
14 Correct 379 ms 49692 KB Output is correct
15 Correct 373 ms 49692 KB Output is correct
16 Correct 347 ms 49692 KB Output is correct
17 Correct 479 ms 49692 KB Output is correct
18 Correct 363 ms 49692 KB Output is correct
19 Correct 338 ms 49692 KB Output is correct
20 Correct 340 ms 49692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 615 ms 53288 KB Output is correct
2 Correct 362 ms 53288 KB Output is correct
3 Correct 705 ms 53288 KB Output is correct
4 Correct 546 ms 53288 KB Output is correct
5 Correct 649 ms 53288 KB Output is correct
6 Correct 507 ms 53288 KB Output is correct
7 Correct 584 ms 53288 KB Output is correct
8 Correct 647 ms 53288 KB Output is correct
9 Correct 285 ms 53288 KB Output is correct
10 Correct 650 ms 53288 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 16 ms 12272 KB Output is correct
3 Correct 15 ms 12272 KB Output is correct
4 Correct 16 ms 12364 KB Output is correct
5 Correct 426 ms 49692 KB Output is correct
6 Correct 163 ms 49692 KB Output is correct
7 Correct 487 ms 49692 KB Output is correct
8 Correct 348 ms 49692 KB Output is correct
9 Correct 426 ms 49692 KB Output is correct
10 Correct 404 ms 49692 KB Output is correct
11 Correct 15 ms 53288 KB Output is correct
12 Correct 14 ms 53288 KB Output is correct
13 Correct 15 ms 53288 KB Output is correct
14 Correct 16 ms 53288 KB Output is correct
15 Correct 15 ms 53288 KB Output is correct
16 Correct 16 ms 53288 KB Output is correct
17 Correct 14 ms 53288 KB Output is correct
18 Correct 16 ms 53288 KB Output is correct
19 Correct 15 ms 53288 KB Output is correct
20 Correct 16 ms 53288 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 16 ms 12272 KB Output is correct
3 Correct 15 ms 12272 KB Output is correct
4 Correct 16 ms 12364 KB Output is correct
5 Correct 426 ms 49692 KB Output is correct
6 Correct 163 ms 49692 KB Output is correct
7 Correct 487 ms 49692 KB Output is correct
8 Correct 348 ms 49692 KB Output is correct
9 Correct 426 ms 49692 KB Output is correct
10 Correct 404 ms 49692 KB Output is correct
11 Correct 14 ms 49692 KB Output is correct
12 Correct 12 ms 49692 KB Output is correct
13 Correct 14 ms 49692 KB Output is correct
14 Correct 412 ms 49692 KB Output is correct
15 Correct 449 ms 49692 KB Output is correct
16 Correct 322 ms 49692 KB Output is correct
17 Correct 317 ms 49692 KB Output is correct
18 Correct 496 ms 49692 KB Output is correct
19 Correct 325 ms 49692 KB Output is correct
20 Correct 481 ms 49692 KB Output is correct
21 Correct 25 ms 49692 KB Output is correct
22 Correct 457 ms 49692 KB Output is correct
23 Correct 493 ms 49692 KB Output is correct
24 Correct 379 ms 49692 KB Output is correct
25 Correct 373 ms 49692 KB Output is correct
26 Correct 347 ms 49692 KB Output is correct
27 Correct 479 ms 49692 KB Output is correct
28 Correct 363 ms 49692 KB Output is correct
29 Correct 338 ms 49692 KB Output is correct
30 Correct 340 ms 49692 KB Output is correct
31 Correct 615 ms 53288 KB Output is correct
32 Correct 362 ms 53288 KB Output is correct
33 Correct 705 ms 53288 KB Output is correct
34 Correct 546 ms 53288 KB Output is correct
35 Correct 649 ms 53288 KB Output is correct
36 Correct 507 ms 53288 KB Output is correct
37 Correct 584 ms 53288 KB Output is correct
38 Correct 647 ms 53288 KB Output is correct
39 Correct 285 ms 53288 KB Output is correct
40 Correct 650 ms 53288 KB Output is correct
41 Correct 15 ms 53288 KB Output is correct
42 Correct 14 ms 53288 KB Output is correct
43 Correct 15 ms 53288 KB Output is correct
44 Correct 16 ms 53288 KB Output is correct
45 Correct 15 ms 53288 KB Output is correct
46 Correct 16 ms 53288 KB Output is correct
47 Correct 14 ms 53288 KB Output is correct
48 Correct 16 ms 53288 KB Output is correct
49 Correct 15 ms 53288 KB Output is correct
50 Correct 16 ms 53288 KB Output is correct
51 Correct 601 ms 53288 KB Output is correct
52 Correct 425 ms 53288 KB Output is correct
53 Correct 760 ms 53288 KB Output is correct
54 Correct 399 ms 53288 KB Output is correct
55 Correct 663 ms 63620 KB Output is correct
56 Correct 500 ms 63620 KB Output is correct
57 Correct 528 ms 63620 KB Output is correct
58 Correct 531 ms 63620 KB Output is correct
59 Correct 591 ms 75028 KB Output is correct
60 Correct 360 ms 75028 KB Output is correct
61 Correct 608 ms 75028 KB Output is correct
62 Correct 436 ms 75028 KB Output is correct
63 Correct 537 ms 85272 KB Output is correct
64 Correct 375 ms 85272 KB Output is correct
65 Correct 666 ms 85272 KB Output is correct
66 Correct 436 ms 85272 KB Output is correct
67 Correct 647 ms 96844 KB Output is correct
68 Correct 551 ms 96844 KB Output is correct
69 Correct 570 ms 96844 KB Output is correct
70 Correct 464 ms 96844 KB Output is correct