bzoj2152: 聪聪可可

链接：http://www.lydsy.com/JudgeOnline/problem.php?id=2152

题意：中文题。

分析：树分治练习题。

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=20010;
const int mod=1000000007;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;
int ans,sum,root;
int f[N],vis[N],dis[N],siz[N],deep[3];
int tot,u[N],v[2*N],w[2*N],pre[2*N];
int gcd(int a,int b) {
    return b ? gcd(b,a%b):a;
}
void add(int a,int b,int c) {
    v[tot]=b;w[tot]=c;pre[tot]=u[a];u[a]=tot++;
    v[tot]=a;w[tot]=c;pre[tot]=u[b];u[b]=tot++;
}
void getroot(int a,int fa) {
    f[a]=0;siz[a]=1;
    for (int i=u[a];i!=-1;i=pre[i])
    if (v[i]==fa||vis[v[i]]) continue ;
    else {
        getroot(v[i],a);
        siz[a]+=siz[v[i]];
        f[a]=max(f[a],siz[v[i]]);
    }
    f[a]=max(f[a],sum-siz[a]);
    if (f[a]<f[root]) root=a;
}
void getdeep(int a,int fa) {
    deep[dis[a]]++;
    for (int i=u[a];i!=-1;i=pre[i])
    if (v[i]==fa||vis[v[i]]) continue ;
    else {
        dis[v[i]]=(dis[a]+w[i])%3;getdeep(v[i],a);
    }
}
int cala(int a,int now) {
    memset(deep,0,sizeof(deep));
    dis[a]=now;getdeep(a,0);
    return deep[0]*deep[0]+2*deep[1]*deep[2];
}
void solve(int a) {
    ans+=cala(a,0);vis[a]=1;
    for (int i=u[a];i!=-1;i=pre[i])
    if (vis[v[i]]) continue ;
    else {
        ans-=cala(v[i],w[i]);
        root=0;sum=siz[v[i]];
        getroot(v[i],a);solve(root);
    }
}
int main()
{
    int a,b,c,i,n,Z,M;
    scanf("%d", &n);
    memset(f,0,sizeof(f));
    memset(u,-1,sizeof(u));
    memset(vis,0,sizeof(vis));
    ans=tot=root=0;f[0]=N;sum=n;
    for (i=1;i<n;i++)
        scanf("%d%d%d", &a, &b, &c),add(a,b,c%3);
    getroot(1,0);
    solve(root);
    Z=ans;M=n*n;
    printf("%d/%d\n", Z/gcd(Z,M), M/gcd(Z,M));
    return 0;
}