Pagini recente » Cod sursa (job #3335419) | Cod sursa (job #3312811) | Cod sursa (job #3332213) | Cod sursa (job #3332800) | Cod sursa (job #3337932)
//https://www.infoarena.ro/problema/stramosi
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("inline")
//#define _USE_MATH_DEFINES
//#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
//#include <vector>
//#include <cstring>
//#include <cmath>
//#include <bitset>
//#include <queue>
//#include <stack>
//#include <utility>
//#include <algorithm>
//#include <string>
//#include <map>
//#include <unordered_map>
//#include <set>
//#include <unordered_set>
//#include <cstdint>
//#include <climits>
//#include <iomanip>
//#include <cstdio>
//#include <tuple>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int NRMAX = 250000;
int v[NRMAX + 1];
int main()
{
//ios_base::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
int n, m, i, q, p;
fin >> n >> m;
for (i = 1; i <= n; ++i)
fin >> v[i];
for (i = 1; i <= m; ++i)
{
fin >> q >> p;
while (p--)
{
q = v[q];
if (!q)
break;
}
fout << q << "\n";
}
return 0;
}