#include "dungeons.h"
#include <vector>
#include <stdio.h>
using namespace std;
long long con[35][200005];
long long nxt[35][200005];
long long how[200005];
long long fin;
void init(int n,vector < int > s,vector < int > p,vector < int > w,vector < int > l)
{
int i,j;
fin=s[0];
how[n]=0;
for(i=0;i<=30;i++)
{
nxt[i][n]=n;
con[i][n]=0;
}
for(i=n-1;i>=0;i--) how[i]=how[w[i]]+1;
for(i=0;i<n;i++)
{
nxt[0][i]=(long long) l[i];
con[0][i]=(long long) p[i];
//printf("%d %d %lld %lld\n",0,i,nxt[0][i],con[0][i]);
}
for(i=1;i<=30;i++)
{
for(j=0;j<n;j++)
{
nxt[i][j]=nxt[i-1][nxt[i-1][j]];
con[i][j]=con[i-1][j]+con[i-1][nxt[i-1][j]];
//printf("%d %d %lld %lld\n",i,j,nxt[i][j],con[i][j]);
}
}
return;
}
long long simulate(int x, int z)
{
long long ans=(long long) z,now=x,i;
if(ans>=fin) return ans+how[now]*fin;
for(i=30;i>=0;i--)
{
if(ans+nxt[i][now]<fin)
{
//printf("%lld %lld %lld %lld %lld\n",ans,i,now,con[i][now],nxt[i][now]);
ans+=con[i][now];
now=nxt[i][now];
}
//printf("%lld %lld %lld\n",i,ans,now);
}
ans+=con[0][now];
now=nxt[0][now];
return ans+how[now]*fin;
}
