Pagini recente » Cod sursa (job #1856493) | Cod sursa (job #2757739) | Cod sursa (job #2987420) | Cod sursa (job #486728) | Cod sursa (job #1235616)
#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("stramosi.in");
ofstream ki("stramosi.out");
const int N_MAX = 250000;
const int LOG_MAX = 19;
int stramos[N_MAX + 1][LOG_MAX];
int srch(int p, int q)
{
if(p == 0)
return q;
for(int i = 18; i >= 0; i--)
if(p & (1 << i))
{
return srch(p - (1 << i), stramos[q][i]);
}
}
string s;
int n, m, p, q, k;
int main()
{
ka >> n >> m;
for(int i = 1; i <= n; i++)
ka >> stramos[i][0];
int log = 0;
for(int i = 18; i >= 0; i--)
if(n & (1 << i))
{
log = i;
break;
}
for(int j = 1; j <= log; j++)
for(int i = 1; i <= n; i++)
stramos[i][j] = stramos[stramos[i][j-1]][j-1];
for(int i = 1; i <= m; i++)
{
ka >> q >> p;
ki << srch(p, q) << '\n';
}
}