AcWing 218. 扑克牌（记忆化dp，概率分析）

const int N = 14, M = 5;
double f[N][N][N][N][M][M];
int limit[7];

double dp(int a, int b, int c, int d, int x, int y)
{
	double &v = f[a][b][c][d][x][y];
	if (v >= 0)return v;
	int na = a + (x == 0) + (y == 0);
	int nb = b + (x == 1) + (y == 1);
	int nc = c + (x == 2) + (y == 2);
	int nd = d + (x == 3) + (y == 3);
	if (na >= limit[1] && nb >= limit[2] && nc >= limit[3] && nd >= limit[4])return v = 0;
	int re = 54-(a + b + c + d + (x != 4) + (y != 4));
	v = 1;//当前翻一张
	if (a < 13)v += (13.0 - a) / re * dp(a + 1, b, c, d, x, y);//下个状态*到这个状态的概率
	if (b < 13)v += (13.0 - b) / re * dp(a , b+1, c, d, x, y);
	if (c < 13)v += (13.0 - c) / re * dp(a , b, c+1, d, x, y);
	if (d < 13)v += (13.0 - d) / re * dp(a, b, c, d+1, x, y);
	if (x == 4)
	{
		double tmp = inf;
		f(i, 0, 3)tmp = min(tmp, 1.0/re*dp(a, b, c, d, i, y));
		v += tmp;
	}
	if (y == 4)
	{
		double tmp = inf;
		f(i, 0, 3)tmp = min(tmp, 1.0 / re * dp(a, b, c, d, x, i));
		v += tmp;
	}
	return v;
}
int main()
{	
	f(i, 1, 4)cin >> limit[i];
	int t = 0;
	f(i, 1, 4)if (limit[i] > 13)t += limit[i] - 13;
	if(t>2) { puts("-1.000");return 0; }
	memset(f, -1, sizeof f);
	double ans = dp(0, 0, 0, 0, 4, 4);
	if (ans > inf / 2) { puts("-1.000");return 0; }
	printf("%.3lf\n", ans);
	return 0;
}