Pagini recente » Cod sursa (job #397490) | Cod sursa (job #2684212) | Cod sursa (job #487655) | Cod sursa (job #145595) | Cod sursa (job #2269386)
#include <iostream>
#include <fstream>
#define DIM 8192
const int MAXN = 250000 + 5,MAXLOG = 17 + 5;
using namespace std;
class Reader {
public:
Reader(const char* filename) {
f.open(filename);
pos = 0;
f.read(buffer,DIM);
}
inline Reader& operator >>(int& x) {
x=0;
sgn=1;
while((buffer[pos]<'0'||buffer[pos]>'9')&&buffer[pos]!='-')
if(++pos==DIM)
f.read(buffer,DIM),pos=0;
if(buffer[pos]=='-')sgn=-1,pos++;
while(buffer[pos]>='0'&&buffer[pos]<='9') {
x=x*10+buffer[pos]-'0';
if(++pos==DIM)f.read(buffer,DIM),pos=0;
}
x*=sgn;
return (*this);
}
inline Reader& operator >>(char* c) {
aux = 0;
while(isspace(buffer[pos]))
if(++pos==DIM)
f.read(buffer,DIM),pos=0;
while(!isspace(buffer[pos])) {
c[aux++]=buffer[pos];
if(++pos==DIM)f.read(buffer,DIM),pos=0;
}
return (*this);
}
~Reader() {
f.close();
}
private:
ifstream f;
int pos,aux,sgn;
char buffer[DIM];
};
class Writer {
public:
Writer(const char* filename) {
g.open(filename);
pos = 0;
}
inline Writer& operator <<(int xx) {
aux = 0;
x = xx;
if(xx<0)x=-x;
if(x==0)
nr[aux++]='0';
while(x) {
nr[aux++]=x%10+'0';
x/=10;
}
if(xx<0)nr[aux++]='-';
while(aux>0) {
buffer[pos++]=nr[--aux];
if(pos==DIM)g.write(buffer,DIM),pos=0;
}
return (*this);
}
inline Writer& operator <<(const char* c) {
aux = 0;
while(c[aux]) {
buffer[pos++]=c[aux++];
if(pos==DIM)g.write(buffer,DIM),pos=0;
}
return (*this);
}
~Writer() {
g.write(buffer,pos);
g.close();
}
private:
ofstream g;
int pos,aux,x;
char buffer[DIM],nr[21];
};
Reader in("stramosi.in");
Writer out("stramosi.out");
int dp[MAXN][MAXLOG],log[MAXN];
int n,q;
inline void query(int nod,int stramos){
int ans = nod;
while(stramos && ans){
ans = dp[ans][log[stramos]];
stramos -= (1 << log[stramos]);
}
out<<ans<<"\n";
}
int main()
{
in>>n>>q;
for(int i = 1; i <= n; ++i)
in>>dp[i][0];
for(int i = 2; i <= n; ++i)
log[i] = log[i >> 1] + 1;
for(int put = 1; put < MAXLOG; ++put)
for(int i = 1; i <= n; ++i)
dp[i][put] = dp[dp[i][put - 1]][put - 1];
for(int i = 1; i <= q; ++i){
int nod,k_stramos;
in>>nod>>k_stramos;
query(nod,k_stramos);
}
return 0;
}