Pagini recente » Cod sursa (job #2110604) | Cod sursa (job #2172592) | Cod sursa (job #2583646) | Cod sursa (job #3277963) | Cod sursa (job #1219028)
#include <fstream>
using namespace std;
int a[19][250001];
int main()
{
ifstream fi("stramosi.in");
ofstream fo("stramosi.out");
int n, m, p, q;
fi >> n >> m;
for (int i = 1; i <= n; i++)
fi >> a[0][i];
bool ok = true;
for (int i = 1; i <= 18 && ok; i++)
{
ok = false;
for (int j = 1; j <= n; j++)
{
a[i][j] = a[i - 1][a[i - 1][j]];
ok |= a[i][j];
}
}
while (m-- > 0)
{
fi >> q >> p;
for (int k = 1 << 18, t = 18; t >= 0; k >>= 1, t--)
if (p >= k)
{
q = a[t][q];
p -= k;
}
fo << q << '\n';
}
}