148D

概率dp+记忆化搜索

dp[i][j][0]表示当前公主走公主赢的概率，dp[i][j][1]表示当前龙走公主赢的概率，然后剩下的就是一些细节的讨论，记忆化搜索很方便

#include<bits/stdc++.h>
using namespace std;
const int N = ;
int n, m;
double dp[N][N][];
double dfs(int n, int m, int f)
{
    if(f ==  && n + m <= ) return 0.0;
    if(n == ) return 0.0;
    if(m == ) return f ? 0.0 : 1.0;
    if(dp[n][m][f] >= 0.0) return dp[n][m][f];
    dp[n][m][f] = 0.0;
    if(f == ) dp[n][m][f] = (double)n / (double)(n + m) + dfs(n, m - , f ^ ) * (double)m / (double)(n + m);
    else
    {
        double t = (double)n / (double)(n + m);
        if(m >= ) dp[n][m][f] = (1.0 - t) * ((double)(m - ) / (double)(n + m - ) * dfs(n, m - , f ^ ) + (double)n / (double)(n + m - ) * dfs(n - , m - , f ^ ));
        else dp[n][m][f] = (1.0 - t) * dfs(n - , m - , f ^ );
    }
    return dp[n][m][f];
}
int main()
{
    scanf("%d%d", &n, &m);
    for(int i = ; i <= n; ++i)
        for(int j = ; j <= m; ++j) dp[i][j][] = dp[i][j][] = -1.0;
    printf("%.10f\n", dfs(n, m, ));
    return ;
}