Pagini recente » Cod sursa (job #890547) | Cod sursa (job #1380660) | Cod sursa (job #1159586) | Cod sursa (job #1358686) | Cod sursa (job #2791616)
#include <vector>
#include <fstream>
#include <bitset>
using namespace std;
const int N=100001;
vector<int> a[N];
int stram[N];
int stramos[N];
int rezultat[N];
int cnt=0;
bitset<N+1>dif_radacina;
void parcurgere(int x){
stram[cnt]=x;
if(stramos[x]!=0){
int str=stram[cnt-stramos[x]];
rezultat[x]=rezultat[str]+1;
}
cnt++;
for(auto y:a[x]){
parcurgere(y);
}
cnt--;
}
int main() {
ifstream in("cerere.in");
ofstream out("cerere.out");
int n;
in>>n;
for(int i=1;i<=n;i++){
in>>stramos[i];
}
int x,y;
for(int i=1;i<n;i++){
in>>x>>y;
a[x].push_back(y);
dif_radacina[y]=true;
}
int radacina;
for(int i=1;i<=n;i++){
if(!dif_radacina[i])
radacina=i;
}
parcurgere(radacina);
for(int i=1;i<=n;i++){
out<<rezultat[i]<<" ";
}
}