Cod sursa(job #1196884)
Utilizator | Data | 9 iunie 2014 16:19:13 | |
---|---|---|---|
Problema | Stramosi | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
int d[250005][20];
int m, n, q, p;
int main()
{
ifstream in("stramosi.in");
ofstream out("stramosi.out");
in >> n >> m;
for(int i = 1; i <= n; ++i) {
in >> d[i][0];
}
for(int j = 1; j <= 18; ++j)
for(int i = 1; i <= n; ++i)
d[i][j] = d[d[i][j - 1]][j - 1];
for(int i = 1; i <= m; ++i) {
in >> q >> p;
while(p > 0) {
int p2 = 1, i;
for(i = 0; p2*2 <= p; ++i) p2 = p2*2;
q = d[q][i];
p = p - p2;
}
out << q << '\n';
}
return 0;
}