Codeforces Round #301 (Div. 2)D (概率dp）

最新推荐文章于 2022-11-22 23:15:14 发布

akxxsb

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量751

点赞数

分类专栏：动态规划 dp 文章标签： dp 概率dp

本文链接：https://blog.csdn.net/acvcla/article/details/45534655

版权

dp 同时被 2 个专栏收录

37 篇文章 0 订阅

订阅专栏

动态规划

9 篇文章 0 订阅

订阅专栏

The Bad Luck Island is inhabited by three kinds of species: r rocks, s scissors and p papers. At some moments of time two random individuals meet (all pairs of individuals can meet equiprobably), and if they belong to different species, then one individual kills the other one: a rock kills scissors, scissors kill paper, and paper kills a rock. Your task is to determine for each species what is the probability that this species will be the only one to inhabit this island after a long enough period of time.

Input

The single line contains three integers r, s and p (1 ≤ r, s, p ≤ 100) — the original number of individuals in the species of rock, scissors and paper, respectively.

Output

Print three space-separated real numbers: the probabilities, at which the rocks, the scissors and the paper will be the only surviving species, respectively. The answer will be considered correct if the relative or absolute error of each number doesn't exceed 10 - 9.

        Sample test(s) 
      
          input 
        
2 2 2

          output 
        
0.333333333333 0.333333333333 0.333333333333

          input 
        
2 1 2

          output 
        
0.150000000000 0.300000000000 0.550000000000

          input 
        
1 1 3

          output 
        
0.057142857143 0.657142857143 0.285714285714

题意：3个物种分别有r,s,p个第一种吃第二种，第二种吃第三种,第三种吃第一种,每隔一段时间两个生物相遇，问经过足够长的时间后每个物种存活（其他物种死亡）的概率。

dp[i][j][k]表示三个物种分别为i,j,k且第一个物种存活下的概率。状态转移为dp[i][j][k] = (i*j*dp[i][j-1][k]+i*k*dp[i-1][j][k]+j*k*dp[i][j][k-1])/(i*j+i*k+j*k).

#include<bits/stdc++.h>
using namespace std;
double dp[101][101][101];
double dfs(int i,int j,int k){
    if(!k) return dp[i][j][k]=1;
    if(!(i&&j)) return dp[i][j][k]=0;
    if(dp[i][j][k]) return dp[i][j][k];
    return dp[i][j][k]=(i*j*dfs(i,j-1,k)+k*i*dfs(i-1,j,k)+j*k*dfs(i,j,k-1))/(i*j+j*k+k*i);
}
int main()
{
    int r,s,p;
    cin>>r>>s>>p;
    printf("%.12f ",dfs(r,s,p));
    memset(dp,0,sizeof dp);
    printf("%.12f ",dfs(s,p,r));
    memset(dp,0,sizeof dp);
    printf("%.12f\n",dfs(p,r,s));
}