Pagini recente » Cod sursa (job #2944731) | Cod sursa (job #1477938) | Cod sursa (job #2775339) | Cod sursa (job #103170) | Cod sursa (job #1235614)
#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("stramosi.in");
ofstream ki("stramosi.out");
const int N_MAX = 250000;
const int LOG_MAX = 24;
int log[N_MAX + 1];
int stramos[N_MAX + 1][LOG_MAX];
int srch(int p, int q)
{
if(p == 0)
return q;
return srch(p - (1 << log[p]), stramos[q][log[p]]);
}
string s;
int n, m, p, q, k;
int main()
{
ka >> n >> m;
getline(ka, s);
getline(ka, s);
int curent = 0;
for(int i = 0; i < s.size(); i++)
{
if(s[i] == ' ')
{
stramos[++k][0] = curent;
curent = 0;
}
else if(s[i] >= '0' && s[i] <= '9')
curent = curent * 10 + s[i] - '0';
}
stramos[++k][0] = curent;
for(int i = 2; i <= n; i++)
log[i] = log[i / 2] + 1;
for(int j = 1; j <= log[n]; 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';
}
}