Cod sursa(job #1235620)
| Utilizator | Data | 30 septembrie 2014 03:29:25 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream ka("stramosi.in");
ofstream ki("stramosi.out");
const int N_MAX = 250000;
const int LOG_MAX = 18;
int stramos[N_MAX + 1][LOG_MAX + 1];
int n, m, p, q, f;
int main()
{
ka >> n >> m;
for(int i = 1; i <= n; i++)
ka >> stramos[i][0];
for(int j = 1; j <= LOG_MAX; j++)
for(int i = 1; i <= n; i++)
stramos[i][j] = stramos[stramos[i][j-1]][j-1];
while(m--)
{
ka >> q >> p;
for(f = 18; f >= 0; f--)
if(p & (1 << f))
q = stramos[q][f];
ki << q << '\n';
}
}
