[暴力 树形DP] Codeforces Gym 100553H NEERC14 H. Hidden Maze

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=40005;

struct edge{
  int u,v,next;
}G[N<<1];
int head[N],inum=1;
inline void add(int u,int v,int p){
  G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}
#define V G[p].v
int depth[N],maxd[N],fat[N],fap[N];

const int B=505;
int g[N][B+B];
inline int D(int v){
  return maxd[v]-depth[v];
}

inline void dfs(int u,int fa){
  maxd[u]=depth[u]=depth[fa]+1; fat[u]=fa;
  g[u][0+B]=1;
  for (int p=head[u];p;p=G[p].next)
    if (V!=fa){
      fap[V]=p>>1,dfs(V,u),maxd[u]=max(maxd[u],maxd[V]);
      for (int j=-D(V);j<=D(V);j++)
    g[u][j-1+B]+=g[V][j+B];
    }
}

int sx[N],icnt;
int n,ed[N];
int u[N],v[N],w[N];

inline bool cmp(int a,int b){ return w[a]<w[b]; }

ll Ans,Tot;

int main(){
  int iu,iv,iw;
  freopen("hidden.in","r",stdin);
  freopen("hidden.out","w",stdout);
  read(n);
  for (int i=1;i<n;i++) read(u[i]),read(v[i]),read(w[i]),add(u[i],v[i],++inum),add(v[i],u[i],++inum),sx[++icnt]=w[i];
  for (int i=1;i<n;i++) ed[i]=i; sort(ed+1,ed+n,cmp); sort(sx+1,sx+icnt+1);
  for (int i=1;i<n;i++) w[i]=-1;
  dfs(1,0);
  for (int i=1;i<n;i++){
    int u=::u[ed[i]],v=::v[ed[i]],t,val;
    if (depth[u]<depth[v]) swap(u,v);
    t=u,val=w[fap[t]];
    while (fat[t]){
      for (int j=-D(u);j<=D(u);j++)
    g[fat[t]][j+val+B]-=g[u][j+B];
      t=fat[t]; val+=w[fap[t]];
    }
    w[ed[i]]=1;t=u,val=w[fap[t]];
    t=u,val=w[fap[t]];
    while (fat[t]){
      for (int j=-D(u);j<=D(u);j++)
    g[fat[t]][j+val+B]+=g[u][j+B];
      t=fat[t]; val+=w[fap[t]];
    }
    ll tmp=0;
    t=u,val=w[fap[t]];
    while (fat[t]){
      for (int j=-D(u);j<=D(u);j++)
    tmp+=(ll)(g[fat[t]][1-j-val+B]-g[t][1-j-val-w[fap[t]]+B])*g[u][j+B];
      t=fat[t]; val+=w[fap[t]];
    }
    Ans+=tmp*sx[i]; Tot+=tmp;
  }
  printf("%.15lf\n",(double)Ans/Tot);
  return 0;
}