poj 2096 期望DP 解题报告
来源:互联网 发布:美橙互联和阿里云 编辑:程序博客网 时间:2024/06/11 02:59
Collecting Bugs
Time Limit: 10000MS Memory Limit: 64000K
Total Submissions: 6089 Accepted: 3004
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
思路
你们看这个英文就讨厌。
一道期望DP题。定义dp[i][j]表示还剩i个bug,j个系统平均需要多少天。
具体的就看代码吧。
注意:poj评测时%.4f和%4.lf要区别。。。
代码
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>#include<vector>using namespace std;const int N=1e3+2,S=1e3+2;double dp[N][S];int n,s,ns;int main() { while(~scanf("%d%d",&n,&s)) { ns=n*s,dp[n][s]=0; for (int i=n;~i;--i) for (int j=s;~j;--j) { if (i==n&&j==s) continue; dp[i][j]=(i*(s-j)*dp[i][j+1]+(n-i)*j*dp[i+1][j]+(n-i)*(s-j)*dp[i+1][j+1]+ns)/(ns-i*j); } printf("%.4f\n",dp[0][0]); } return 0;}
- poj 2096 期望DP 解题报告
- HDU 5781 数学期望+DP 解题报告
- BZOJ 4318 期望DP 解题报告
- bzoj 4318 期望DP 解题报告
- BZOJ4318 OUS! 解题报告【期望DP】
- ZOJ 3329 期望DP 解题报告
- BZOJ 2201 期望DP 解题报告
- Codeforces 24D 期望DP 解题报告
- 2017.11.2 树上期望DP 解题报告
- 2017.11.3 树上期望DP 解题报告
- POJ 2096 概率DP 解题报告
- poj 2096 概率DP 解题报告
- POJ 3516 数学期望 解题报告
- POJ 2096 期望DP
- POJ 2096 期望dp
- Poj 1260 DP 解题报告
- POJ 1260 DP解题报告
- POJ 1160 DP 解题报告
- 输出月份英文名(20 分)
- 快速了解什么是自然语言处理
- iOS与H5界面JSBridge交互Demo
- “轻’”而不“薄”的轻量应用服务器初使用体验
- servlet在tomcat下的配置及冲突
- poj 2096 期望DP 解题报告
- servlet的生命周期(容器如何管理servlet)
- Retrofit框架之拦截器
- Java疯狂详解之Spring_装配Bean
- c++通过Thrift向flume发送数据
- 安装 Tensorflow Object Detection API
- kotlin-中文免费文档(后台,android,前端)
- 第33节:unittest状饰器简介
- Java final关键字