Pagini recente » Cod sursa (job #37614) | Cod sursa (job #1581764) | Cod sursa (job #2756075) | Cod sursa (job #511044) | Cod sursa (job #605798)
Cod sursa(job #605798)
#include <fstream>
#include <assert.h>
#include <vector>
#define NMax 100010
using namespace std;
const char IN[]="cerere.in",OUT[]="cerere.out";
ifstream fin(IN); ofstream fout(OUT);
int N,L;
int a[NMax] , T[NMax];
vector<int> ad[NMax] ;
int v[NMax];
void dfs(int x=1,int niv=0)
{
v[niv]=x;
if (a[x] && x!=1) T[x]=T[v[niv-a[x]]]+1;
for (vector<int>::iterator it=ad[x].begin();it<ad[x].end();++it)
dfs(*it,niv+1);
}
int main()
{
int i,x,y;
fin>>N;
for (i=1;i<=N;++i) fin>>a[i];
for (i=1;i<N;++i)
fin>>x>>y,
ad[x].push_back(y),
assert( 1<=x && x<=N && 1<=y && y<=N);
a[1]=0;
dfs();
for (i=1;i<=N;++i)
fout<<T[i]<<" ";
fout<<"\n";
return 0;
}