poj2096(概率dp)

之前碰过这题的一维形式,随便也说一下题解吧。。

在已经收集了i个类型之后,再选一个能得到新类型的概率是(n-i)/n,所以要收集到第i+1个类型要选取的个数的期望是n/(n-i),所以收集n个类型的期望是sum(n/(n-i))

然而这方法貌似不能应用于二维。。因为到达d[i][j]的方法不止一种。。。如果这种思路还能再推广到二维的话请务必赐教orz

然后标解貌似是一个比较通用的思路。。直接粘贴。。。

    题意:一个软件有s个子系统,会产生n种bug。
    某人一天发现一个bug,这个bug属于某种bug,发生在某个子系统中。
    求找到所有的n种bug,且每个子系统都找到bug,这样所要的天数的期望。
    需要注意的是:bug的数量是无穷大的,所以发现一个bug,出现在某个子系统的概率是1/s,
    属于某种类型的概率是1/n。
    解法:
    dp[i][j]表示已经找到i种bug,并存在于j个子系统中,要达到目标状态的天数的期望。
    显然,dp[n][s]=0,因为已经达到目标了。而dp[0][0]就是我们要求的答案。
    dp[i][j]状态可以转化成以下四种:
        dp[i][j]    发现一个bug属于已经找到的i种bug和j个子系统中
        dp[i+1][j]  发现一个bug属于新的一种bug,但属于已经找到的j种子系统
        dp[i][j+1]  发现一个bug属于已经找到的i种bug,但属于新的子系统
        dp[i+1][j+1]发现一个bug属于新的一种bug和新的一个子系统
    以上四种的概率分别为:
    p1 =     i*j / (n*s)
    p2 = (n-i)*j / (n*s)
    p3 = i*(s-j) / (n*s)
    p4 = (n-i)*(s-j) / (n*s)
    又有:期望可以分解成多个子期望的加权和,权为子期望发生的概率,即 E(aA+bB+...) = aE(A) + bE(B) +...
    所以:
    dp[i,j] = p1*dp[i,j] + p2*dp[i+1,j] + p3*dp[i,j+1] + p4*dp[i+1,j+1] + 1;

然后这个思路放到一维也是行得通的。。

d[i]=i/n*d[i]+(n-i)/n*d[i+1]+1

化简得d[i]=d[i+1]+n/(n-i)   和上面的分析一样了。。




/**
 *        ┏┓    ┏┓ 
 *        ┏┛┗━━━━━━━┛┗━━━┓
 *        ┃       ┃   
 *        ┃   ━    ┃ 
 *        ┃ >   < ┃ 
 *        ┃       ┃ 
 *        ┃... ⌒ ...  ┃ 
 *        ┃       ┃ 
 *        ┗━┓   ┏━┛ 
 *          ┃   ┃ Code is far away from bug with the animal protecting           
 *          ┃   ┃   神兽保佑,代码无bug 
 *          ┃   ┃            
 *          ┃   ┃         
 *          ┃   ┃ 
 *          ┃   ┃            
 *          ┃   ┗━━━┓ 
 *          ┃       ┣┓ 
 *          ┃       ┏┛ 
 *          ┗┓┓┏━┳┓┏┛ 
 *           ┃┫┫ ┃┫┫ 
 *           ┗┻┛ ┗┻┛ 
 */  
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-12
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 1005
#define nm 500005
#define pi 3.1415926535897931
using namespace std;
const ll inf=1000000000;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return f*x;
}







int n,m;
double d[NM][NM];

int main(){
	n=read();m=read();
	dec(i,n,0)dec(j,m,0)if(i<n||j<m)
		d[i][j]=(d[i+1][j]*(n-i)*j+
				d[i][j+1]*i*(m-j)+
				d[i+1][j+1]*(n-i)*(m-j)+n*m)
		/(n*m-i*j);
	return 0*printf("%.4lf\n",d[0][0]);
}





Collecting Bugs
Time Limit: 10000MS Memory Limit: 64000K
Total Submissions: 6731 Accepted: 3265
Case Time Limit: 2000MS Special Judge

Description

Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all possible bugs into n categories. Each day he discovers exactly one bug in the program and adds information about it and its category into a spreadsheet. When he finds bugs in all bug categories, he calls the program disgusting, publishes this spreadsheet on his home page, and forgets completely about the program.
Two companies, Macrosoft and Microhard are in tight competition. Microhard wants to decrease sales of one Macrosoft program. They hire Ivan to prove that the program in question is disgusting. However, Ivan has a complicated problem. This new program has s subcomponents, and finding bugs of all types in each subcomponent would take too long before the target could be reached. So Ivan and Microhard agreed to use a simpler criteria --- Ivan should find at least one bug in each subsystem and at least one bug of each category.
Macrosoft knows about these plans and it wants to estimate the time that is required for Ivan to call its program disgusting. It's important because the company releases a new version soon, so it can correct its plans and release it quicker. Nobody would be interested in Ivan's opinion about the reliability of the obsolete version.
A bug found in the program can be of any category with equal probability. Similarly, the bug can be found in any given subsystem with equal probability. Any particular bug cannot belong to two different categories or happen simultaneously in two different subsystems. The number of bugs in the program is almost infinite, so the probability of finding a new bug of some category in some subsystem does not reduce after finding any number of bugs of that category in that subsystem.
Find an average time (in days of Ivan's work) required to name the program disgusting.

Input

Input file contains two integer numbers, n and s (0 < n, s <= 1 000).

Output

Output the expectation of the Ivan's working days needed to call the program disgusting, accurate to 4 digits after the decimal point.

Sample Input

1 2

Sample Output

3.0000

Source

Northeastern Europe 2004, Northern Subregion

[Submit]   [Go Back]   [Status]   [Discuss]


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值