UOJ33树上GCD

传送门
官方题解
我写的是点分做法，一开始我是用memset(dp,0,(sizeof dp[0])*t)来清零dp数组的1到t位，但这样第t位刚好没覆盖到，然后就没过大样例。

#include<cstdio>
#include<cctype> 
#include<cstring>
#include<cmath>
typedef long long ll;
const int N=400005;
inline void up(int&a,int b){
    if(a<b)a=b;
}
inline int min(int a,int b){
    return a>b?b:a;
}
int n,i,j;
ll g[N],gg[N];
struct tree{
    struct edge{
        int to,next;
    }e[N<<1];
    int xb,h[N],rt,sum,sz[N],f[N],dd,p[N],d[N],dep[N],a[N],dp[500][500],t,z;
    ll s1[N],s2[N],ds[N];
    bool b[N];
    inline void addedge(int u,int v){
        e[++xb]=(edge){v,h[u]};
        h[u]=xb;
        e[++xb]=(edge){u,h[v]};
        h[v]=xb;
    }
    void dfs(int x,int fa){
        f[x]=sz[x]=1;
        for(int i=h[x];i;i=e[i].next)
            if(e[i].to!=fa && !b[e[i].to])dfs(e[i].to,x),sz[x]+=sz[e[i].to],up(f[x],sz[e[i].to]);
        up(f[x],sum-sz[x]);
        if(f[rt]>f[x])rt=x;
    }
    void getdep(int x,int fa){
        dep[x]=dep[fa]+1;
        if(dep[x]>dd)d[dd=dep[x]]=0;
        if(dep[x]>z)ds[z=dep[x]]=0;
        ++d[dep[x]];
        for(int i=h[x];i;i=e[i].next)if(!b[e[i].to] && e[i].to!=fa)getdep(e[i].to,x);
    }
    inline ll ask(int x,int y){
        ll ans=0;
        if(x<=t && dp[x][y])return dp[x][y];
        for(i=y;i<=z;i+=x)ans+=ds[i];
        return x<=t?dp[x][y]=ans:ans;
    }
    inline void work(int x){
        int i=0,j,k,l,y;
        ll s=0;
        dep[x]=z=0;
        memset(s1,0,(sizeof s1[0])*(sz[x]+1));
        memset(s2,0,(sizeof s2[0])*(sz[x]+1));
        if(x==9){
            i=i+1;
        }
        for(i=h[x];i;i=e[i].next)
            if(!b[e[i].to] && e[i].to!=p[x]){
                dd=0;
                getdep(e[i].to,x);
                for(j=1;j<=dd;++j)
                    ds[j]+=d[j];
                for(j=1;j<=dd;++j)
                    for(k=j<<1;k<=dd;k+=j)d[j]+=d[k];
                for(j=1;j<=dd;++j)s1[j]+=d[j],s2[j]+=1ll*d[j]*d[j];
            }
        for(i=1;i<=z;++i)g[i]+=(s1[i]*s1[i]-s2[i])>>1;
        t=sqrt(z);
        for(i=1;i<=t;++i)memset(dp,0,(sizeof dp[0])*(t+5));
        for(i=x,y=1;p[i] && !b[p[i]] && ++gg[y];i=p[i],++y)
            for(j=h[p[i]];j;j=e[j].next)
                if(!b[e[j].to] && e[j].to!=i && e[j].to!=p[p[i]]){
                    dd=0;
                    dep[p[i]]=0;
                    getdep(e[j].to,p[i]);
                    for(k=1;k<=dd;++k)
                        for(l=k<<1;l<=dd;l+=k)d[k]+=d[l];
                    for(k=1;k<=dd;++k)
                        g[k]+=1ll*d[k]*(ask(k,k-y%k)+(y%k==0));
                }
        for(i=z+1;i<=z+y;++i)ds[i]=0;
        for(i=1,--y;i<=z+y;++i){
            s+=ds[i]-(y<i?ds[i-y-1]:0);
            gg[i]+=s;
        }
        //printf("%d %lld %lld\n",x,g[1],gg[1]);
    }
    void solve(int x){
        b[x]=1;
        for(int i=h[x];i;i=e[i].next)if(sz[e[i].to]>sz[x])sz[e[i].to]=sum-sz[x];
        work(x);
        for(int i=h[x];i;i=e[i].next)
            if(!b[e[i].to]){
                sum=sz[e[i].to];
                rt=0;
                dfs(e[i].to,x);
                solve(rt);
            }
    }
}t;
inline int getint(){
    int x=0;
    char c=getchar();
    while(!isdigit(c))c=getchar();
    for(;isdigit(c);c=getchar())x=x*10+c-48;
    return x;
}
int buf[100];
inline void putl(ll x){
    if(!x)putchar('0');
        else{
            if(x<0)putchar('-'),x=-x;
            int xb=0;
            for(;x;x/=10)buf[++xb]=x%10;
            for(;xb;--xb)putchar(buf[xb]+48);
        }
}
int main(){
    //freopen("ex_gcd3.in","r",stdin);
    //freopen("b.txt","w",stdout);
    n=getint();
    for(i=2;i<=n;++i)t.p[i]=getint(),t.addedge(t.p[i],i);
    t.f[0]=1<<30;
    t.sum=n;
    t.dfs(1,t.rt=0);
    t.solve(t.rt);
    for(i=n-1;i;--i)
        for(j=i<<1;j<n;j+=i)
            g[i]-=g[j];
    for(i=1;i<n;++i)putl(g[i]+gg[i]),putchar('\n');
    return 0;
}