Cod sursa(job #2673001)

Utilizator StanCatalinStanCatalin StanCatalin Data 15 noiembrie 2020 16:51:20
Problema Cerere Scor 70
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.13 kb
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <ctype.h>
#include <vector>

using namespace std;

///ifstream in("cerere.in");
ofstream out("cerere.out");

FILE *_fin;
int _in_loc; char _in_buff[4096];

void read_init(const char* nume){
	_fin = fopen(nume, "r");
	_in_loc = 4095;
}

char read_ch()
{
	++_in_loc;
	if (_in_loc == 4096) {
		_in_loc = 0;
		fread(_in_buff, 1, 4096, _fin);
	}
	return _in_buff[_in_loc];
}

int read_u32()
{
	int u32 = 0; char c;
	while (!isdigit(c = read_ch()) && c != '-');
	int sgn = 1;
	if (c == '-') {
		sgn = -1;
	} else {
		u32 = c - '0';
	}
	while (isdigit(c = read_ch())) {
		u32 = u32 * 10 + c - '0';
	}
	return u32 * sgn;
}

const int dim = 1e5 + 5;

int n,a[dim],stramosi[dim][18],dp[dim],lg[dim],radacina,am[dim];
vector<int> vec[dim];

int Get_Stramos(int nod,int k)
{
    int str = nod;
    while (k > 0)
    {
        str = stramosi[str][lg[k]];
        k -= (1<<lg[k]);
    }
    return str;
}

void DFS(int nod,int parent = 0)
{
    for (int k=1; k<10; k++)
    {
        stramosi[nod][k] = stramosi[stramosi[nod][k-1]][k-1];
    }
    if (a[nod] > 0)
    {
        dp[nod] = dp[Get_Stramos(nod, a[nod])] + 1;
    }
    for (auto y:vec[nod])
    {
        if (y != parent)
        {
            DFS(y, nod);
        }
    }
}

int main()
{
    read_init("cerere.in");
    n = read_u32();
    dp[1] = dp[0] = 0;
    for (int i=1; i<=n; i++)
    {
        ///in >> a[i];
        a[i] = read_u32();
    }
    stramosi[0][0] = 0;
    int x,y;
    for (int i=1; i<n; i++)
    {
       /// in >> x >> y;
        x = read_u32();
        y = read_u32();
        am[y] = 1;
        stramosi[y][0] = x;
        vec[x].push_back(y);
       /// vec[y].push_back(x);
    }
    int ok = 0;
    for (int i=1; i<=n && ok == 0; i++)
    {
        if (am[i] == 0)
        {
            radacina = i;
            ok = 1;
        }
    }
    for (int i=2; i<=n; i++)
    {
        lg[i] = 1 + lg[i/2];
    }
    DFS(radacina);

    for (int i=1; i<=n; i++)
    {
        out << dp[i] << " ";
    }
    return 0;
}