Cod sursa(job #2124648)

Utilizator Laura_CorneiLaura Maria Cornei Laura_Cornei Data 7 februarie 2018 14:04:03
Problema Cerere Scor 30
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.29 kb
#include <fstream>
#include <vector>
#include <stdio.h>
#define nmax 100005
using namespace std;
FILE * f1=fopen("cerere.in", "r");
FILE * f2=fopen("cerere.out", "w");
int n, k[nmax], t[nmax], rad, viz[nmax], g[nmax], stramosi[nmax][20], nrs[nmax];
vector <int> v[nmax];
///stramosi[i][j]= al j-lea stramos al lui i
///nrs[i]= nr stramosi nodul i
void citire()
{
    int i, x, y;
    fscanf(f1, "%d", &n);
    for(i=1; i<=n; i++)
        fscanf(f1, "%d", &k[i]);
    for(i=1; i<n; i++)
    {
        fscanf(f1, "%d%d", &x, &y);
        t[y]=x;
        v[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        if(t[i]==0) {rad=i; break;}
}
void dfs(int nod)
{
    if(t[nod]!=0)
    {
        nrs[nod]=nrs[t[nod]];
        for(int i=1; i<=nrs[nod]; i++)
            stramosi[nod][i]=stramosi[t[nod]][i];
        nrs[nod]++;
        stramosi[nod][nrs[nod]]=t[nod];

        if(k[nod]!=0) g[nod]=g[stramosi[nod][nrs[nod]+1- k[nod]]]+1;
        else g[nod]=1;
    }
    else g[nod]=1;

    viz[nod]=1;
    for(auto it=v[nod].begin(); it!=v[nod].end(); ++it)
        if(!viz[*it])
           dfs(*it);
}
void afisare()
{
    int i;
    for(i=1; i<=n; i++)
        fprintf(f2, "%d ", g[i]-1);
}
int main()
{
    citire();
    dfs(rad);
    afisare();
    return 0;
}