Pagini recente » Cod sursa (job #3226678) | Cod sursa (job #197593) | Cod sursa (job #414221) | Cod sursa (job #2749260) | Cod sursa (job #1399982)
#include <fstream>
#include <vector>
const int NMAX = 300005;
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int N,M,P,Q,x;
vector <int> v[NMAX];
int stramos[25][NMAX];
int Lg[NMAX];
void solve()
{
int l;
int nod = Q;
while(P != 0)
{
l = Lg[P];
nod = stramos[l][nod];
P -= (1<<l);
}
g << nod << '\n';
}
int main()
{
f >> N >> M;
Lg[1] = 0;
for (int i = 2; i <= N; ++i)
{
Lg[i] = Lg[i/2] + 1;
}
for (int i = 1; i <= N; ++i)
{
f >> x;
stramos[0][i] = x;
}
for (int i = 1; i <= Lg[N]; ++i)
{
for (int j = 1; j <= N; ++j)
{
stramos[i][j] = stramos[i-1][stramos[i-i][j]];
}
}
for (int i = 1; i <= M; ++i)
{
f >> Q >> P;
solve();
}
f.close();
g.close();
return 0;
}