Cod sursa(job #1856780)
| Utilizator | Data | 25 ianuarie 2017 14:02:42 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#define NMAX 250005
using namespace std;
ifstream f ("stramosi.in");
ofstream g ("stramosi.out");
int n, m, a[22][NMAX], q, p, i, j;
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
f>>a[0][i];
for (i=1;(1<<i)<=n;i++)
for (j=1;j<=n;j++)
a[i][j]=a[i-1][a[i-1][j]];
while(m--)
{
f>>q>>p;
for (i = 0; (1<<i) <= p; i++)
if ((1<<i) & p)
q = a[i][q];
g<< q<<'\n';
}
return 0;
}
