Cod sursa(job #2592157)

Utilizator NashikAndrei Feodorov Nashik Data 1 aprilie 2020 12:21:56
Problema Cerere Scor 70
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.31 kb
//#include <iostream>
#include <fstream>
using namespace std;
int lg[100005],put[20],nex[20][100005],f[100005],d[100005],str[100005];
int stramos(int nod,int dist){
    int e=lg[dist];
    while(dist!=0){
        nod=nex[e][nod];
        dist-=put[e];
        e=lg[dist];
    }
    return nod;
}
void fa(int nod){
    //cout<<nod<<" ";
    if(f[nod]==1){
        return;
    }
    if(str[nod]==0){
        f[nod]=1;
        d[nod]=0;
        return;
    }
    int x=stramos(nod,str[nod]);
    fa(x);
    f[nod]=1;
    d[nod]=d[x]+1;
}
ifstream cin("cerere.in");
ofstream cout("cerere.out");
int main()
{
    int n,a,b;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>str[i];
    }
    for(int i=1;i<n;i++){
        cin>>a>>b;
        f[b]++;
        nex[0][b]=a;
    }
    int root=0;
    for(int i=1;i<=n;i++){
        if(f[i]==0){
            root=i;
        }
        f[i]=0;
    }
    nex[0][root]=root;
    put[0]=1;
    for(int i=1;i<=16;i++){
        put[i]=put[i-1]*2;
        lg[put[i]]++;
    }
    for(int i=1;i<=100000;i++){
        lg[i]+=lg[i-1];
    }
    for(int i=1;i<=16;i++){
        for(int j=1;j<=n;j++){
            nex[i][j]=nex[i-1][nex[i-1][j]];
        }
    }
    for(int i=1;i<=n;i++){
        //cout<<i<<" "<<str[i]<<" "<<stramos(i,str[i])<<"\n";
        fa(i);
        cout<<d[i]<<" ";
    }
    return 0;
}