题目描述:
一个孤岛上,有三种生物:石头,剪刀,布
这三种生物等概率碰面,求某种生物获胜概率
分析:
设
f[i][j][k]
f
[
i
]
[
j
]
[
k
]
表示三种生物分别有
i,j,k
i
,
j
,
k
个的获胜概率
设
s=C(i+j+k,2)
s
=
C
(
i
+
j
+
k
,
2
)
f[i][j][k]−>f[i][j][k]∗C(i,2)s f [ i ] [ j ] [ k ] − > f [ i ] [ j ] [ k ] ∗ C ( i , 2 ) s
f[i][j][k]−>f[i][j][k]∗C(j,2)s f [ i ] [ j ] [ k ] − > f [ i ] [ j ] [ k ] ∗ C ( j , 2 ) s
f[i][j][k]−>f[i][j][k]∗C(k,2)s f [ i ] [ j ] [ k ] − > f [ i ] [ j ] [ k ] ∗ C ( k , 2 ) s
f[i][j][k]−>f[i][j−1][k]∗ijs f [ i ] [ j ] [ k ] − > f [ i ] [ j − 1 ] [ k ] ∗ i j s
f[i][j][k]−>f[i−1][j][k]∗iks f [ i ] [ j ] [ k ] − > f [ i − 1 ] [ j ] [ k ] ∗ i k s
f[i][j][k]−>f[i][j][k−1]∗jks f [ i ] [ j ] [ k ] − > f [ i ] [ j ] [ k − 1 ] ∗ j k s
f[i][j][k]=f[i][j][k]∗C(i,2)s+f[i][j][k]∗C(j,2)s+f[i][j][k]∗C(k,2)s
f
[
i
]
[
j
]
[
k
]
=
f
[
i
]
[
j
]
[
k
]
∗
C
(
i
,
2
)
s
+
f
[
i
]
[
j
]
[
k
]
∗
C
(
j
,
2
)
s
+
f
[
i
]
[
j
]
[
k
]
∗
C
(
k
,
2
)
s
+f[i][j−1][k]∗ijs+f[i−1][j][k]∗iks+f[i][j][k−1]∗jks
+
f
[
i
]
[
j
−
1
]
[
k
]
∗
i
j
s
+
f
[
i
−
1
]
[
j
]
[
k
]
∗
i
k
s
+
f
[
i
]
[
j
]
[
k
−
1
]
∗
j
k
s
(1−C(i,2)+C(j,2)+C(k,2)s)f[i][j][k]=f[i][j−1][k]∗ijs+f[i−1][j][k]∗iks+f[i][j][k−1]∗jks ( 1 − C ( i , 2 ) + C ( j , 2 ) + C ( k , 2 ) s ) f [ i ] [ j ] [ k ] = f [ i ] [ j − 1 ] [ k ] ∗ i j s + f [ i − 1 ] [ j ] [ k ] ∗ i k s + f [ i ] [ j ] [ k − 1 ] ∗ j k s
f[i][j][k]=f[i][j−1][k]∗ijs+f[i−1][j][k]∗iks+f[i][j][k−1]∗jks1−C(i,2)+C(j,2)+C(k,2)s f [ i ] [ j ] [ k ] = f [ i ] [ j − 1 ] [ k ] ∗ i j s + f [ i − 1 ] [ j ] [ k ] ∗ i k s + f [ i ] [ j ] [ k − 1 ] ∗ j k s 1 − C ( i , 2 ) + C ( j , 2 ) + C ( k , 2 ) s
tip
天杀的,我一开始是逆推(
f[r][s][p]−>f[0][0][0]
f
[
r
]
[
s
]
[
p
]
−
>
f
[
0
]
[
0
]
[
0
]
),不对啊
只能改成正推
为了防止分母为0的情况
我们要针对
f[i][0][0],f[0][i][0],f[0][0][i](i!=0)
f
[
i
]
[
0
]
[
0
]
,
f
[
0
]
[
i
]
[
0
]
,
f
[
0
]
[
0
]
[
i
]
(
i
!
=
0
)
分别进行dp
而且如果我们要计算
rock
r
o
c
k
获胜的情况,那么
f[i][0][0]=1
f
[
i
]
[
0
]
[
0
]
=
1
,计算
f[r][s][p]
f
[
r
]
[
s
]
[
p
]
注意循环顺序,计算哪一维,哪一维就在最外层
还有一种更简单的方法,但是既然已经选择了复杂,哭着也要走下去。。。
看来很多情况下,知道正解都不一定能A。。。
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int N=102;
double f[N][N][N];
int n,m,l;
double C(double x) {
return x*(x-1)/2;
}
int main() {
scanf("%d%d%d",&n,&m,&l);
for (int i=1;i<=n;i++) f[i][0][0]=1.0;
for (int i=1;i<=n;i++)
for (int j=0;j<=m;j++)
for (int k=0;k<=l;k++) {
if (i+j+k<=k) continue;
if (j==0&&k==0) continue;
double s=C(i+j+k);
if (j) f[i][j][k]+=i*j*1.0/s*f[i][j-1][k];
if (i) f[i][j][k]+=i*k*1.0/s*f[i-1][j][k];
if (k) f[i][j][k]+=j*k*1.0/s*f[i][j][k-1];
double t=1.0;
t-=C(i)/s; t-=C(j)/s; t-=C(k)/s;
f[i][j][k]/=t;
}
printf("%0.10lf ",f[n][m][l]);
memset(f,0,sizeof(f));
for (int i=1;i<=m;i++) f[0][i][0]=1.0;
for (int j=1;j<=m;j++)
for (int i=0;i<=n;i++)
for (int k=0;k<=l;k++) {
if (i+j+k<=k) continue;
if (i==0&&k==0) continue;
double s=C(i+j+k);
if (j) f[i][j][k]+=f[i][j-1][k]*i*j*1.0/s;
if (i) f[i][j][k]+=f[i-1][j][k]*i*k*1.0/s;
if (k) f[i][j][k]+=f[i][j][k-1]*j*k*1.0/s;
double t=1.0;
t-=C(i)/s; t-=C(j)/s; t-=C(k)/s;
f[i][j][k]/=t;
}
printf("%0.10lf ",f[n][m][l]);
memset(f,0,sizeof(f));
for (int i=1;i<=l;i++) f[0][0][i]=1.0;
for (int k=1;k<=l;k++)
for (int i=0;i<=n;i++)
for (int j=0;j<=m;j++) {
if (i+j+k<=k) continue;
if (i==0&&j==0) continue;
double s=C(i+j+k);
if (j) f[i][j][k]+=f[i][j-1][k]*i*j*1.0/s;
if (i) f[i][j][k]+=f[i-1][j][k]*i*k*1.0/s;
if (k) f[i][j][k]+=f[i][j][k-1]*j*k*1.0/s;
double t=1.0;
t-=C(i)/s; t-=C(j)/s; t-=C(k)/s;
f[i][j][k]/=t;
}
printf("%0.10lf\n",f[n][m][l]);
return 0;
}