Cod sursa(job #1016264)
| Utilizator | Data | 25 octombrie 2013 23:08:52 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#define MAXN 250001
#define MAXLOGN 18
using namespace std;
int a[MAXLOGN][MAXN];
int main()
{
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n,m;
fin>>n>>m;
int p,q;
for (int i=1;i<=n;i++) fin>>a[0][i];
for (int i=1;i<MAXLOGN;i++)
for (int j=1;j<=n;j++) a[i][j] = a[i-1][a[i-1][j]];
for (int i=0;i<m;i++)
{ fin>>q>>p;
for (int k=17;k>=0 && q>0;k--)
if (p & (1<<k))
q = a[k][q];
fout<<q<<"\n";
}
}
