Pagini recente » Cod sursa (job #2983388) | Rezultatele filtrării | Rezultatele filtrării | Borderou de evaluare (job #1962073) | Cod sursa (job #2889977)
#include <iostream>
FILE *fin = fopen("stramosi.in", "r");
FILE *fout = fopen("stramosi.out", "w");
int dads[20][250005];
int main()
{
int N, M;
fscanf(fin, "%d %d", &N, &M);
for (int i = 1; i <= N; i++)
fscanf(fin, "%d", &dads[0][i]);
for (int j = 1; j < 20; j++)
for (int k = 1; k <= N; k++)
dads[j][k] = dads[j - 1][dads[j - 1][k]];
while (M--)
{
long long q, p;
fscanf(fin, "%lld %lld", &q, &p);
long long pow2 = 0;
long long current = q;
while (p != 0 && pow2 < 20)
{
if ((p & (1 << pow2)) != 0)
{
p -= 1 << pow2;
current = dads[pow2][current];
}
pow2++;
}
fprintf(fout, "%lld\n", current);
}
}