解题报告 之 ZOJ 3329 One Person Game

解题报告 之 ZOJ 3329 One Person Game

Description

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

Source

The 7th Zhejiang Provincial Collegiate Programming Contest

题目大意：有三个骰子，每个骰子分别有K1,K2,K3个面，每个骰子分别印着1~Ki 。每个骰子投中每个面概率相等。有一个计数器，一开始清零，当第一二三个骰子分别投中a，b，c时，则计数器清零，否则就加上三个骰子投出的数字和，一旦计数器大于n就停止。问要使得计数器的数大于n需要的步数的期望是多少？

分析：概率dp的题，用dp[i]表示使计数器达显示n所需要的步数期望。所以很容易得到状态转移方程：

p[j]表示投出j的概率，p[0]表示清零概率

但是很不幸的是，递推公式中包含dp[0]，而dp[0]正是我们要求的。不过好在每次递推dp[0]都是线性变化，所以我们可以考虑将dp[0]视为未知数推导到dp[0]=k*dp[0]+b，解方程即可。

于是乎我们令 dp[i]=A[i]*dp[0]+B[i] 。（因为dp[i]中要么是关于dp[0]的一次项，要么是已知常数）。

所以我们可以将上面的状态转移方程表示成另一种形式：

于是乎，我们可以得到A[i]和B[i]的状态转移方程：

在根据之前的定义：dp[0]=A[0]*dp[0] + B[0]   -->  dp[0]=B[0]/(1.0-A[0])

上代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;

const int MAXN = 500 + 50;
double A[MAXN], B[MAXN];
double p[50];

int main()
{
	int T;
	cin >> 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 );
		memset( A, 0, sizeof A );
		memset( B, 0, sizeof B );
		memset( p, 0, sizeof p );

		double p0 = 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)
						p[i + j + k] += p0;

		for(int i = n; i >= 0; i--)
		{
			for(int j = 1; j <= k1 + k2 + k3; j++)
			{
				A[i] += A[i + j]*p[j];
				B[i] += B[i + j]*p[j];
			}
			A[i] += p0;
			B[i] += 1.0;
		}
		printf( "%.16lf\n", B[0] / (1.0 - A[0]) );
	}

	return 0;
}