VK Cup 2016 - Round 2 D. Little Artem and Random Variable(已知两个撒子掷出的点数较大为1,2,...,n的概率,较小为1,2,...,n概率)
来源:互联网 发布:xboxone网络设置方法 编辑:程序博客网 时间:2024/05/21 02:34
Little Artyom decided to study probability theory. He found a book with a lot of nice exercises and now wants you to help him with one of them.
Consider two dices. When thrown each dice shows some integer from 1 to n inclusive. For each dice the probability of each outcome is given (of course, their sum is 1), and different dices may have different probability distributions.
We throw both dices simultaneously and then calculate values max(a, b) and min(a, b), where a is equal to the outcome of the first dice, while b is equal to the outcome of the second dice. You don't know the probability distributions for particular values on each dice, but you know the probability distributions for max(a, b) and min(a, b). That is, for each x from 1 to n you know the probability thatmax(a, b) would be equal to x and the probability that min(a, b) would be equal to x. Find any valid probability distribution for values on the dices. It's guaranteed that the input data is consistent, that is, at least one solution exists.
First line contains the integer n (1 ≤ n ≤ 100 000) — the number of different values for both dices.
Second line contains an array consisting of n real values with up to 8 digits after the decimal point — probability distribution formax(a, b), the i-th of these values equals to the probability that max(a, b) = i. It's guaranteed that the sum of these values for one dice is 1. The third line contains the description of the distribution min(a, b) in the same format.
Output two descriptions of the probability distribution for a on the first line and for b on the second line.
The answer will be considered correct if each value of max(a, b) and min(a, b) probability distribution values does not differ by more than10 - 6 from ones given in input. Also, probabilities should be non-negative and their sums should differ from 1 by no more than 10 - 6.
20.25 0.750.75 0.25
0.5 0.5 0.5 0.5
30.125 0.25 0.6250.625 0.25 0.125
0.25 0.25 0.5 0.5 0.25 0.25
题意:
有两个不同的撒子,每个撒子都可以掷出1-n,而且掷出每个点的概率都是未知的,
现在已知两个撒子掷出的点数较大为1,2,...,n的概率,较小为1,2,...,n的概率
求每个撒子掷出1,2,...,n的概率
思路:
设P(a<=k)为x1,P(b<=k)为x2
P(max(a,b)<=k)=P(a<=k)*P(b<=k)=x1*x2=第一行的前缀和
P(min(a,b)>=k+1)=(1-P(a<=k))*(1-P(b<=k))=1+x1*x2-x1-x2=第二行的后缀和
根据韦达定理,可以求出关于x1,x2的二元方程组的b,c,a默认为1,解方程便可以了。
#include<bits/stdc++.h>using namespace std;const int maxn=100100;double ans1[maxn],ans2[maxn];double pre[maxn],suf[maxn];void solve(double b,double c,double &x1,double &x2){ double x=max(b*b-4*c,0.0); x1=(-b-sqrt(x))*0.5; x2=(-b+sqrt(x))*0.5;}int main(){ int n; double a; scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%lf",&a); pre[i]=pre[i-1]+a; } for(int i=1;i<=n;i++) scanf("%lf",&suf[i]); for(int i=n;i>=1;i--) suf[i]+=suf[i+1]; double x1,x2; for(int i=1;i<=n;i++){ solve(-pre[i]-1+suf[i+1],pre[i],x1,x2); ans1[i]=x1,ans2[i]=x2; } for(int i=1;i<=n;i++) printf("%.10f ",ans1[i]-ans1[i-1]); printf("\n"); for(int i=1;i<=n;i++) printf("%.10f ",ans2[i]-ans2[i-1]); printf("\n");}
- VK Cup 2016 - Round 2 D. Little Artem and Random Variable(已知两个撒子掷出的点数较大为1,2,...,n的概率,较小为1,2,...,n概率)
- Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition) D. Little Artem and Dance
- [2-SAT] Codeforces 668E #348 (VK Cup 2016 Round 2, Div. 1 Edition) E. Little Artem and 2-SAT
- 【VK Cup 2016 - Round 1 (Div 2 Edition)C】【构造】Bear and Forgotten Tree 3 构造一棵树直径为d且点1的深度为h
- Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)-A. Little Artem and Presents(模拟)
- Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)-B. Little Artem and Grasshopper(模拟)
- Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition) E. Little Artem and Time Machine 树状数组
- CF 668C(Little Artem and Random Variable-概率)
- 【VK Cup 2016 - Round 1 (Div 2 Edition)D】【二进制思想 扫描贪心】Bear and Polynomials 2的幂次多项式改变一位使得和为0
- 剑指offer43-计算n个色子掷出各个点数和的概率
- VK Cup 2016 - Round 1 (Div. 2 Edition)----D Bear and Polynomials 数论+二进制,很好的题!!!
- VK Cup 2016 - Round 1 (Div. 2 Edition) C D
- VK Cup 2016 - Round 1 (Div. 2 Edition) D. Bear and Polynomials
- 【VK Cup 2016 - Round 1 (Div 2 Edition)D Bear and Polynomials
- 22 k个骰子掷出n的概率
- codeforces 641D. Little Artem and Random Variable
- 【树形dp统计距离为k的点对】VK Cup 2012 Round 1 D. Distance in Tree
- Codeforces Round #348 E. Little Artem and Time Machine(给你一个n,有三种选择,1表示增加一个值,2表示删除这个数的一个值,3表示查询)
- sar命令
- 机器学习资源
- Qt 编译时遇到 error: [debug/qrc_music.cpp] Error 1
- 界面设计,事件处理--GUI编程的核心--
- MBProgressHUD 提示自动换行
- VK Cup 2016 - Round 2 D. Little Artem and Random Variable(已知两个撒子掷出的点数较大为1,2,...,n的概率,较小为1,2,...,n概率)
- 主页面显示tabBar 进入的子页面不显示tabBar
- nodeJS简介及应用场景
- TCP/IP详解学习笔记(4)-ICMP协议,ping和Traceroute
- MyBatis 入门(五)--typeHandlers
- 如何解决ChemDraw引起的系统崩溃
- 页面自动换行
- UVA 216 Getting in Line dfs
- hdu2546饭卡(01背包)