Pagini recente » Cod sursa (job #2473371) | Cod sursa (job #828014) | Cod sursa (job #2793656) | Cod sursa (job #2553487) | Cod sursa (job #757693)
Cod sursa(job #757693)
#include<iostream>
#include<fstream>
#include<cstdio>
#include<cstdlib>
using namespace std;
//ifstream in("stramosi.in");
//ofstream out("stramosi.out");
char *buffer;
int d[18][250010], logg[250010];
void read(int &x)
{
while((*buffer < '0') || (*buffer > '9'))
++buffer;
x = 0;
while((*buffer >= '0') && (*buffer <= '9')){
x = ((x * 10) + (*buffer - '0'));
++buffer;
}
}
int main()
{
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
int i, n, q, nod, pas, j, fs;
fseek(stdin, 0, SEEK_END);
fs = ftell(stdin);
buffer = (char*) malloc(fs);
rewind(stdin);
fread(buffer, 1, fs, stdin);
//in >> n >> q;
read(n), read(q);
for(i = 1; i <= n; i++)
//in >> d[0][i];
read(d[0][i]);
for(i = 2; i <= n; ++i)
logg[i] = logg[i >> 1] + 1;
for(i = 1; i <= logg[n]; ++i)
for(j = 1; j <= n; ++j)
d[i][j] = d[i - 1][ d[i - 1][j] ];
while(q--){
//in >> nod >> pas;
read(nod), read(pas);
//i = pas;
//logg = 0;
//while(i >>= 1) logg++;
for(i = logg[pas]; i >= 0 && nod; --i)
if(pas & (1 << i))
nod = d[i][nod];
//out << nod << "\n";
printf("%d\n", nod);
}
return 0;
}