Pagini recente » Cod sursa (job #1229159) | Cod sursa (job #2193071) | Cod sursa (job #3218897) | Cod sursa (job #3218880) | Cod sursa (job #3264489)
//
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("fast-math")
//#pragma GCC optimize ("unroll-loops")
//#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
//#include <vector>
//#include <queue>
//#include <utility>
//#include <algorithm>
//#include <cmath>
//#include <climits>
//#include <bitset>
//#include <iomanip>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int d[20][250010];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, i, j, q, p;
fin >> n >> m;
for (i = 1; i <= n; ++i)
{
fin >> d[0][i];
}
for (i = 1; (1<<i) <= n; ++i)
{
for (j = 1; j <= n; ++j)
{
d[i][j] = d[i - 1][d[i - 1][j]];
}
}
for (i = 1; i <= m; ++i)
{
fin >> q >> p;
for (j = 0; p!=0; ++j)
{
if (p & 1)
{
q = d[j][q];
}
p = p >> 1;
}
fout << q << "\n";
}
return 0;
}