Pagini recente » Cod sursa (job #1627157) | Cod sursa (job #392074) | Cod sursa (job #2636041) | Cod sursa (job #1156837) | Cod sursa (job #1644683)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int MaxL = 20, MaxN = 250004;
int N, M;
int dp[MaxL][MaxN]; //d[i][j] - al (1 << i) - lea stramos al lui j
int main() {
fin >> N >> M;
for (int j = 1; j <= N; j++)
fin >> dp[0][j];
for (int i = 1; (1 << i) <= N; i++)
for (int j = 1; j <= N; j++)
dp[i][j] = dp[i - 1][dp[i - 1][j]];
for (int i = 0, x, y; i < M; i++) {
fin >> x >> y;
for (int j = 0; (1 << j) <= y; j++)
if ((1 << j) & y)
x = dp[j][x];
fout << x << '\n';
}
fin.close();
fout.close();
return 0;
}