微软编程之美初赛第一场第二题树

#include<iostream>
#include<string.h>
#define  N 1001
using namespace std;
int d[N][N];
int depth[N];
long long w[N];
int n;
void calucatedepth(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(d[i][j])
                depth[j]=1+depth[i];
        }
    }
}
void operatree(int u,int l,int r,int delta){
    if(depth[u]>r)
        return;
    if(depth[u]>=l&&depth[u]<=r){
        w[u]+=delta;
    }
    for(int i=1;i<=n;i++)
        if(d[u][i])
            operatree(i,l,r,delta);
    
}
void printhash(){
    long mod=1000000007;
    long magic=12347;
    long long Hs=0;
    for(int i=1;i<=n;i++){
        Hs=(Hs*magic+w[i])%mod;
    }
    cout<<Hs<<endl;
}
int main(){
    int T;
    cin>>T;
    for(int Case=1;Case<=T;Case++){
        memset(d,0x0,sizeof(d));
        memset(depth,0x0,sizeof(depth));
        memset(w,0x0,sizeof(w));
        cin>>n;
        int temp,Q,u,l,r,delta;
        depth[1]=1;
        for(int i=2;i<=n;i++){
            cin>>temp;
            d[temp][i]=1;
        }
        calucatedepth();
        cin>>Q;
        while(Q--){
            cin>>u>>l>>r>>delta;
            operatree(u,l,r,delta);
        }
        cout<<"Case "<<Case<<": ";
        printhash();
    }
}