Pagini recente » Cod sursa (job #1555883) | Cod sursa (job #890459) | Cod sursa (job #1854534) | Cod sursa (job #886942) | Cod sursa (job #1398521)
#include <fstream>
#include <vector>
using namespace std;
#define NMax 100005
ifstream f("cerere.in");
ofstream g("cerere.out");
int N,K[NMax];
vector<int> v[NMax];
int st[NMax];
int viz[NMax];
int sol[NMax];
void DFS(int x,int poz)
{
viz[x] = true;
st[poz] = x;
for(int i=0;i<v[x].size();++i) if(!viz[v[x][i]])
{
if(K[v[x][i]]) sol[v[x][i]] = sol[st[poz+1-K[v[x][i]]]]+1;
else sol[v[x][i]] = 0;
DFS(v[x][i],poz+1);
}
}
int tata[NMax];
int main()
{
int i,a,b;
f>>N;
for(i=1;i<=N;++i) f>>K[i];
for(i=1;i<N;++i)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
tata[b] = a;
}
for(i=1;i<=N;++i) if(!tata[i])
{
DFS(i,1);
break;
}
for(i=1;i<=N;++i) g<<sol[i]<<" "; g<<"\n";
f.close();
g.close();
return 0;
}