Kick Start Round F 2020(Yeetzhee-划分数)

Problem
Pommel is very bored at home so she has invented a new game involving N dice. Each die has the numbers from 1 to M written on it. Whenever she throws a die, it has an equal probability of landing on each of the M possible values.

Pommel places all the dice in a row. She goes through the dice one at a time from left to right. For each die she rolls, Pommel can either keep the value she rolled and move on to the next die or she can re-roll the die. Pommel can re-roll a die as much as she wants before moving on to the next die.

Once Pommel has gone through all the dice, the game is finished. To determine if she has won, she puts the dice into groups. All dice with the same value are put into the same group. So if she finishes the game with x distinct values, then there will be x groups. These groups of dice are then sorted by number of dice in non-decreasing order.

For example:
If the final dice results are [2, 2, 3, 2, 2, 3], the dice would be put into two groups and ordered as follows: [3, 3] and [2, 2, 2, 2].
If the final dice results are [1, 6, 7, 7], the dice would be put into three groups and ordered as follows: [6], [1], and [7, 7] (or equivalently, [1], [6] and [7, 7]).

Pommel wins if she finishes the game with exactly K groups, and the i-th group contains exactly Ai dice, for all i.

What is the expected value of the total number of dice rolls it will take Pommel to win the game, assuming she plays optimally to minimize this expected value?

It is guaranteed that for any valid input, it is possible for Pommel to win the game.

Input
The first line of the input gives the number of test cases, T. T test cases follow. The first line of each test case contains the integers N, M and K. Then, K lines follow describing the groups she must finish with. The i-th line contains Ai.

Output
For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the expected number of times it will take to roll all the dice for Pommel to win the game.

y will be considered correct if it is within an absolute or relative error of 10-6 of the correct answer. See the FAQ for an explanation of what that means, and what formats of real numbers we accept.

Limits
Time limit: 20 seconds per test set.
Memory limit: 1GB.
1 ≤ T ≤ 100.
1 ≤ K ≤ M.
1 ≤ Ai, for all i.
A1 + A2 + … + AK = N.
Ai ≤ Ai+1, for all i.

Test Set 1
2 ≤ N ≤ 6.
2 ≤ M ≤ 6.

Test Set 2
2 ≤ N ≤ 50.
2 ≤ M ≤ 50.

Sample

Input

Output

2
3 6 2
1
2
5 2 1
5

Case #1: 4.7
Case #2: 9.0

In Sample case #1, Pommel has N = 3 dice, each with a number from 1 to M = 6 written on them. To win, she must finish the game with K = 2 groups. One group must have one die (A1 = 1), while the other group must have two dice (A2 = 2). One optimal strategy for Pommel is as follows:
Pommel throws the first die once.
Pommel throws the second die once.
If the first and second dice are the same, Pommel keeps throwing the third die until it ends in a different value from the first two. It takes 1.2 dice rolls on average.
If the first and second dice are different, Pommel keeps throwing the third die until it matches the first or the second die. It takes 3 dice rolls on average.
This strategy takes Pommel 4.7 (1 + 1 + 1/6 × 1.2 + 5/6 × 3) dice rolls on average.

In Sample case #2, Pommel has N = 5 dice, each with a number from 1 to M = 2 written on them. To win, she must finish the game with K = 1 group, with all N dice in them (A1 = N). For the first die, Pommel rolls it once. Then, for each remaining die she keeps rolling until it has the same value as the first one. It takes 2 dice rolls on average.

This strategy takes Pommel 9 (1 + 2 + 2 + 2 + 2) dice rolls on average.

概率dp，直接计算每个状态通向终点的概率。状态数不超过划分数。

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
#define MAXN (100)
int n,m,k;
int a[MAXN];
map<vector<int> ,double > hm;
bool check(vector<int> v) {
	int l=1;
	for(int p:v) {
		while(p>a[l] && l<=k) ++l;
		if(l>k) return 0;
		l++;
	}
	return 1;
}
double dfs(vector<int> v){
	if(hm.find(v)!=hm.end()) {
		return hm[v];
	}
	
	double ans=0;
//	for(int i:v) cout<<i<<" ";cout<<":"<<ans<<endl;
	int sz=SI(v);
	int P_f=0;
	for(int i=0;i<sz;i++) {
		vector<int> v2=v;
		v2[i]++;
		sort(ALL(v2));
		if(check(v2)) {
			ans+=dfs(v2);
		}else {
			P_f++;
		}
	}
	if(sz<m){
		vector<int> v2=v;
		v2.pb(1);
		sort(ALL(v2));
		if(check(v2)) {
			ans+=(m-sz)*(dfs(v2));
		}else {
			P_f+=m-sz;
		}
	}
//	cout<<ans<<' '<<P_f<<' '<<m<<endl;
	ans/=(double)m;
	ans+=1;
	if(P_f)
		ans*=(double)m/(m-P_f);

//	for(int i:v) cout<<i<<" ";cout<<":"<<ans<<endl;
	return hm[v]= ans;
} 
void work() {
	hm.clear();
	vector<int> v;
	For(i,k) v.pb(a[i]);
	hm[v]=0;
	vector<int> v2;
	double t=dfs(v2);
	printf(" %.10lf\n",t);
}
int main()
{
//	freopen("d.in","r",stdin);
//	freopen("terris.out","w",stdout);
	int T=read();
	For(kcase,T){
		printf("Case #%d:",kcase);
		n=read(),m=read(),k=read();
		For(i,k) a[i]=read(); 
		work();
	}
	return 0;
}