Pagini recente » Cod sursa (job #2873474) | Cod sursa (job #1146792) | Borderou de evaluare (job #2482456) | Borderou de evaluare (job #175655) | Cod sursa (job #2792422)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m, stramos[250005], frecv[250005], P, Q;
int main() {
fin >> n >> m;
for (int i = 1; i <= n; ++ i)
fin >> stramos[i], ++ frecv[stramos[i]];
for (int i = 0; i < m; ++ i) {
fin >> Q >> P;
P -= frecv[Q];
while (P > 0) {
if (stramos[Q] == 0)
break;
Q = stramos[Q];
P -= frecv[Q];
}
fout << Q << '\n';
}
return 0;
}