Cod sursa(job #2503395)
| Utilizator | Data | 2 decembrie 2019 23:32:00 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
int dp[250001][19];
int main()
{
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, q, nod, dist, i, j;
cin >> n >> q;
for(i=1; i<=n; i++) cin >> dp[i][0];
for(i=1; i<=18; i++)
for(j=1; j<=n; j++) dp[j][i] = dp[dp[j][i-1]][i-1];
for(j=1; j<=q; j++)
{ cin >> nod >> dist;
for(i=0; i<=18; i++) if(dist&(1<<i)) nod = dp[nod][i];
cout << nod << '\n';
}
return 0;
}
