Pagini recente » Cod sursa (job #587803) | Cod sursa (job #1235830) | Cod sursa (job #2745656) | Cod sursa (job #2743477) | Cod sursa (job #2786234)
#include<bits/stdc++.h>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
#define L 1000000
#define M 100005
#define X ((++o==L)?f.read(B,L),o=0:0)
vector<int> G[M];
int n,d[M],s[M],D[M],S[M],t,o,i,a,b;
char B[L];
void R(int &x)
{
for(x=0;B[o]<'0'||B[o]>'9';X);
for(;B[o]>='0'&&B[o]<='9';X)
x=x*10+B[o]-'0';
}
void F(int k)
{
S[++t]=k;
if(s[k])
D[k]=D[S[t-s[k]]]+1;
for(auto j:G[k])
F(j);
--t;
}
int main()
{
for(R(n),i=1;i<=n;++i)
R(s[i]);
for(i=1;i<n;++i)
R(a),R(b),G[a].push_back(b),d[b]=a;
for(i=1;d[i];++i)
for(F(i),i=1;i<=n;++i)
g<<D[i]<<' ';
return 0;
}