Codeforces Round #284 (Div. 1) B. Name That Tune(概率DP)(难)
1 second
256 megabytes
standard input
standard output
It turns out that you are a great fan of rock band AC/PE. Peter learned that and started the following game: he plays the first song of the list of n songs
of the group, and you have to find out the name of the song. After you tell the song name, Peter immediately plays the following song in order, and so on.
The i-th song of AC/PE has its recognizability pi.
This means that if the song has not yet been recognized by you, you listen to it for exactly one more second and with probability of pi percent
you recognize it and tell it's name. Otherwise you continue listening it. Note that you can only try to guess it only when it is integer number of seconds after the moment the song starts playing.
In all AC/PE songs the first words of chorus are the same as the title, so when you've heard the first ti seconds
of i-th song and its chorus starts, you immediately guess its name for sure.
For example, in the song Highway To Red the chorus sounds pretty late, but the song has high recognizability. In the song Back In Blue, on the other hand, the words from the title sound close to the beginning of the song, but it's hard to name it before hearing
those words. You can name both of these songs during a few more first seconds.
Determine the expected number songs of you will recognize if the game lasts for exactly T seconds (i. e. you can make the last guess
on the second T, after that the game stops).
If all songs are recognized faster than in T seconds, the game stops after
the last song is recognized.
The first line of the input contains numbers n and T (1 ≤ n ≤ 5000, 1 ≤ T ≤ 5000),
separated by a space. Next n lines contain pairs of numbers pi and ti (0 ≤ pi ≤ 100, 1 ≤ ti ≤ T).
The songs are given in the same order as in Petya's list.
Output a single number — the expected number of the number of songs you will recognize in T seconds. Your answer will be considered
correct if its absolute or relative error does not exceed 10 - 6.
2 2
50 2
10 1
1.500000000
2 2
0 2
100 2
1.000000000
3 3
50 3
50 2
25 2
1.687500000
2 2
0 2
0 2
1.000000000
大致题意:听歌识曲,有n首歌,每首歌有ti的时间供你猜,当到ti时就会播放歌曲名所以必定会猜中,除了ti秒以外,其它每s猜中的概率是p,求Ts后猜中的歌曲个数的期望
我们设dp[i][j]表示猜到第i首歌,所用时间恰好为j的概率。
如果第i首歌识别的概率是pi。最多所用次数为ti。
如今我们识别第i首歌所用总时间恰好为j,那么其可能是dp[i-1][j-ti],dp[i-1][j-ti+1],......,dp[i-1][j-1]转移过来的。
显然暴力dp的复杂度是O(n^3)会T,所以进一步优化,dp[i][j]可由dp[i][j-1] O(1)推得
期望等于每首歌被猜中的概率之和
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std; const int N =5e3+100;
int n,T;
double dp[N][N];
double p[N];
int t[N]; int main()
{
cin>>n>>T;
for(int i=1;i<=n;i++) cin>>p[i],p[i]=p[i]/100,cin>>t[i];
dp[0][0]=1;
double ans=0;
for(int i=0;i<=n;i++)
{
double pp1,pp2;
if(i>0&&t[i]>2) pp1=pow(1-p[i],1.0*(t[i]-2));
pp2=pow(1-p[i+1],t[i+1]-1);
for(int j=0;j<=T;j++)
{
if(dp[i][j]==0) continue;
if(i>0&&t[i]>2)
{
double tmp=dp[i][j];
if(j>=t[i]) tmp-=dp[i-1][j-t[i]]*pp1*(1-p[i]);
if(j>=t[i]-1) tmp-=dp[i-1][j-t[i]+1]*pp1*p[i];
dp[i][j+1]+=tmp*(1-p[i]);
}
if(j+1<=T&&t[i+1]>1) dp[i+1][j+1]+=dp[i][j]*p[i+1];
if(j+t[i+1]<=T)dp[i+1][j+t[i+1]]+=dp[i][j]*pp2;
if(i>0) ans+=dp[i][j];
}
}
printf("%.10f\n",ans);
}
Codeforces Round #284 (Div. 1) B. Name That Tune(概率DP)(难)的更多相关文章
- Codeforces Round #284 (Div. 2) D. Name That Tune [概率dp]
D. Name That Tune time limit per test 1 second memory limit per test 256 megabytes input standard in ...
- Codeforces Round #301 (Div. 2) D. Bad Luck Island 概率DP
D. Bad Luck Island Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/540/pr ...
- Codeforces Round #105 (Div. 2) D. Bag of mice 概率dp
题目链接: http://codeforces.com/problemset/problem/148/D D. Bag of mice time limit per test2 secondsmemo ...
- Codeforces Round #293 (Div. 2) D. Ilya and Escalator 概率DP
D. Ilya and Escalator time limit per test 2 seconds memory limit per test 256 megabytes input standa ...
- Codeforces Round #233 (Div. 2)D. Painting The Wall 概率DP
D. Painting The Wall ...
- Codeforces Round #597 (Div. 2) E. Hyakugoku and Ladders 概率dp
E. Hyakugoku and Ladders Hyakugoku has just retired from being the resident deity of the South Black ...
- Codeforces Round #267 (Div. 2) C. George and Job(DP)补题
Codeforces Round #267 (Div. 2) C. George and Job题目链接请点击~ The new ITone 6 has been released recently ...
- Codeforces Round #284 (Div. 2)A B C 模拟 数学
A. Watching a movie time limit per test 1 second memory limit per test 256 megabytes input standard ...
- Codeforces Round #284 (Div. 2)
题目链接:http://codeforces.com/contest/499 A. Watching a movie You have decided to watch the best moment ...
随机推荐
- Top 5 Timed Events[转]
Event Waits Time (s) Ela Time --------------------- ...
- mysql5.7下面windows平台大小写敏感
转自:https://blog.csdn.net/lrl219/article/details/52889582 根据网上的信息在my.ini下面的mysqld的配置下面添加lower_case_ta ...
- Centos 6 搭建邮箱服务器教程
Centos 6 搭建邮箱服务器主要是是包括了Postfix, Dovecot和 MySQL了,下文我们详细的为各位介绍Centos 6 搭建邮箱服务器教程(Postfix, Dovecot和 MyS ...
- Android之MVP架构
MVP(Model View Presenter)模式是由MVC模式发展而来的,在如今的Android程序开发中显得越来越重要.本篇文章简单讨论了MVP模式的思想. 啥是MVP MVP模式的主要思想是 ...
- 微信小程序video组件出现无法播放或卡顿
微信小程序使用video组件播放视频的时候,会出现卡顿或者无法播放的问题,加一个custom-cache=”true“即可解决,这个属性文档上没有,是从小程序开发社区中get到的.
- 原生js做h5小游戏之打砖块
前言 首先,先说明一下做这个系列的目的:其实主要源于博主希望熟练使用 canvas 的相关 api ,同时对小游戏的实现逻辑比较感兴趣,所以希望通过这一系列的小游戏来提升自身编程能力:关于 es6 语 ...
- javascript中构造函数的三种方式
<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8&quo ...
- CorelDRAW X6、X7&2018,500现金返利等你拿!
购物狂欢节要来了,你准备好了么? 不知何时起,四根神棍的日子却成了大家拼爹.拼钱包.拼手速.拼网速.拼钱包...各种火拼日子 你是从哪年关注并重视双11的,记得小编我第一次邂逅双11真的只是凑凑热闹 ...
- BZOJ1150 [CTSC2007] 数据备份Backup 贪心_堆_神题
Description 你在一家 IT 公司为大型写字楼或办公楼(offices)的计算机数据做备份.然而数据备份的工作是枯燥乏味 的,因此你想设计一个系统让不同的办公楼彼此之间互相备份,而你则坐在家 ...
- python二级登陆菜单
""" 1.三级菜单 注册 登陆 注销 2.进入每一个一级菜单,都会有下一级的菜单"""user_item = dict()try: whi ...