#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(anc[u][j] != anc[v][j]) {
u = anc[u][j];
v = anc[v][j];
}
assert(anc[u][0] == anc[v][0]);
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;
for(int i = 1, u, v; i < n; i++) {
cin >> u >> v; --u; --v;
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;
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++)
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
15464 KB |
Output is correct |
2 |
Correct |
6 ms |
15464 KB |
Output is correct |
3 |
Correct |
3 ms |
15464 KB |
Output is correct |
4 |
Correct |
9 ms |
15596 KB |
Output is correct |
5 |
Correct |
299 ms |
50708 KB |
Output is correct |
6 |
Correct |
129 ms |
45528 KB |
Output is correct |
7 |
Correct |
286 ms |
40680 KB |
Output is correct |
8 |
Correct |
293 ms |
33564 KB |
Output is correct |
9 |
Correct |
286 ms |
39656 KB |
Output is correct |
10 |
Correct |
276 ms |
34100 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
15464 KB |
Output is correct |
2 |
Correct |
0 ms |
15464 KB |
Output is correct |
3 |
Correct |
3 ms |
15596 KB |
Output is correct |
4 |
Correct |
336 ms |
47504 KB |
Output is correct |
5 |
Correct |
336 ms |
47504 KB |
Output is correct |
6 |
Correct |
229 ms |
47644 KB |
Output is correct |
7 |
Correct |
296 ms |
47504 KB |
Output is correct |
8 |
Correct |
286 ms |
47508 KB |
Output is correct |
9 |
Correct |
273 ms |
47636 KB |
Output is correct |
10 |
Correct |
293 ms |
47508 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
15464 KB |
Output is correct |
2 |
Correct |
0 ms |
15464 KB |
Output is correct |
3 |
Correct |
3 ms |
15596 KB |
Output is correct |
4 |
Correct |
336 ms |
47504 KB |
Output is correct |
5 |
Correct |
336 ms |
47504 KB |
Output is correct |
6 |
Correct |
229 ms |
47644 KB |
Output is correct |
7 |
Correct |
296 ms |
47504 KB |
Output is correct |
8 |
Correct |
286 ms |
47508 KB |
Output is correct |
9 |
Correct |
273 ms |
47636 KB |
Output is correct |
10 |
Correct |
293 ms |
47508 KB |
Output is correct |
11 |
Correct |
26 ms |
15992 KB |
Output is correct |
12 |
Correct |
309 ms |
47512 KB |
Output is correct |
13 |
Correct |
259 ms |
47508 KB |
Output is correct |
14 |
Correct |
233 ms |
47636 KB |
Output is correct |
15 |
Correct |
263 ms |
47508 KB |
Output is correct |
16 |
Correct |
213 ms |
47640 KB |
Output is correct |
17 |
Correct |
293 ms |
47504 KB |
Output is correct |
18 |
Correct |
259 ms |
47504 KB |
Output is correct |
19 |
Correct |
229 ms |
47640 KB |
Output is correct |
20 |
Correct |
273 ms |
47508 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
469 ms |
54136 KB |
Output is correct |
2 |
Correct |
206 ms |
47636 KB |
Output is correct |
3 |
Runtime error |
103 ms |
31172 KB |
Execution killed because of forbidden syscall gettid (186) |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
15464 KB |
Output is correct |
2 |
Correct |
6 ms |
15464 KB |
Output is correct |
3 |
Correct |
3 ms |
15464 KB |
Output is correct |
4 |
Correct |
9 ms |
15596 KB |
Output is correct |
5 |
Correct |
299 ms |
50708 KB |
Output is correct |
6 |
Correct |
129 ms |
45528 KB |
Output is correct |
7 |
Correct |
286 ms |
40680 KB |
Output is correct |
8 |
Correct |
293 ms |
33564 KB |
Output is correct |
9 |
Correct |
286 ms |
39656 KB |
Output is correct |
10 |
Correct |
276 ms |
34100 KB |
Output is correct |
11 |
Correct |
3 ms |
15728 KB |
Output is correct |
12 |
Correct |
3 ms |
15600 KB |
Output is correct |
13 |
Correct |
3 ms |
15596 KB |
Output is correct |
14 |
Correct |
3 ms |
15596 KB |
Output is correct |
15 |
Correct |
3 ms |
15728 KB |
Output is correct |
16 |
Correct |
0 ms |
15596 KB |
Output is correct |
17 |
Correct |
6 ms |
15596 KB |
Output is correct |
18 |
Correct |
3 ms |
15596 KB |
Output is correct |
19 |
Correct |
3 ms |
15596 KB |
Output is correct |
20 |
Correct |
6 ms |
15600 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
15464 KB |
Output is correct |
2 |
Correct |
6 ms |
15464 KB |
Output is correct |
3 |
Correct |
3 ms |
15464 KB |
Output is correct |
4 |
Correct |
9 ms |
15596 KB |
Output is correct |
5 |
Correct |
299 ms |
50708 KB |
Output is correct |
6 |
Correct |
129 ms |
45528 KB |
Output is correct |
7 |
Correct |
286 ms |
40680 KB |
Output is correct |
8 |
Correct |
293 ms |
33564 KB |
Output is correct |
9 |
Correct |
286 ms |
39656 KB |
Output is correct |
10 |
Correct |
276 ms |
34100 KB |
Output is correct |
11 |
Correct |
3 ms |
15464 KB |
Output is correct |
12 |
Correct |
0 ms |
15464 KB |
Output is correct |
13 |
Correct |
3 ms |
15596 KB |
Output is correct |
14 |
Correct |
336 ms |
47504 KB |
Output is correct |
15 |
Correct |
336 ms |
47504 KB |
Output is correct |
16 |
Correct |
229 ms |
47644 KB |
Output is correct |
17 |
Correct |
296 ms |
47504 KB |
Output is correct |
18 |
Correct |
286 ms |
47508 KB |
Output is correct |
19 |
Correct |
273 ms |
47636 KB |
Output is correct |
20 |
Correct |
293 ms |
47508 KB |
Output is correct |
21 |
Correct |
26 ms |
15992 KB |
Output is correct |
22 |
Correct |
309 ms |
47512 KB |
Output is correct |
23 |
Correct |
259 ms |
47508 KB |
Output is correct |
24 |
Correct |
233 ms |
47636 KB |
Output is correct |
25 |
Correct |
263 ms |
47508 KB |
Output is correct |
26 |
Correct |
213 ms |
47640 KB |
Output is correct |
27 |
Correct |
293 ms |
47504 KB |
Output is correct |
28 |
Correct |
259 ms |
47504 KB |
Output is correct |
29 |
Correct |
229 ms |
47640 KB |
Output is correct |
30 |
Correct |
273 ms |
47508 KB |
Output is correct |
31 |
Correct |
469 ms |
54136 KB |
Output is correct |
32 |
Correct |
206 ms |
47636 KB |
Output is correct |
33 |
Runtime error |
103 ms |
31172 KB |
Execution killed because of forbidden syscall gettid (186) |
34 |
Halted |
0 ms |
0 KB |
- |