Pagini recente » Cod sursa (job #1447126) | Cod sursa (job #1634258) | Cod sursa (job #512019) | Cod sursa (job #2873405) | Cod sursa (job #2485426)
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
int n, t[100005], str[100005], k[100005], res[100005];
vector <int> fii[100005];
vector <int> fii2[100005];
void dfs(int x, vector <int> stramosi) {
if(!k[x])
str[x] = 0;
else
str[x] = stramosi[stramosi.size()-k[x]];
if(str[x])
fii2[str[x]].push_back(x);
stramosi.push_back(x);
for(int i = 0; i < fii[x].size(); i++)
dfs(fii[x][i], stramosi);
stramosi.pop_back();
}
void dfs2(int x) {
if(k[x] == 0)
res[x] = 0;
else
res[x] = res[str[x]]+1;
for(int i = 0; i < fii[x].size(); i++)
dfs2(fii[x][i]);
}
void citire() {
memset(res, -1, sizeof res);
fin >> n;
for(int i = 1; i <= n; i++) {
fin >> k[i];
if(!k[i])
res[i] = 0;
}
for(int i = 1; i < n; i++) {
int x, y;
fin >> x >> y;
t[y] = x;
fii[x].push_back(y);
}
}
void solve() {
int root;
for(int i = 1; i <= n; i++)
if(t[i] == 0)
root = i;
vector <int> s;
dfs(root, s);
dfs2(root);
}
void afis() {
for(int i = 1; i <= n; i++)
fout << res[i] << ' ';
}
int main() {
citire();
solve();
afis();
}