Cod sursa(job #643047)

Utilizator okros_alexandruOkros Alexandru okros_alexandru Data 2 decembrie 2011 19:54:00
Problema Stramosi Scor 80
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.59 kb
#include<fstream>
#include<vector>
#define NMAX 250500
#define NMAX2 300300
///////////////////////
#define MaxBuffer 8192
char buffer[MaxBuffer];
int bufferIndex=8191;
///////////////////////
using namespace std;
vector <int> v[NMAX];
vector <pair<int,int> > query[NMAX];
int n,sol[NMAX2],stack[NMAX],nr,q,viz[NMAX],stramos;
inline void read_buffer(istream& in,int& x) {
	do {if(++bufferIndex==MaxBuffer) {
		bufferIndex=0;
		in.read(buffer,MaxBuffer);
		}
	}while( buffer[bufferIndex]<'0'||buffer[bufferIndex]>'9' );
 
	for(x=0;buffer[bufferIndex]>='0'&&buffer[bufferIndex]<= '9';) {
		x=x*10+buffer[bufferIndex]-'0';
		if(++bufferIndex==MaxBuffer) {
			bufferIndex=0;
			in.read(buffer,MaxBuffer);
			}
		}
}
void afis() {
	int i;
	ofstream out("stramosi.out");
	for(i=0;i<q;i++)
		out<<sol[i]<<'\n';
	out.close();
}
inline void answer_queries(int nod) {
	unsigned int i,stramos;
	for(i=0;i<query[nod].size();i++) {
		stramos=query[nod][i].first;
		if(nr-stramos)
			sol[query[nod][i].second]=stack[nr-stramos];
		}
}
void dfs(int nod) {
	unsigned int i;
	viz[nod]=1;
	stack[++nr]=nod;
	answer_queries(nod);
	for(i=0;i<v[nod].size();i++)
		dfs(v[nod][i]);
	--nr;
}
void citire() {
	int i,x,y;
	ifstream in("stramosi.in");
	read_buffer(in,n);
	read_buffer(in,q);
	for(i=0;i<n;i++) {
		read_buffer(in,x);
		v[x].push_back(i+1);
		}
	for(i=0;i<q;i++) {
		read_buffer(in,x);
		read_buffer(in,y);
		query[x].push_back(pair<int,int>(y,i));
		}
	in.close();
}
int main() {
	citire();
	for(int i=1;i<=n;i++)
		if(!viz[i])
			dfs(i);
	afis();
	return 0;
}