Cod sursa(job #568355)

Utilizator AndreiRSStatescu Andrei Rares AndreiRS Data 31 martie 2011 09:15:15
Problema Stramosi Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.83 kb
#include <fstream>
using namespace std;
#define DN 250005
#define DLGN 19

ifstream fi("stramosi.in");
ofstream fo("stramosi.out");

int N, logN, M, P, Q, T[DN][DLGN], D1[DN], D2[DN], R[DN];

void prep1()
{
	for (int i = 2; i <= N; i++)
	{
		D1[i] = D1[i>>1] + 1;
		D2[i] = D2[(i+1)>>1] + 1;		
	}
}

void prep2()
{
	int i, k;
	for (k = 2; k <= logN; k++)	
		for (i = 1; i <= N; i++)
			if (T[i][0] >= k)
				T[i][k] = T[T[i][k-1]][k-1];
}

int main()
{
	fi >> N >> M;
	prep1();
	
	for (int i = 1; i <= N; i++)
	{
		fi >> T[i][1];
		R[i] = R[T[i][1]] + 1;
		T[i][0] = D2[R[i]];
		if (T[i][0] > logN)
			logN = T[i][0];
	}
	prep2();
	
	for (int i = 0; i < M; i++)
	{
		fi >> Q >> P;
		while (P != 0)
		{
			
			Q = T[Q][D1[P]+1];
			P -= 1 << D1[P];
			
		}	
		fo << Q << '\n';
	}
	
	
}