POJ2096 Collecting Bugs （概率DP）

 

Collecting Bugs

Time Limit: 10000MS		Memory Limit: 64000K
Total Submissions: 6199		Accepted: 3051
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

 

题意：有n个bug，s个子系统，问在s个子系统中找出n个bug所需要的天数的期望。

 

思路：dp[i][j]表示已经找到i种bug在j个子系统中，到距离n种bug和s个子系统还需要的期望天数。显然dp[n][s] = 0,而我们要求的答案是dp[0][0]。从上一步递推到下一分为四种情况：①dp[i+1][j+1] ->表示在一个新的子系统中找到了一个新的bug，概率为：(n-i)*(s-j)/(n*s)  -> p1；

       ②dp[i+1][j]->表示在一个已有的系统中找到一个新的bug，概率为(n-i)*j/(n*s) -> p2；

       ③dp[i][j+1]->表示在一个新的系统中找到一个已有的bug，概率为i*(s-j)/(n*s) -> p3；

       ④dp[i][j] ->表示在一个已有的系统中发现一个已有的bug，概率为i*j/(n*s) -> p4；

则可得状态转移方程为：dp[i][j] = p1 * dp[i+1][j+1] + p2 * dp[i+1][j] + p3 * dp[i][j+1] + p4 * dp[i][j] + 1 //加1的原因是因为要增加一天，求得是下一天。

注意：运算时尽量减少除法的运算次数

 

AC代码如下：

 

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

double dp[1010][1010];
int n,s;

int main(){
    while(~scanf("%d%d",&n,&s)){
        dp[n][s] = 0;
        for(int i = n; i >= 0; i --){
            for(int j = s; j >= 0; j --){
                if(i == n && j == s) continue;
                int p1 = (n - i) * (s - j) * 1.0;
                int p2 = (n - i) * j * 1.0;
                int p3 =  i * (s - j) * 1.0;
                int p4 = i * j * 1.0;
                dp[i][j] = (p1 * dp[i+1][j+1] + p2 * dp[i+1][j] + p3 * dp[i][j+1] + n*s) / (n * s - p4);
            }
        }
        printf("%.4lf\n",dp[0][0]);
    }
    return 0;
}