Pagini recente » Cod sursa (job #1193301) | Cod sursa (job #1524361) | Cod sursa (job #1045157) | Cod sursa (job #2412813) | Cod sursa (job #324446)
Cod sursa(job #324446)
#include<iostream>
using namespace std;
int main()
{
int n,m;
int pmax = 0;
FILE *in = fopen("stramosi.in", "r");
FILE *out = fopen("stramosi.out", "w");
fscanf(in,"%d %d",&n,&m);
//int mat[100][10];
int nn = n;
while(nn) {
++pmax;
nn = nn>>1;
}
cout << pmax;
int ** mat = (int**)malloc( (n+1)*sizeof(int *) );
for(int i = 0 ; i<=n ; ++i) {
mat[i] = (int *) malloc( (pmax+1)*sizeof(int));
for(int j = 0 ; j<= pmax; ++j) {
mat[i][j] = 0;
}
if( i > 0 ) {
fscanf(in,"%d",&mat[i][0]);
}
}
for(int i=1;i<=pmax; ++i){
for(int j = 1; j <= n; ++j) {
int p;
p = mat[j][i-1];
mat[j][i] = mat[p][i-1];
}
}
for( int i = 1; i<= m; ++i) {
int p;
int q;
fscanf(in,"%d %d",&q,&p);
//cout<<q<<" "<<p<<" ";
int kk = 2;
if(p >= n)
q = 0;
while( kk ) {
for(int j = pmax; p && q ; --j) {
//cout<<q<<" "<<p<<" "<<j<<"| ";
int k = 1<<j;
if( k <= p) {
p -= k;
q = mat[q][j];
}
}
--kk;
}
//cout<<endl;
//if( q != 0 && p==0 )
fprintf(out,"%u\n",q);
//else fprintf(out,"0\n");
}
/*for(int i = 1; i<=n ; i++) {
for(int j = 0 ; j<= pmax; j++) {
cout<<"\t"<<mat[i][j]<<" ";
}
cout<<endl;
}*/
fclose(in);
fclose(out);
return 0;
}