Cod sursa(job #1786792)

Utilizator Julian.FMI Caluian Iulian Julian. Data 23 octombrie 2016 18:09:00
Problema Cerere Scor 25
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.81 kb
#include <iostream>
#include <fstream>
#define nmax 100099
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
int g[nmax][2],k[nmax],rez[nmax],s[nmax],sf[nmax];
char viz[nmax];

int main()
{int i,n,a,b,rad,fiu;
fin>>n;
for(i=1;i<=n;i++)
{fin>>k[i];}
for(i=1;i<=n-1;i++)
    {fin>>a>>b;if(g[a][0])g[a][1]=b;
     else g[a][0]=b;
     viz[b]=1;
     }
    rad=1;while(viz[rad])rad++;


//dfs:
int vf=1;
s[1]=rad;vf=1;
    while(vf)
    {//for(i=1;i<=vf;i++)cout<<s[i]<<' ';cout<<endl;
    rad=s[vf];
     fiu=sf[vf];
     if(vf-k[rad]<vf)
     rez[rad]=rez[s[vf-k[rad]]]+1;

     if(fiu<2)
     {while(fiu<2 && g[rad][fiu]==0)fiu++;
        if(fiu<2)
        {s[++vf]=g[rad][fiu];
         sf[vf]=0;
         sf[vf-1]++;
        }else vf--;
     }else vf--;
    }
for(i=1;i<=n;i++)fout<<rez[i]<<' ';

}