Cod sursa(job #1373442)
Utilizator | Data | 4 martie 2015 18:46:36 | |
---|---|---|---|
Problema | Stramosi | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#define nMax 250001
using namespace std;
ifstream x ("stramosi.in");
ofstream y ("stramosi.out");
int n,m;
int parent[nMax];
int dfs(int q, int p)
{
if(!q)
return 0;
if(p==0)
return q;
dfs(parent[q],p-1);
}
int main()
{
int i;
x>>n>>m;
for(i=1;i<=n;i++)
x>>parent[i];
int q,p;
for(i=1;i<=m;i++)
{
x>>q>>p;
y<<dfs(q,p)<<'\n';
}
return 0;
}