你可以进行任意多轮操作,每轮操作如下:
在不为最大值的数中等概率随机选择一个(如果没有则不操作),把它加一;
进行k次这个步骤:在不为最小值的数中等概率随机选择一个(如果没有则不操作),把它减一。
现在问期望进行多少轮操作以后第一个数会变为最小值0。
这题中的最大值指的是n,最小值指的是0
首先求出f[i]代表经过K次-1操作后,第一个位置减少了i的概率,那么f[i]=C(K,i)*(1 / (m+1))^K*(m / (m + 1))^K
记a[i][j]表示第1个数字当前为i,经过第一次操作后变成了j,显然j不超过i+1
a[i][i+1]=(1 / (m+1)) * (m / (m+1))^K(第一次+1加到了第一位,后面K次-1都没减到第一位)
a[i][i]=(m / (m + 1)) ^ (K + 1) + (1 / (m + 1)) * f[1] (一种情况是k+1次操作都不在第一位,另一种是1这个位置一开始+1,后面某次操作减1)
a[i][j]=(1 / (m+1)) * f[i - j + 1] + (m / (m + 1)) * f[i - j] (2种情况就是第一次加法有没有加到第一位上)
记f[i]代表1号位置上数为i,到达终点状态(1号位置数为0)的期望,显然f[0]=0;
f[i]=a[i][i+1] * (f[i + 1] + 1) + a[i][i] * (f[i] + 1) + a[i][i - 1] * (f[i - 1] + 1) ..我们可以把加1提到最后面
暴力思路就是直接高消,但是我们可以把每个式子f[i+1]提出来,表示成k*f[1]+b,然后到f[n]就会有2个状态,解出即可。
但是这题数据真tmd的坑啊,边界一堆,菜鸡就写了个高消处理特殊数据,还好这题的特殊数据n都很小
代码:
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1505;
const int MOD = 1000000007;
int T;
int n, m, p, K, i, j, k;
int f[maxn], a[maxn][maxn];
int c[maxn], ans[maxn];
inline int add(int x, int y)
{
x += y;
return (x >= MOD) ? x - MOD : x;
}
struct sb{
int k, b;
inline sb friend operator + (const sb &a, const sb &b)
{
return (sb){add(a.k, b.k), add(a.b, b.b)};
}
inline sb friend operator * (const sb &a, const int &b)
{
return (sb){(long long)a.k * b % MOD, (long long)a.b * b % MOD};
}
};
sb g[maxn];
inline int get()
{
char c;
while ((c = getchar()) < 48 || c > 57);
int res = c - 48;
while ((c = getchar()) >= 48 && c <= 57)
res = res * 10 + c - 48;
return res;
}
inline int ksm(int x, int y, int z)
{
int b = 1;
while (y)
{
if (y & 1) b = (long long)b * x % z;
x = (long long)x * x % z;
y >>= 1;
}
return b;
}
int main()
{
freopen("heal1.in", "r", stdin);
freopen("heal.out", "w", stdout);
cin >> T;
while (T --)
{
cin >> n >> p >> m >> K;
if (!K) {puts("-1"); continue;}
if (!m && K <= 1) {puts("-1"); continue;}
for(i = 1; i <= n; i ++)
for(j = 1; j <= n + 1; j ++)
a[i][j] = 0;
c[0] = 1;
for(i = 0; i < K + 1 && i < n; i ++)
c[i + 1] = (long long)c[i] * (K - i) % MOD * ksm(i + 1, MOD - 2, MOD) % MOD;
int invm = ksm(m + 1, MOD - 2, MOD);
memset(f, 0, sizeof(f));
for(i = 0; i <= K && i <= n; i ++)
f[i] = (long long)c[i] * ksm(invm, i, MOD) % MOD * ksm(m, K - i, MOD) % MOD * ksm(invm, K - i, MOD) % MOD;
int remain = ((long long)ksm(m, K + 1, MOD) * ksm(invm, K + 1, MOD) +
(long long)f[1] * invm) % MOD;
for(i = 1; i < n; i ++)
{
a[i][i] = remain;
a[i][i + 1] = (long long)invm * ksm(m, K, MOD) % MOD * ksm(invm, K, MOD) % MOD;
for(j = i - 1; j >= 0 && j >= i - K; j --)
a[i][j] = ((long long)invm * f[i - j + 1] + (long long)m * invm % MOD * f[i - j] % MOD) % MOD;
}
for(i = n; i >= 0 && i >= n - K; i --)
a[n][i] = f[n - i];
if (m)
{
g[1] = (sb){1, 0};
for(i = 1; i < n; i ++)
{
a[i][i] --;
if (a[i][i] < 0) a[i][i] += MOD;
g[i + 1] = (sb){0, 1};
for(j = 1; j <= i; j ++)
g[i + 1] = g[i + 1] + g[j] * a[i][j];
// cout << g[i + 1].k << " " << g[i + 1].b << endl;
int r = ksm(MOD - a[i][i + 1], MOD - 2, MOD);
g[i + 1] = g[i + 1] * r;
}
sb now = (sb){0, 1};
for(i = 1; i < n; i ++)
now = now + g[i] * a[n][i];
now = now * ksm(MOD + 1 - a[n][n], MOD - 2, MOD);
if (!g[n].k && !g[n].b) ans[1] = now.b;
else if (now.k == g[n].k) ans[1] = now.b;
else ans[1] = (long long)(now.b - g[n].b + MOD) * ksm(g[n].k - now.k + MOD, MOD - 2, MOD) % MOD;
printf("%d\n", ((long long)g[p].k * ans[1] + g[p].b) % MOD);
continue;
}
for(i = 1; i <= n; i ++)
a[i][n + 1] = MOD - 1, a[i][i] --;
for(i = 1; i <= n; i ++)
{
k = 0;
for(j = i; j <= n; j ++)
if (a[j][i]) {k = j; break;}
if (k != i)
{
for(j = 1; j <= n + 1; j ++)
swap(a[i][j], a[k][j]);
}
int inv = ksm(a[i][i], MOD - 2, MOD);
for(j = 1; j <= n + 1; j ++)
a[i][j] = (long long)a[i][j] * inv % MOD;
for(j = 1; j <= n; j ++)
if (j != i && a[j][i])
{
int sb = a[j][i];
for(k = 1; k <= n + 1; k ++)
if (a[i][k]) a[j][k] = (a[j][k] - (long long)sb * a[i][k]) % MOD;
}
}
printf("%d\n", (a[p][n + 1] + MOD) % MOD);
}
}