Pagini recente » Cod sursa (job #218756) | Cod sursa (job #1261169) | Cod sursa (job #728455) | Cod sursa (job #420953) | Cod sursa (job #3175272)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
vector<int> vecini[100005];
int stramosi[100005];
int rasp[100005];
vector<int> lant_curent;
void dfs(int nivel){
for (int i = 0; i < vecini[lant_curent.back()].size(); i++){
int vecin = vecini[lant_curent.back()][i];
lant_curent.push_back(vecin);
if (stramosi[vecin] == 0)
rasp[vecin] = 0;
else {
int lung_lant = lant_curent.size() - 1;
int stramos = lant_curent[lung_lant - stramosi[vecin]];
rasp[vecin] = rasp[stramos] + 1;
}
dfs(nivel + 1);
lant_curent.pop_back();
}
}
int main(){
int n;
fin >> n;
for (int i = 1; i <= n; i++){
fin >> stramosi[i];
}
for (int i = 1; i < n; i++){
int x, y;
fin >> x >> y;
vecini[x].push_back(y);
}
rasp[1] = 0;
lant_curent.push_back(1);
dfs(1);
for (int i = 1; i <= n; i++){
fout << rasp[i] << " ";
}
return 0;
}