POJ 2096 Collecting Bugs(概率DP,求期望)
来源:互联网 发布:大数据正确理解 编辑:程序博客网 时间:2024/05/01 02:49
传送门:POJ 2096 Collecting Bugs
某人一天发现一个bug,这个bug属于一个子系统,属于一个分类
每个bug属于某个子系统的概率是1/s,属于某种分类的概率是1/n
问发现n种bug,每个子系统都发现bug的天数的期望。
dp[n][s]=0;要求的答案是dp[0][0];
dp[i][j]可以转化成以下四种状态:
dp[i][j],发现一个bug属于已经有的i个分类和j个系统。概率为(i/n)*(j/s);
dp[i][j+1],发现一个bug属于已有的分类,不属于已有的系统.概率为 (i/n)*(1-j/s);
dp[i+1][j],发现一个bug属于已有的系统,不属于已有的分类,概率为 (1-i/n)*(j/s);
dp[i+1][j+1],发现一个bug不属于已有的系统,不属于已有的分类,概率为 (1-i/n)*(1-j/s);
描述:
Collecting Bugs
Time Limit: 10000MS Memory Limit: 64000KTotal Submissions: 4952 Accepted: 2458Case 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.
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
题意:
(题意看题目确实比较难懂)
一个软件有s个子系统,会产生n种bug某人一天发现一个bug,这个bug属于一个子系统,属于一个分类
每个bug属于某个子系统的概率是1/s,属于某种分类的概率是1/n
问发现n种bug,每个子系统都发现bug的天数的期望。
思路:
dp求期望
逆着递推求解
dp[n][s]=0;要求的答案是dp[0][0];
dp[i][j]可以转化成以下四种状态:
dp[i][j],发现一个bug属于已经有的i个分类和j个系统。概率为(i/n)*(j/s);
dp[i][j+1],发现一个bug属于已有的分类,不属于已有的系统.概率为 (i/n)*(1-j/s);
dp[i+1][j],发现一个bug属于已有的系统,不属于已有的分类,概率为 (1-i/n)*(j/s);
dp[i+1][j+1],发现一个bug不属于已有的系统,不属于已有的分类,概率为 (1-i/n)*(1-j/s);
整理便得到转移方程
概率期望学习:http://kicd.blog.163.com/blog/static/126961911200910168335852/
代码:
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;const int N=1010;double dp[N][N];int main(){ int n,s; 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; dp[i][j]=(n*s+i*(s-j)*dp[i][j+1]+(n-i)*j*dp[i+1][j]+(n-i)*(s-j)*dp[i+1][j+1])/(n*s-i*j); } } printf("%.4lf\n",dp[0][0]);//POJ上G++要改成%.4f } return 0;}
0 0
- POJ 2096 Collecting Bugs(概率DP求期望)
- POJ 2096 - Collecting Bugs(概率DP 求期望)
- poj 2096 Collecting Bugs 概率DP求期望(简单)
- POJ 2096 Collecting Bugs(概率DP求期望)
- POJ 2096 Collecting Bugs(概率DP,求期望)
- poj 2096 Collecting Bugs 概率dp求期望
- POJ 2096 Collecting Bugs 概率dp 求期望 入门
- Poj 2096 Collecting Bugs (概率DP求期望)
- poj 2096 Collecting Bugs【概率dp 逆向求期望】
- Collecting Bugs+POJ 2096+概率期望dp
- POJ 2096 Collecting Bugs 概率DP(期望)
- POJ 2096Collecting Bugs(概率期望dp)
- [ACM] poj 2096 Collecting Bugs (概率DP,期望)
- poj 2096 Collecting Bugs 概率dp(期望)
- Poj 2096 Collecting Bugs(概率(期望)+dp)
- 【POJ 2096】Collecting Bugs(概率与期望+dp)
- poj 2096 Collecting Bugs (概率与期望DP)
- Poj 2096 Collecting Bugs (dp求期望)
- beego 注解路由
- 跟我一起学python(一),python基础
- AL笔试
- tips0001adt-bundle-windows环境变量配置
- 美团点评编程题
- POJ 2096 Collecting Bugs(概率DP,求期望)
- [maya学习笔记(20)] 约束
- HDU 1056 水
- 对于static的学习心得
- PAT 1063. Set Similarity (25)(set的使用)
- POJ 2965 The Pilots Brothers' refrigerator(高斯消元三种方法)
- codevs 1002
- Spring3.1 Cache注解
- Java设计模式—桥梁模式