Cod sursa(job #1291352)
Utilizator | Rotaru Gheorghe-Iulian iulianrotaru | Data | 12 decembrie 2014 18:44:23 |
---|---|---|---|
Problema | Stramosi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream f("stramosi.in"); ofstream g("stramosi.out");
const int Nmax=(1<<18);
int n,m,q,p,i,j;
int mk[19],b[19][Nmax];
int main()
{ f>>n>>m;
for(j=1;j<=n;++j) f>>b[0][j];
for(i=0,j=1;j<=n;j<<=1,++i) mk[i]=j;
mk[i]=j;
for(i=1;mk[i]<=n;i++)
for(j=1;j<=n;j++)
b[i][j]=b[i-1][b[i-1][j]];
while(m--)
{ f>>q>>p;
if(p>n) q=0;
else
{ i=0;
while(i<=p)
{ if(p&mk[i]) {q=b[i][q]; p-=mk[i];}
i++;
}
}
g<<q<<'\n';
}
g.close(); return 0;
}