# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15851 | myungwoo | Beads and wires (APIO14_beads) | C++14 | 16 ms | 9728 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define MAXN 200005
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
int N;
int D[MAXN], E[MAXN], up[MAXN], V[MAXN];
vector <int> con[MAXN], conv[MAXN];
void dfs(int n, int from)
{
vector <int> arr;
for (int i=sz(con[n]);i--;){
int t = con[n][i], v = conv[n][i];
if (t == from) continue;
up[t] = v; dfs(t, n);
V[t] = D[t] - max(D[t], E[t]) + up[t];
arr.pb(t);
}
sort(all(arr), [](const int &a, const int &b){
return V[a] > V[b];
});
D[n] = E[n] = 0;
if (arr.empty()) return;
for (int t: arr) D[n] += max(D[t], E[t]);
E[n] = D[n];
if (sz(arr) > 1)
D[n] += max(0, V[arr[0]] + V[arr[1]]);
E[n] += up[n] + V[arr[0]];
}
int main()
{
scanf("%d", &N);
for (int i=1;i<N;i++){
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
con[a].pb(b); conv[a].pb(c);
con[b].pb(a); conv[b].pb(c);
}
dfs(1, 0);
printf("%d\n", D[1]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |