Pagini recente » Clasament pregatire-monthly8-ziua1 | Istoria paginii runda/fdsf | Istoria paginii runda/iiot_simulare | Istoria paginii runda/testare_olimpiada | Cod sursa (job #2023048)
#include <bits/stdc++.h>
#define N 250001
#define M 300001
using namespace std;
FILE *f1 = fopen("stramosi.in", "r");
FILE *f2 = fopen("stramosi.out", "w");
int dp[20][N], n, m, a, i, j, p, q, power, step[N], ind;
int main()
{
fscanf(f1, "%d%d", &n, &m);
for (i = 1; i <= n; i++)
fscanf(f1, "%d", &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]];
step[1] = 0;
for (i = 2; i <= n; i++)
step[i] = step[i/2] + 1;
for (i = 1; i <= m; i++)
{
fscanf(f1, "%d%d", &q, &p);
ind = step[p];
power = 1 << ind;
a = dp[ind][q];
while (a != 0 && power < p)
{
power++;
a = dp[0][a];
}
fprintf(f2, "%d\n", a);
}
fclose(f1);
fclose(f2);
return 0;
}