[Codeforces540D]Bad Luck Island（概率dp）

题目描述

传送门
题意：有r个石头、s个剪刀、p个布，每一次两个人随机碰上，输的人死掉，问只剩下每一种的概率。

题解

令f(i,j,k)表示三种人分别有i个，j个，k个时到初始的概率
三个人分别算
注意这道题不能倒推

代码

#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cstdio>
#include<cmath>
using namespace std;
#define N 105

int a,b,c;
double ans1,ans2,ans3,f[N][N][N];

double C(double x)
{
    return x*(x-1.0)/2.0;
}
int main()
{
    scanf("%d%d%d",&a,&b,&c);
    for (int i=1;i<=a;++i) f[i][0][0]=1.0;
    for (int i=1;i<=a;++i)
        for (int j=0;j<=b;++j)
            for (int k=0;k<=c;++k)
            {
                if (i+j+k<=1) continue;
                if (!j&&!k) continue;
                double I=(double)i,J=(double)j,K=(double)k,P=1.0/C(I+J+K);
                if (i) f[i][j][k]+=f[i-1][j][k]*I*K*P;
                if (j) f[i][j][k]+=f[i][j-1][k]*I*J*P;
                if (k) f[i][j][k]+=f[i][j][k-1]*J*K*P;
                f[i][j][k]/=1.0-(C(I)+C(J)+C(K))*P;
            }
    printf("%.12lf ",f[a][b][c]);

    memset(f,0,sizeof(f));
    for (int i=1;i<=b;++i) f[0][i][0]=1.0;
    for (int i=0;i<=a;++i)
        for (int j=1;j<=b;++j)
            for (int k=0;k<=c;++k)
            {
                if (i+j+k<=1) continue;
                if (!i&&!k) continue;
                double I=(double)i,J=(double)j,K=(double)k,P=1.0/C(I+J+K);
                if (i) f[i][j][k]+=f[i-1][j][k]*I*K*P;
                if (j) f[i][j][k]+=f[i][j-1][k]*I*J*P;
                if (k) f[i][j][k]+=f[i][j][k-1]*J*K*P;
                f[i][j][k]/=1.0-(C(I)+C(J)+C(K))*P;
            }
    printf("%.12lf ",f[a][b][c]);


    memset(f,0,sizeof(f));
    for (int i=1;i<=c;++i) f[0][0][i]=1.0;
    for (int i=0;i<=a;++i)
        for (int j=0;j<=b;++j)
            for (int k=1;k<=c;++k)
            {
                if (i+j+k<=1) continue;
                if (!i&&!j) continue;
                double I=(double)i,J=(double)j,K=(double)k,P=1.0/C(I+J+K);
                if (i) f[i][j][k]+=f[i-1][j][k]*I*K*P;
                if (j) f[i][j][k]+=f[i][j-1][k]*I*J*P;
                if (k) f[i][j][k]+=f[i][j][k-1]*J*K*P;
                f[i][j][k]/=1.0-(C(I)+C(J)+C(K))*P;
            }
    printf("%.12lf\n",f[a][b][c]);
}