Pagini recente » Cod sursa (job #1913839) | Cod sursa (job #2115103) | Cod sursa (job #1585315) | Cod sursa (job #3211968) | Cod sursa (job #1535953)
#include <cstdio>
#include <iostream>
#include <set>
#include <climits>
#include <map>
#include <algorithm>
#include <list>
#include <vector>
#include <utility>
#include <cstdlib>
using namespace std;
int par[100005], rez[100005], v[100005];
void f(int i) {
if (v[i] == 0) {
return;
}
int next = 1;
while (v[i] > 0) {
next = par[next];
v[i]--;
}
f(next);
rez[i] = 1 + rez[next];
}
int main() {
// freopen("tt.txt", "r", stdin);
freopen("cerere.in", "r", stdin);
freopen("cerere.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
par[b] = a;
}
for (int i = 1; i <= n; i++) {
f(i);
cout << rez[i] << " ";
}
return 0;
}