1637 - Double Patience

比较简单的一道题目，结合动态规划，注意当前成功的概率接着当前状态向后推进的一系列的成功的状态概率的平均数，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

string pile[9][4];
map<vector<int>, double> sheet;

double dp(vector<int>& point,int total){
	if (total == 0) return 1;
	if (sheet.find(point) != sheet.end()) return sheet[point];
	int amount = 0;
	double sum = 0;
	for (int i = 0; i < 9; i++){
		if (point[i] > 0){
			for (int j = i + 1; j < 9; j++){
				if (point[j] > 0){
					if (pile[i][point[i] - 1][0] == pile[j][point[j] - 1][0]){
						point[i]--;
						point[j]--;
						amount++;
						sum += dp(point,total-2);
						point[i]++;
						point[j]++;
					}
				}
			}
		}
	}
	if (amount == 0) return  sheet[point] = 0;
	return sheet[point] = sum / amount;

}

int main(){
	string t;
	while (cin >> t){
		sheet.clear();
		pile[0][0] = t;
		for (int i = 0; i < 9; i++){
			for (int j = 0; j < 4; j++){
				if (i == 0 && j == 0) continue;
				cin >> pile[i][j];
			}
		}
		vector<int> point(9,4);
		cout <<fixed<< setprecision(6) << dp(point,36) << endl;
	}
	return 0;
}