Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition) C. Little Artem and Random Variable 数学
2016-04-28 16:23
393 查看
[b]C. Little Artem and Random Variable[/b]
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.
[b]Input[/b]
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.
[b]Output[/b]
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 than 10 - 6 from ones given in input. Also, probabilities should be non-negative and their sums should differ from 1 by no more than10 - 6.
[b]Examples[/b]
[b]input[/b]
[b]output[/b]
[b]题意:[/b]
两个一样的骰子n个面 (1-n)
并且给你max(a,b)=i和min(a,b)=i的概率
让你求a,b分别是i的概率
[b]题解:[/b]
设定骰子前i个面的概率前缀和为q[i],后缀为p[i]
那么我们可以得到
q[i]*p[i] = a[i]的前缀和
(1-q[i])*(1-p[i]) = b[i+1]的后缀和
合并化简可以得到 p[i] + q[i] = 1+a[i] - b[i+1]; 用这三个式子求就好了
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.
[b]Input[/b]
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.
[b]Output[/b]
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 than 10 - 6 from ones given in input. Also, probabilities should be non-negative and their sums should differ from 1 by no more than10 - 6.
[b]Examples[/b]
[b]input[/b]
2 0.25 0.75 0.75 0.25
[b]output[/b]
0.5 0.5 0.5 0.5
[b]题意:[/b]
两个一样的骰子n个面 (1-n)
并且给你max(a,b)=i和min(a,b)=i的概率
让你求a,b分别是i的概率
[b]题解:[/b]
设定骰子前i个面的概率前缀和为q[i],后缀为p[i]
那么我们可以得到
q[i]*p[i] = a[i]的前缀和
(1-q[i])*(1-p[i]) = b[i+1]的后缀和
合并化简可以得到 p[i] + q[i] = 1+a[i] - b[i+1]; 用这三个式子求就好了
#include <iostream> #include <cstdio> #include <cmath> #include <cstring> #include <algorithm> using namespace std; const int N = 1e5+10, M = 1e3+10, mod = 1000000, inf = 1e9+1000; typedef long long ll; double a ,b ,p ,q ; int n; int main() { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%lf",&a[i]); for(int j=1;j<=n;j++) scanf("%lf",&b[j]); for(int i=1;i<=n;i++) a[i] = a[i-1] + a[i]; for(int i=n;i>=1;i--) b[i] = b[i] + b[i+1]; for(int i=1;i<=n;i++) { double B = b[i+1] - a[i] - 1; double dd = sqrt(max(B*B-4*a[i],0.)); p[i] = (-B+dd)/2; q[i] = (-B-dd)/2; } for(int i=1;i<=n;i++) cout<<q[i]-q[i-1]<<" "; cout<<endl; for(int i=1;i<=n;i++) cout<<p[i]-p[i-1]<<" "; return 0; }
相关文章推荐
- vb19
- UIView的放大动画
- ColorFilter的简单用法 实现美图效果
- java中static方法不能被重写但是能重定义
- 【翻译】Xibo官方文档8-Tour-Log In
- Android 下载文件 显示进度条
- slf4j 和 log4j合用的(Maven)配置
- eclipse中配置jUnit
- 拓展+属性
- Android 开源项目第二篇——工具库篇
- 织梦截取标题长度和去除HTML标签获取内容函数
- bug日志(1):UIAlertView消失之后收起的键盘又弹出
- 抛弃jQuery,拥抱原生JavaScript
- Android Volley完全解析(二),使用Volley加载网络图片
- Jenkins 添加sonar对代码静态检查
- Linux tasklet 分析笔记(转载)
- Linux下安装nexus私服
- javascript面向对象
- GBDT源码剖析
- 关于float、double结果精度的问题