Cod sursa(job #2144122)

Utilizator DovlecelBostan Andrei Dovlecel Data 26 februarie 2018 15:47:18
Problema Cerere Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.66 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cerere.in");
ofstream out("cerere.out");
const int N=100001;
int t[N],v[N],rasp[N],n;
int cauta(int x)
{
    if(v[x]==0)
        return 0;
    if(rasp[x]!=0)
        return rasp[x];
    int k,copie,cop;
    copie=v[x];
    cop=x;
    while(copie>0)
    {
        k=t[cop];
        copie--;
        cop=k;
    }
    rasp[x]=1+cauta(k);
    return rasp[x];
}
int main()
{
    int x,y,i;
    in>>n;
    for(i=1;i<=n;i++)
        in>>v[i];
    for(i=1;i<n;i++)
    {
        in>>x>>y;
        t[y]=x;
    }
    for(i=1;i<=n;i++)
        out<<cauta(i);
    return 0;
}