Cod sursa(job #3183057)
| Utilizator | Data | 10 decembrie 2023 15:44:40 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int LMAX = 20;
const int NMAX = 250007;
int dp[NMAX][LMAX];
int main()
{
int n, m;
fin >> n >> m;
for (int i = 1; i <= n; i++)
{
fin >> dp[i][0];
for (int j = 1; j < LMAX; j++)
{
dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
}
for(int i = 1; i <= m; i++)
{
int q, p;
fin >> q >> p;
for (int j = LMAX - 1; j >= 0; j--)
{
if (p & (1 << j))
{
q = dp[q][j];
}
}
fout << q << "\n";
}
return 0;
}