Pagini recente » Cod sursa (job #2609050) | Cod sursa (job #2082221) | Cod sursa (job #2362105) | Cod sursa (job #2240672) | Cod sursa (job #2889990)
#include <iostream>
using namespace std;
FILE *fin = fopen("stramosi.in", "r");
FILE *fout = fopen("stramosi.out", "w");
int dads[20][250005];
int maxx[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]);
maxx[i] = 1 << 20;
}
for (int j = 1; j < 20; j++)
for (int k = 1; k <= N; k++)
{
dads[j][k] = dads[j - 1][dads[j - 1][k]];
if (dads[j][k] == 0)
maxx[k] = min(maxx[k], 1 << j);
}
while (M--)
{
long long q, p;
fscanf(fin, "%lld %lld", &q, &p);
/* long long pow2 = 0;
long long current = q;
if (p >= maxx[current])
{
fprintf(fout, "0\n");
continue;
}
int minn = min(maxx[q], 1 << 19);
while ((1 << pow2) <= maxx[q])
{
if ((p & (1 << pow2)) != 0)
current = dads[pow2][current];
pow2++;
}*/
fprintf(fout, "%lld\n", q);
}
}