Cod sursa(job #1189182)
Utilizator | Data | 21 mai 2014 18:37:59 | |
---|---|---|---|
Problema | Stramosi | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
unsigned short a[2501][250001], n, m, q, p, v[250001];
int main()
{
f >> n >> m;
for ( int i = 1; i <= n; ++i )
{
f >> v[i];
a[i][1] = v[i];
}
for ( int i = 1; i <= n; ++i)
for ( int j = 2; j <= 2501; j++)
{
a[i][j] = v[a[i][j-1]];
}
for ( int i = 0; i < m; i++ )
{
f >> q >> p;
g << a[q][p] << '\n';
}
return 0;
}