Cod sursa(job #2902435)
| Utilizator | Data | 16 mai 2022 12:50:53 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int dim = 250002;
int dp[dim][dim];
int main() {
int n, m, nod, k;
fin >> n >> m;
fin >> nod; //primul nod nu are stramosi
for(int i = 2; i <= n; i++) {
fin >> nod;
dp[i][1] = nod; //primul stramos al lui i este nod
for(int j = 2; j < dim; j++)
dp[i][j] = dp[nod][j - 1];
}
while (m--)
{
fin >> nod >> k;
fout << dp[nod][k] << '\n';
}
return 0;
}