2023杭电多校6 1010 Calculate

脑子一直在降智

#include <bits/stdc++.h>
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
*/
using namespace std;

const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;

#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))

#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))

typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

using ll=long long;
const int mod=1e9+7;

ll powmod(ll a,ll b){
    a%=mod;
    int res=1;
    for(;b>0;b>>=1,a=1ll*a*a%mod)if(b&1)res=1ll*res*a%mod;
    return res;
}

ll tt,n,q,xs[40][(int)1e5+9],nxt[40][(int)1e5+9],yx[40][(int)1e5+9],to[(int)1e5+9],k[(int)1e5+9],b[(int)1e5+9];

void solve(){
    cin>>n>>q;
    f(i,1,n)cin>>k[i];
    f(i,1,n)cin>>b[i];
    f(i,1,n)cin>>to[i];
    f(i,1,n){
        xs[0][i]=k[to[i]],yx[0][i]=b[to[i]],nxt[0][i]=to[i];
    }
    for(int i=1;i<=34;++i){
        for(int j=1;j<=n;++j){
            xs[i][j]=xs[i-1][nxt[i-1][j]]*xs[i-1][j]%mod;
            yx[i][j]=(yx[i-1][j]*xs[i-1][nxt[i-1][j]]%mod+yx[i-1][nxt[i-1][j]])%mod;
            nxt[i][j]=nxt[i-1][nxt[i-1][j]];
        }
    }

    for(int i=1,x,y,z;i<=q;++i){
        cin>>x>>y>>z;
        ll ans=z;
        while(y>0){
            int tp=log2(y);
            ans=(xs[tp][x]*ans%mod+yx[tp][x])%mod;
            x=nxt[tp][x],y-=1ll<<tp;
        }
        cout<<ans<<"\n";
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>tt;
    while(tt--)solve();
    return 0;
}