Cod sursa(job #2124674)

Utilizator Laura_CorneiLaura Maria Cornei Laura_Cornei Data 7 februarie 2018 14:24:37
Problema Cerere Scor 30
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.39 kb
#include <stdio.h>
#include <vector>
#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], nrs[nmax], stramosi[nmax][100];
vector <int> v[nmax];
void citire()
{
    int i,j, x, y, nr, nod, p[100];
    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;}

    ///identificare stramosi
    for(i=1; i<=n; i++)
    {
       if(k[i]==0) stramosi[i][0]=i;
       else if(stramosi[i][k[i]]==0) ///daca nu l-ai calculat deja
       {
           nr=k[i];
           nod=i;
           for(j=nr; j>=1; j--)
           {
               p[j]=nod;
               nod=t[nod];
           }
           for(j=1; j<=nr; j++)
              stramosi[p[j]][j]=nod;
       }
    }
    for(i=1; i<=n; i++)
        k[i]=stramosi[i][k[i]];
}
void dfs(int nod)
{
    g[nod]=g[k[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;
}