|
|
|
@ -16,13 +16,14 @@ int sz[N], g[N], f[N];
|
|
|
|
|
int len[N], id[N], slen[N];
|
|
|
|
|
void dfs1(int u, int fa) {
|
|
|
|
|
if (pos[u]) sz[u] = 1;
|
|
|
|
|
for (int i = Head[u]; i; i = Edge[i].next) {
|
|
|
|
|
int v = Edge[i].to, w = Edge[i].val;
|
|
|
|
|
|
|
|
|
|
for (int i = h[u]; ~i; i = ne[i]) {
|
|
|
|
|
int v = e[i];
|
|
|
|
|
if (v == fa) continue;
|
|
|
|
|
dfs1(v, u);
|
|
|
|
|
if (sz[v]) {
|
|
|
|
|
g[u] += g[v] + 2 * w;
|
|
|
|
|
int now = len[v] + w;
|
|
|
|
|
g[u] += g[v] + 2 * w[i];
|
|
|
|
|
int now = len[v] + w[i];
|
|
|
|
|
if (now >= len[u])
|
|
|
|
|
slen[u] = len[u], len[u] = now, id[u] = v;
|
|
|
|
|
else if (now > slen[u])
|
|
|
|
@ -32,21 +33,21 @@ void dfs1(int u, int fa) {
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
void dfs2(int u, int fa) {
|
|
|
|
|
for (int i = Head[u]; i; i = Edge[i].next) {
|
|
|
|
|
int v = Edge[i].to, w = Edge[i].val;
|
|
|
|
|
for (int i = h[u]; ~i; i = ne[i]) {
|
|
|
|
|
int v = e[i];
|
|
|
|
|
if (v == fa) continue;
|
|
|
|
|
if (!sz[v])
|
|
|
|
|
f[v] = f[u] + 2 * w, len[v] = len[u] + w;
|
|
|
|
|
f[v] = f[u] + 2 * w[i], len[v] = len[u] + w[i];
|
|
|
|
|
else if (K - sz[v]) {
|
|
|
|
|
f[v] = f[u];
|
|
|
|
|
if (id[u] != v && len[v] < len[u] + w)
|
|
|
|
|
slen[v] = len[v], len[v] = len[u] + w, id[v] = u;
|
|
|
|
|
else if (len[v] < slen[u] + w)
|
|
|
|
|
slen[v] = len[v], len[v] = slen[u] + w, id[v] = 1;
|
|
|
|
|
else if (slen[v] < len[u] + w && id[u] != v)
|
|
|
|
|
slen[v] = len[u] + w;
|
|
|
|
|
else if (slen[v] < slen[u] + w)
|
|
|
|
|
slen[v] = slen[u] + w;
|
|
|
|
|
if (id[u] != v && len[v] < len[u] + w[i])
|
|
|
|
|
slen[v] = len[v], len[v] = len[u] + w[i], id[v] = u;
|
|
|
|
|
else if (len[v] < slen[u] + w[i])
|
|
|
|
|
slen[v] = len[v], len[v] = slen[u] + w[i], id[v] = 1;
|
|
|
|
|
else if (slen[v] < len[u] + w[i] && id[u] != v)
|
|
|
|
|
slen[v] = len[u] + w[i];
|
|
|
|
|
else if (slen[v] < slen[u] + w[i])
|
|
|
|
|
slen[v] = slen[u] + w[i];
|
|
|
|
|
} else
|
|
|
|
|
f[v] = g[v];
|
|
|
|
|
dfs2(v, u);
|
|
|
|
|