Pagini recente » Cod sursa (job #2023603) | Cod sursa (job #962235) | Cod sursa (job #487628) | Cod sursa (job #2389071) | Cod sursa (job #643044)
Cod sursa(job #643044)
#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();
}
void dfs() {
unsigned int i,nod=stack[nr];
while(nr) {
if(!viz[nod])
for(i=0;i<query[nod].size();i++) {
stramos=query[nod][i].first;
if(nr-stramos)
sol[query[nod][i].second]=stramos;
}
if(viz[nod]<v[nod].size())
stack[++nr]=v[nod][viz[nod]++];
else
--nr,viz[nod]++;
nod=stack[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]) {
stack[++nr]=i;
dfs();
}
afis();
return 0;
}