Pagini recente » Cod sursa (job #2607341) | Cod sursa (job #2650552) | Cod sursa (job #2162865) | Cod sursa (job #1790702) | Cod sursa (job #3286480)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n,task;
f>>n>>task;
vector<vector<int>>dp(20,vector<int>(250001));
for(int i=1; i<=n; ++i){
int tata;
f>>tata;
dp[0][i]=tata;
}
for(int i=1; i<=17; ++i)
for(int j=1; j<=n; ++j)
dp[i][j]=dp[i-1][dp[i-1][j]];
int q,p;
for(int i=1; i<=task; ++i){
f>>q>>p;
for(int i=0; i<=17; ++i)
if((1<<i)&p)
q=dp[i][q];
g<<q<<'\n';
}
return 0;
}