2024牛客暑期多校训练营3 E Malfunctioning Typewriter

https://ac.nowcoder.com/acm/contest/81598/E

我们设f[i][j]为选了i个0，j个1时最大的成功概率是多少，可以预处理出来

    f[i][j] = max(p*f[i - 1][j] + (1 - p)*f[i][j - 1], (1 - p)*f[i - 1][j] + p*f[i][j - 1])

然后我们考虑trie树，对于trie树上的每个节点，我们要拿完以该节点为前缀的所有串，我们知道该节点拿0的串的数量，拿1的串的数量，所以 ans*=f[sz[lf]][sz[ri]]

#define  _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<algorithm> 
#include<string.h>
#include<iostream>
#include<queue>
#include<math.h>
#include<string>
#include<map>
#include<functional>
#include<unordered_map>
#include<bitset>
#include<iomanip>

using namespace std;

#define int long long
#define inf 0x3f3f3f3f


const int N = 1000050;
int trie[N][2];
int cnt[N];
int sz[N];
int id;

void insert(string s)
{
	int p = 0;
	for (int i = 0; i < s.size(); i++)
	{
		sz[p]++;
		int x = s[i] - '0';
		if (trie[p][x] == 0) trie[p][x] = ++id;
		p = trie[p][x];
	}

	sz[p]++;
	cnt[p]++;
}

int n, m;

double p;


double f[2005][2005];//取i个1，j个0的最大成功概率

signed main(void)
{
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);



	cin >> n >> m >> p;



	for (int i = 0; i <= 2000; i++)
	{
		for (int j = 0; j <= 2000; j++)
		{
			if (i == 0 && j == 0)
			{
				f[i][j] = 1;
			}
			else if (i==0)
			{
				f[i][j] = p*f[i][j - 1];
			}
			else if (j == 0)
			{
				f[i][j] = p*f[i - 1][j];
			}
			else
			{
				f[i][j] = max(p*f[i - 1][j] + (1 - p)*f[i][j - 1], (1 - p)*f[i - 1][j] + p*f[i][j - 1]);
			}
		}
	}
	

	for (int i = 1; i <= n; i++)
	{
		string s;
		cin >> s;

		insert(s);
	}

	double ans = 1;

	for (int i = 0; i <= id; i++)
	{
		int lf = trie[i][0];
		int ri = trie[i][1];

		if (lf == 0)
		{
			lf = id + 10;
		}

		if (ri == 0)
		{
			ri = id + 10;
		}

		ans *= f[sz[lf]][sz[ri]];
	}

	cout << setprecision(10) << ans << '\n';


	system("pause");
	return 0;
}