Pagini recente » Cod sursa (job #42110) | Cod sursa (job #741804) | Cod sursa (job #59709) | Cod sursa (job #2211462) | Cod sursa (job #2632119)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("cerere.in");
ofstream cout("cerere.out");
const int lim=1e5+4;
vector<int> vec[lim];
int deg[lim],drum[lim];
int k[lim],ans[lim];
void df(int nod,int depth)
{
drum[depth]=nod;
if(k[nod]==0) ans[nod]=0;
else ans[nod]=ans[drum[depth-k[nod]]]+1;
for(int x:vec[nod]) df(x,depth+1);
}
int main()
{
int n,root,a,b;
cin>>n;
for(int i=1;i<=n;++i)
cin>>k[i];
for(int i=1;i<n;++i)
{
cin>>a>>b;
vec[a].push_back(b);
++deg[b];
}
root=0;
for(int i=1;i<=n and !root;++i)
if(!deg[i]) root=i;
df(root,1);
for(int i=1;i<=n;++i)
cout<<ans[i]<<' ';
return 0;
}