Cod sursa(job #1507017)

Utilizator cristibogdanPatrascu Cristian cristibogdan Data 21 octombrie 2015 11:00:43
Problema Cerere Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.43 kb
#include <fstream>
#include <vector>
#include <string.h>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
int VIZ[100001],t[100001],v[100001],i,j,x,y,n,k,cmi,T,nr,poz;
bool viz[100001],vviz[100001];
char sir[800000];
vector <int> G[100001];
      void DFS(int nod){
    viz[nod]=1;
   if(v[nod]==0)
    {
        VIZ[nod]=0;
        t[k]=0;
    }
    else
    {
        VIZ[nod]=t[k-v[nod]]+1;
        t[k]=VIZ[nod];}
        for(int i=0;i<G[nod].size();i++)
                if(viz[G[nod][i]]==0){
                    k++;
                    DFS(G[nod][i]);
k--;
                    }

}
int main()
{
 f>>n;

 f.get();
    f.getline(sir+1, 800000);
    T=strlen(sir+1);
    for(i=1;i<=T+1;i++)
    {
        if(sir[i]>='0'&&sir[i]<='9')
            nr=nr*10+sir[i]-'0';
        else
        {
            v[++poz]=nr;
            nr=0;
        }
    }
for(j=1;j<=n-1;j++){
        f.getline(sir+1, 800000);
        T=strlen(sir+1);
        x= y=0;
        for(i=1;i<=T;i++)
        {
            if(sir[i]>='0'&&sir[i]<='9')
                y=y*10+sir[i]-'0';
            else
            {
                x=y;
                y=0;
            }
        }

        G[x].push_back(y);
        vviz[y]=1;

    }

    for(i=1;i<=n;i++)
    if(vviz[i]==0){
        cmi=i;
        break;
    }
DFS(cmi);
    for(i=1;i<=n;i++)
            g<<VIZ[i]<<" ";

    return 0;
}