题意:给你n次升级的机会,每次升级成功的概率是p(用r/s表示),花费为a,如果成功会升到下一级,否则的话会掉到x级。
q次询问,每次问你从l升到r级的期望花费。
思路:dp[i] 表示从i级升到i+1级的花费,1/p次中有1次升级,那么剩下 1/p - 1次会掉级,所以dp[i] = (a[i] + (1/p - 1) * (sum[i - 1] - sum[x[i] - 1] + a[i]) ),(sum是dp的前缀和),每次询问用前缀和O(1)求。
#include <vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const int maxn = 5e5 + 10;
const int inf = 0x3f3f3f3f;
ll sum[maxn], dp[maxn]; //dp[i] 表示从i级升到i+1级的花费
ll powermod(ll a, ll b)
{
a = a % mod;
ll res = 1;
while(b)
{
if(b & 1)
res = res * a % mod;
b >>= 1;
a = a * a % mod;
}
return res;
}
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int n, q;
scanf("%d%d", &n, &q);
sum[0] = dp[0] = 0;
for(int i = 1; i <= n; ++i)
{
ll r, s, x, a;
scanf("%lld%lld%lld%lld", &r, &s, &x, &a);
ll p = r * powermod(s, mod - 2) % mod;
//dp[i] = (a[i] + (1/p - 1) * (sum[i - 1] - sum[x[i] - 1] + a[i]) ) // 1/p次中有1次升级,那么剩下 1/p - 1次会掉级
dp[i] = (a + (1 - p + mod) % mod * (a + sum[i - 1] - sum[x - 1] + mod) % mod * powermod(p, mod - 2) % mod) % mod;
sum[i] = (sum[i - 1] + dp[i] + mod) % mod; //前缀和
}
while(q--)
{
int l, r;
scanf("%d%d", &l, &r);
ll ans = (sum[r - 1] - sum[l - 1] + mod) % mod;
printf("%lld\n", ans);
}
}
return 0;
}