Cod sursa(job #363906)

Utilizator antoanelaAntoanela Siminiuc antoanela Data 14 noiembrie 2009 23:12:53
Problema Stramosi Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.83 kb
#include <cstdio>
#include <vector>
#define LMAX 300010
using namespace std;

vector <int> G[LMAX], V[LMAX], R[LMAX];
int n, m, a[LMAX], h, S[LMAX], U[LMAX], x[LMAX], p[LMAX];

void df(int nod)
{
	int i;
	U[nod]=1;
	h++;
	S[h]=nod;
	for (i=0; i<V[nod].size(); i++) 
		R[nod].push_back(S[h-V[nod][i]]);
	for (i=0; i<G[nod].size(); i++)
		if (!U[G[nod][i]])
		{
			U[G[nod][i]]=1;
			df(G[nod][i]);
		}
	h--;
}

int main()
{
	freopen("stramosi.in","r",stdin);
	freopen("stramosi.out","w",stdout);
	scanf("%d %d",&n,&m);
	int i, y, j;
	for (i=1; i<=n; i++) 
	{
		scanf("%d",&a[i]);
		G[a[i]].push_back(i);
	}
	for (i=1; i<=m; i++)
	{
		scanf("%d %d",&x[i],&y);
		V[x[i]].push_back(y);
	}
	df(0);
	for (i=1; i<=m; i++) p[i]=0;
	for (i=1; i<=m; i++)
	{
		printf("%d\n",R[x[i]][p[x[i]]]);
		p[x[i]]++;
	}
}