Pagini recente » Cod sursa (job #712147) | Cod sursa (job #2808508) | Cod sursa (job #1801068) | Cod sursa (job #295842) | Cod sursa (job #1547442)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int a[250001][21], i, j, n, m, k, p, v[250001], q;
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
f>>v[i];
if (m<=150000) {
for (i=1;i<=m;i++) {
f>>q>>p;
for(j=1;j<=p;j++)
q=v[q];
g<<q<<"\n";
}
}
else {
for (i=1;i<=n;i++) {
a[0][i] = i;
for (j=1;j<=20;j++)
a[j][i] = v[a[j-1][i]];//precalculez matricea dupa stramosii demai sus
}
for (i=1;i<=m;i++) {
f>>q>>p;
while (p >= 20) {
q = a[20][q];
p = p-20;
}
if (p==0)
g<<q<<"\n";
else
g<<a[p][q]<<"\n";
}
}
return 0;
}