Cod sursa(job #1759056)
Utilizator | Rotaru Gheorghe-Iulian iulianrotaru | Data | 18 septembrie 2016 14:22:58 |
---|---|---|---|
Problema | Cerere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
int i,x,y,t,n,T[1<<17],k[1<<17],sol[1<<17],s[1<<17];
vector <int> v[1<<17];
void dfs(int x)
{
s[++t]=x;
if(k[x]) sol[x]=sol[s[t-k[x]]]+1;
for(int i=0;i<v[x].size();++i)
dfs(v[x][i]);
--t;
}
int main()
{
f>>n;
for(i=1;i<=n;++i) f>>k[i];
for(i=1;i<n;++i)
{
f>>x>>y;
v[x].push_back(y);
T[y]=1;
}
for(i=1;T[i];++i);
dfs(i);
for(i=1;i<=n;++i) g<<sol[i]<<' ';
return 0;
}