Pagini recente » Cod sursa (job #355613) | Cod sursa (job #2692489) | Cod sursa (job #186688) | Cod sursa (job #1278353) | Cod sursa (job #1505481)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
int VIZ[100001],t[100001],v[100001],i,j,x,y,n,k,cmi;
bool viz[100001],vviz[100001];
vector <int> G[100001];
void DFS(int nod){
viz[nod]=1;
if(v[nod]==0)
{
VIZ[nod]=0;
t[k]=0;
}
else
{
VIZ[nod]=t[k-v[nod]]+1;
t[k]=VIZ[nod];}
for(int i=0;i<G[nod].size();i++)
if(viz[G[nod][i]]==0){
k++;
DFS(G[nod][i]);
k--;
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;i++){
f>>x>>y;
G[x].push_back(y);
vviz[y]=1;}
for(i=1;i<=n;i++)
if(vviz[i]==0){
cmi=i;
break;
}
DFS(cmi);
for(i=1;i<=n;i++)
g<<VIZ[i]<<" ";
return 0;
}