Cod sursa(job #3323195)
| Utilizator | Data | 17 noiembrie 2025 16:37:35 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m, x, y, dp[250003][20];
int main()
{
int i, j;
fin >> n >> m;
for (i = 1; i <= n; i++)
fin >> dp[i][0];
for (i = 1; i < 20; i++)
for (j = 1; j <= n; j++)
dp[j][i] = dp[ dp[j][i - 1] ][i - 1];
while (m--)
{
fin >> x >> y;
for (i = 0; i < 20; i++)
if (y & (1 << i))
x = dp[x][i];
fout << x << "\n";
}
return 0;
}
