UVA11605 Lights inside a 3d Grid

题目链接：https://www.luogu.com.cn/problem/UVA11605

我们设这个大的三维矩形长宽高分别为$n,m,h$
这显然是一道概率题
我们看到每一个点都是互相独立的
于是我们想到可以算出每一个点经过操作之后为1的概率

我们设$f[i][j][k][q]$代表$(i,j,k)$这个点经过$q$次操作后为$1$的概率
$p[i][j][k]$代表随机进行一次操作，覆盖到$(i,j,k)$这个点的概率

令$g(x,y)=2\ast x\ast (n-x+1)-1$
代表在$[1,y]$中选择两个数$a,b$,满足$min(a,b)<=x<=max(a,b)$的方案数

显然$p[i][j][k]=\frac{g(i,n)\ast g(j,m)\ast g(k,h)}{(nmh{)}^2}$
至于求$f$,我们可以得出递推式:$$f[i][j][k][p]=f[i][j][k][p-1]\ast (1-p[i][j][k])+(1-f[i][j][k][p-1])\ast p[i][j][k]$$

求通项公式，可得$f[i][j][k][p]=\frac{1}{2}-\frac{1}{2}\ast (1-2\ast p[i][j][k]{)}^n$

$Code$

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
#define int long long
const int MAXN = 100;
double p[MAXN + 10][MAXN + 10][MAXN + 10];;
inline int read();
inline int g(int x, int n){
    return 2 * x * (n - x + 1) - 1;
}

double fastpow(double x, int p){
    double ans = 1;
    while (p){
        if (p & 1)  ans = ans * x;
        x = x * x;
        p >>= 1;
    }
    return ans;
}

signed main(){
    freopen ("std.in", "r", stdin);
    freopen ("std.out", "w", stdout);
    int T = read(), Case = 1;;
    while (T--){
        printf("Case %lld: ", Case++);
        int n = read(), m = read(), h = read(), q = read();
        double ans = 0;
        for (register int i = 1; i <= n; ++i)
            for (register int j = 1; j <= m; ++j)
                for (register int k = 1; k <= h; ++k){
                    p[i][j][k] = g(i, n) * g(j, m) * g(k, h) / (double)(n * m * h * n * m * h);
                    ans += 0.5 - 0.5 * fastpow(1 - 2 * p[i][j][k], q);
                }
        printf("%.10f\n", ans);
    }
    return 0;
}

inline int read(){
    int x = 0;
    char c = getchar();
    while (!isdigit(c))c = getchar();
    while (isdigit(c)) x = (x << 1) + (x << 3) + (c & 15), c = getchar();
    return x;
}