Pagini recente » Cod sursa (job #3329494) | Cod sursa (job #3317429) | Cod sursa (job #1854716) | Cod sursa (job #990900) | Cod sursa (job #3341344)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
int n,K[100005],cnt_membrii=0,cnt_pasi=0,k;
vector<int> ad[100005];
void citire(){
fin>>n;
for(int i=1;i<=n;i++){
fin>>K[i];
}
int i,j;
while(fin>>i>>j){
ad[j].push_back(i);//ne intereseaza directia de la fiu catre parinte(j->i), adica relatia exterioara
}
}
void parcurgere(int start,int k){
if(cnt_pasi==k){
cnt_pasi=0;
cnt_membrii++;
if(K[start]==0) return;
parcurgere(start, K[start]);
}
else{
cnt_pasi++;
parcurgere(ad[start][0],k);
}
//fiecare fiu are un singur stramosi
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(NULL);
citire();
for(int i=1;i<=n;i++){
cnt_membrii=0, cnt_pasi=0,k=K[i];
if(k!=0){
parcurgere(i,k);
fout<<cnt_membrii<<" ";
}
else fout<<0<<" ";
}
return 0;
}