Cod sursa(job #3206789)
Utilizator | Breaban Daniel-Vasile BreabanDaniel | Data | 24 februarie 2024 09:39:21 |
---|---|---|---|
Problema | Stramosi | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
#define NMAX 250009
using namespace std;\
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int dp[30][NMAX];
int tati[NMAX],n,m;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>tati[i];
dp[0][i]=tati[i];
}
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n;j++)
dp[i][j]=dp[i-1][dp[i-1][j]];
for(int i=1;i<=m;i++)
{
int p,q;
fin>>p>>q;
for(int i=0;(1<<i)<=q;i++)
{
if((1<<i)&q)
{
p=dp[i][p];
}
}
fout<<p<<'\n';
}
return 0;
}