Pagini recente » Cod sursa (job #1830566) | Cod sursa (job #812814) | Cod sursa (job #1346851) | Cod sursa (job #1144151) | Cod sursa (job #1244138)
#include<fstream>
using namespace std;
ifstream in("cerere.in");
ofstream out("cerere.out");
const int NMAX = 100009;
int init[NMAX],tata[NMAX],n;
void citire()
{
in>>n;
for(int i = 1 ; i <= n ; i++)
in>>init[i];
int x,y;
for(int i = 1 ; i < n ; i++)
{
in>>x>>y;
tata[y] = x;
}
in.close();
return;
}
int solve(int nod,int k)
{
int sol = 0;
while(init[nod] != 0)
{
++sol;
for(int i = 1 ; i <= k ; i++)
nod = tata[nod];
}
return sol;
}
int main()
{
citire();
for(int i = 1 ; i <= n; i++)
out<<solve(i,init[i])<<" ";
out.close();
return 0;
}