Cod sursa(job #2146097)

Utilizator tiberiu.bucur17Tiberiu Constantin Emanoil Bucur tiberiu.bucur17 Data 27 februarie 2018 19:48:26
Problema Cerere Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.42 kb
#include <iostream>
#include <cstdio>
#include <cctype>
#include <vector>
#define BUF_SIZE 131072
#define MAXN 100001
using namespace std;
FILE *fin,*fout;
vector <int> v[MAXN];
char buf[BUF_SIZE];
int stramos[MAXN],st[MAXN],d[MAXN],vf,pos=BUF_SIZE;
bool viz[MAXN];
inline char getch()
{
    if(pos==BUF_SIZE)
        fread(buf,BUF_SIZE,1,fin),pos=0;
    return buf[pos++];
}
inline int read()
{
    int x=0;
    char ch=getch();
    while(!isdigit(ch))
        ch=getch();
    while(isdigit(ch))
    {
        x=x*10+ch-'0';
        ch=getch();
    }
    return x;
}
inline void dfs(int x)
{
    int y;
    st[vf++]=x;
    while(vf)
    {
        x=st[vf-1];
        if(v[x].size())
        {
            st[vf++]=y=v[x].back();
            v[x].pop_back();
            if(stramos[y])
                d[y]=d[st[vf-1-stramos[y]]]+1;
        }
        else
            vf--;
    }
}
int main()
{
    fin=fopen("cerere.in","r");
    fout=fopen("cerere.out","w");
    int n,x,y;
    n=read();
    for(int i=1;i<=n;i++)
        stramos[i]=read();
    for(int i=1;i<n;i++)
    {
        x=read();y=read();
        v[x].push_back(y);
        viz[y]=true;
    }
    for(int i=1;i<=n;i++)
        if(!viz[i])
        {
            x=i;
            break;
        }
    dfs(x);
    for(int i=1;i<=n;i++)
        fprintf(fout,"%d ",d[i]);
    fclose(fin);
    fclose(fout);
    return 0;
}