ZOJ 3329 One Person Game——（概率DP+待定系数求解方程）

传送门

There is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 has K₁ faces. Die2 has K₂ faces. Die3 has K₃ faces. All the dice are fair dice, so the probability of rolling each value, 1 to K₁, K₂, K₃ is exactly 1 / K₁, 1 / K₂ and 1 / K₃. You have a counter, and the game is played as follow:

1. Set the counter to 0 at first.
2. Roll the 3 dice simultaneously. If the up-facing number of Die1 is a, the up-facing number of Die2 is b and the up-facing number of Die3 is c, set the counter to 0. Otherwise, add the counter by the total value of the 3 up-facing numbers.
3. If the counter’s number is still not greater than n, go to step 2. Otherwise the game is ended.

Calculate the expectation of the number of times that you cast dice before the end of the game.

Input

There are multiple test cases. The first line of input is an integer T (0 < T <= 300) indicating the number of test cases. Then T test cases follow. Each test case is a line contains 7 non-negative integers n, K₁, K₂, K₃, a, b, c (0 <= n <= 500, 1 < K₁, K₂, K₃ <= 6, 1 <= a <= K₁, 1 <= b <= K₂, 1 <= c <= K₃).

Output

For each test case, output the answer in a single line. A relative error of 1e-8 will be accepted.

Sample Input

2
0 2 2 2 1 1 1
0 6 6 6 1 1 1

Sample Output

1.142857142857143
1.004651162790698

题目大意：

有三个骰子，分别有 $k_1,k_2,k_3(1\lt k_1,k_2,k_3\le 6)$ 个面，现在有如下 $3$ 个操作：
(1) 首先将计数器设置为 $0$
(2) 如果骰子 $1$ 朝上的面是 $a$ , 骰子 $2$ 朝上的面是 $b$ , 骰子 $3$ 朝上的面是 $c$ 的时候，计数器设置为 $0$，否则计数器加上三个面朝上的面的和
(3) 如果计数器的值 $\le n$，跳到第 $2$ 步，否则游戏结束。
现在计算游戏结束前掷骰子的次数期望。

解题思路：

$dp[x]$ 表示当前计数器为 $x$ 到游戏结束时候的掷骰子的次数期望
$p[x]$ 表示三个骰子朝上的面的和为 $x$ 的概率。那么有如下方程成立：

$$dp[x]=\sum_{k=3}^{k_1+k_2+k_3}p[k]*dp[x+k]+p[0]*dp[0]+1————(1)$$
然后观察这个式子发现，这个石子都跟 $dp[0]$ 有关，那么我们将 $dp[0]$ 看作未知数，那么 $dp[x]$ 都是跟 $dp[0]$ 有关，我们可以根据待定系数法求一下 $dp[0]$，设：

$$dp[x]=A[x]*dp[0]+B[x]————(2)$$
将式子 $(1)$ 用式子 $(2)$ 表达一下：
$$\begin{align}dp[x]&=\sum_{k=3}^{k_1+k_2+k_3}p[k]*(A[x+k]*dp[0]+B[x+k])+p[0]*dp[0]+1\\ &=(\sum_{k=3}^{k_1+k_2+k_3}p[k]*A[x+k]+p[0])*dp[0]+\sum_{k=3}^{k_1+k_2+k_3}p[k]*B[x+k]+1\end{align}$$
将这个式子与第 $(2)$ 个式子进行比较然后系数与系数相同：
$$\begin{cases} A[x]=\sum_{k=3}^{k_1+k_2+k_3} p[k]*A[x+k]+p[0]\\ B[x]=\sum_{k=3}^{k_1+k_2+k_3} p[k]*B[x+k]+1 \end{cases}$$
然后通过这两个递推式求出 $A[0],B[0]$，然后 $dp[0]=A[0]*dp[0]+B[0]$
解得 $dp[0]=\frac{B[0]}{1-A[0]}$

代码：

#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <map>
using namespace std;
typedef long long LL;
const int MAXN = 5e2+20;
const double PI = acos(-1);
const double eps = 1e-8;
const LL MOD = 1e9+7;
double p[20], A[MAXN], B[MAXN];
void Init(){
    memset(p, 0, sizeof(p));
    memset(A, 0, sizeof(A));
    memset(B, 0, sizeof(B));
}
int main(){
    //freopen("C:/Users/yaonie/Desktop/in.txt", "r", stdin);
    //freopen("C:/Users/yaonie/Desktop/out.txt", "w", stdout);
    int T;
    while(~scanf("%d", &T)){
        while(T--){
            int n, k1, k2, k3, a, b, c; scanf("%d%d%d%d%d%d%d",&n,&k1,&k2,&k3,&a,&b,&c);
            Init();
            p[0] = 1.0/(k1*k2*k3);
            for(int i=1; i<=k1; i++){
                for(int j=1; j<=k2; j++){
                    for(int k=1; k<=k3; k++){
                        if(i==a && j==b && k==c) continue;
                        p[i+j+k] += p[0];
                    }
                }
            }
            for(int i=n; i>=0; i--){
                A[i] = p[0], B[i] = 1;
                for(int k=3; k<=k1+k2+k3; k++){
                    A[i] += (p[k]*A[i+k]);
                    B[i] += (p[k]*B[i+k]);
                }
            }
            printf("%.15f\n",B[0]/(1-A[0]));
        }
    }
    return 0;
}