Pagini recente » Cod sursa (job #795340) | Cod sursa (job #1501847)
#include <cstdio>
#include <algorithm>
#include <vector>
#define DIM 250000
using namespace std;
int NthFather[20][DIM], N, M, X, Y;
class InputReader {
public:
InputReader() {}
InputReader(const char *file_name) {
input_file = fopen(file_name, "r");
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
inline InputReader &operator >>(int &n) {
while(buffer[cursor] < '0' || buffer[cursor] > '9') {
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
n = n * 10 + buffer[cursor] - '0';
advance();
}
return *this;
}
private:
FILE *input_file;
static const int SIZE = 1 << 17;
int cursor;
char buffer[SIZE];
inline void advance() {
++ cursor;
if(cursor == SIZE) {
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
}
};
int main ()
{
InputReader fin ("stramosi.in" );
freopen ("stramosi.out","w", stdout);
fin >> N >> M;
for (int i = 1; i <= N; i ++)
fin >> NthFather[0][i];
for (int i = 1; i <= 19; i ++)
for (int j = 1; j <= N; j ++)
NthFather[i][j] = NthFather[i-1][NthFather[i-1][j]];
for (int i = 1; i <= M; i ++)
{
fin >> X >> Y;
for (int j = 30; Y; j --)
if ((1<<j) <= Y)
{
Y -= (1<<j);
X = NthFather[j][X];
}
printf ("%d\n", X);
}
fclose (stdin );
fclose (stdout);
return 0;
}