Pagini recente » Cod sursa (job #2401908) | Cod sursa (job #915048) | Cod sursa (job #1259704) | Cod sursa (job #2070099) | Cod sursa (job #2120208)
#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 250005
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n;
int dp[20][NMAX];
int cautbin (int q, int p) {
int step;
if (p == 1) return dp[0][q];
for (step = 1; (1 << step) <= p; ++step);
step--;
if ((1 << step) == p) return dp[step][q];
while (p > 0) {
p -= (1 << step);
q = dp[step][q];
step--;
}
return q;
}
int main()
{
int m, i, j;
f >> n >> m;
for (i = 1; i <= n; ++i) {
f >> dp[0][i];
}
for (i = 1; i <= 18; ++i)
for (j = 1; j <= n; ++j)
dp[i][j] = dp[i - 1][dp[i - 1][j]];
int p, q;
for (i = 1; i <= m; ++i) {
f >> q >> p;
g << cautbin(q, p) << "\n";
}
for (i = 0; i <= 5; ++i) {
for (j = 1; j <= 5; ++j)
cout << dp[i][j] << " ";
cout << "\n";
}
return 0;
}