Pagini recente » Cod sursa (job #829831) | Cod sursa (job #2470356) | Cod sursa (job #848362) | Cod sursa (job #1427126) | Cod sursa (job #2942149)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int vec_len = 300001;
int dp[vec_len][20];
int main()
{
int n, m;
fin >> n >> m;
for (int i = 1; i <= n; i++)
fin >> dp[i][0];
for (int j = 1; j < 20; j++)
for (int i = 1; i <= n; i++)
if (dp[i][j - 1] == 0)
dp[i][j] = 0;
else
dp[i][j] = dp[dp[i][j - 1]][j - 1];
for (int q = 1; q <= m; q++)
{
int node, k;
fin >> node >> k;
for (int j = 0; j < 20; j++)
if ((k >> j) & 1)
{
node = dp[node][j];
if (node == 0)
break;
}
fout << node << "\n";
}
return 0;
}