Pagini recente » Istoria paginii runda/11dlabparcurgeri/clasament | Istoria paginii runda/preoji2016sim/clasament | Cod sursa (job #2002693) | Istoria paginii runda/simulare-cartita-27 | Cod sursa (job #1994966)
#include<fstream>
#include<vector>
using namespace std;
ifstream fi("cerere.in");
ofstream fo("cerere.out");
int sol[100001]; //vector de solutii
int t[100001];//vector de tati
int k[100001],n;
int st[100001],m;
vector<int> G[100001];
void dfs(int x)
{
st[++m]=x;
if(k[x]) sol[x]=sol[st[m-k[x]]]+1;
for(auto & y : G[x]) dfs(y);
--m;
}
int main ()
{
fi>>n;
for(int i=1;i<=n;i++) fi>>k[i];
for(int i=1,x,y;i<=n-1;i++)
{fi>>x>>y;
G[x].push_back(y);
t[y]=1;
}
for(int i=1;i<=n;++i)
if(!t[i]) {dfs(i);break;} //i este radacina
for(int i=1;i<=n;++i) fo<<sol[i]<<" ";
return 0;
}