zoukankan      html  css  js  c++  java
  • POJ2096-Collecting Bugs(概率DP)

    Collecting Bugs
    Time Limit: 10000MS   Memory Limit: 64000K
    Total Submissions: 2140   Accepted: 1023
    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
    
    
    题目意思:
    每天查一个BUG。一共要查n种BUG。有s个子系统,并且每一个子系统至少有一个 bug,求数学期望。多少天能查完。
    解法:
    dp[i][j]表示已经查了i种,已经有j个子系统满足了要求。距离目标的天数
    能够分成四种状态: dp[i][j+1],dp[i+1][j+1],dp[i+1][j],dp[i][j]
    每一个状态的概率非常好算:
    最后推得dp[i][j] = (dp[i+1][j]*j*(n-i)/t+dp[i][j+1]*i*(s-j)/t+dp[i+1][j+1]*(n-i)*(s-j)/t+1)//(1.0-(i*j)/t)
    
    
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <vector>
    #include <string>
    #include <algorithm>
    #include <queue>
    using namespace std;
    const int maxn = 1000+10;
    double dp[maxn][maxn];
    int n,s;
    int main(){
        while(cin >> n >> s){
            dp[n][s] = 0;
            double t = n*s;
            for(int i = n; i >= 0; i--){
                for(int j = s; j >= 0; j--){
                    if(!(i==n&&j==s)){
                        dp[i][j] = dp[i+1][j]*j*(n-i)/t+dp[i][j+1]*i*(s-j)/t+dp[i+1][j+1]*(n-i)*(s-j)/t+1;
                        dp[i][j] = dp[i][j]/(1.0-(i*j)/t);
                    }
                }
            }
            printf("%.4lf
    ",dp[0][0]);
        }
        return 0;
    }
    


    
    
    
    
    
    
    
       
    
  • 相关阅读:
    Java18(泛型,反射,内省)
    Java17(线程池、Runnable和Callable、Lock、信号量、任务调度、Timer)
    Javaday16(守护线程,线程同步,线程通讯)
    面试题错题集04(异常)
    面试题错题集03(数组)
    面试题错题集02(面向对象)
    Javaday15(Queue,Collections工具类,多线程)
    Java中的内部接口
    ISO14229:2013 之 通过标志读数据ReadDataByIdentifier (0x22)
    Oracle数据库迁移至PostgreSQL数据库问题及解决
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/5354032.html
Copyright © 2011-2022 走看看