链接
题解
最小值很好求
最大值分两种情况:只有一个重心和有两个重心,对每条边算贡献就好
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
struct Graph
{
int etot, head[maxn], to[maxe], next[maxe], w[maxe];
void clear(int N)
{
for(int i=1;i<=N;i++)head[i]=0;
etot=0;
}
void adde(int a, int b, int c=0){to[++etot]=b;w[etot]=c;next[etot]=head[a];head[a]=etot;}
#define forp(pos,G) for(auto p=G.head[pos];p;p=G.next[p])
}G;
ll k, sz[maxn], ans1, ans2, u, v, min_maxsize;
void dfs1(ll pos, ll pre) //calcuate size
{
sz[pos]=1;
forp(pos,G)if(G.to[p]!=pre)
{
dfs1(G.to[p],pos);
sz[pos]+=sz[G.to[p]];
}
}
void dfs2(ll pos, ll pre) //calculate ans1
{
forp(pos,G)
if(G.to[p]!=pre)
{
if(sz[G.to[p]]&1)ans1+=G.w[p];
dfs2(G.to[p],pos);
}
}
void dfs3(ll pos, ll pre) //find the important edge
{
if(sz[pos]==k)u=pos, v=pre;
forp(pos,G)
if(G.to[p]!=pre)
{
dfs3(G.to[p],pos);
}
}
void dfs4(ll pos, ll pre) //calculate ans2
{
forp(pos,G)
if(G.to[p]!=pre)dfs4(G.to[p],pos);
else if(pos!=u)ans2+=G.w[p]*sz[pos];
}
void dfs5(ll pos, ll pre) //find G
{
ll mx=2*k-sz[pos];
forp(pos,G)if(G.to[p]!=pre)
{
dfs5(G.to[p],pos);
mx=max(mx,sz[G.to[p]]);
}
if(mx<min_maxsize)u=pos, min_maxsize=mx;
}
int main()
{
ll T=read(), i;
while(T--)
{
k=read();
G.clear(2*k);
rep(i,2*k-1)
{
ll u=read(), v=read(), w=read();
G.adde(u,v,w);
G.adde(v,u,w);
}
ans1=ans2=0;
dfs1(1,0);
dfs2(1,0);
u=v=-1;
dfs3(1,0);
if(u!=-1) //重心在边上
{
dfs1(u,v);
dfs1(v,u);
dfs4(u,v);
dfs4(v,u);
}
else //重心是一个点
{
min_maxsize=linf;
dfs5(1,0);
dfs1(u,0);
dfs4(u,0);
}
printf("%lld %lld\n",ans1,ans2);
}
return 0;
}