Codeforces 626D Jerry's Protest(暴力枚举+概率)
D. Jerry's Protest
time limit per test:2 seconds
memory limit per test:256 megabytes
input:standard input
output:standard output
Andrew and Jerry are playing a game with Harry as the scorekeeper. The game consists of three rounds. In each round, Andrew and Jerry draw randomly without replacement from a jar containing n balls, each labeled with a distinct positive integer. Without looking, they hand their balls to Harry, who awards the point to the player with the larger number and returns the balls to the jar. The winner of the game is the one who wins at least two of the three rounds.
Andrew wins rounds 1 and 2 while Jerry wins round 3, so Andrew wins the game. However, Jerry is unhappy with this system, claiming that he will often lose the match despite having the higher overall total. What is the probability that the sum of the three balls Jerry drew is strictly higher than the sum of the three balls Andrew drew?
Input
The first line of input contains a single integer n (2 ≤ n ≤ 2000) — the number of balls in the jar.
The second line contains n integers ai (1 ≤ ai ≤ 5000) — the number written on the ith ball. It is guaranteed that no two balls have the same number.
Output
Print a single real value — the probability that Jerry has a higher total, given that Andrew wins the first two rounds and Jerry wins the third. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if
.
Examples
Input
2
1 2
Output
0.0000000000
Input
3
1 2 10
Output
0.0740740741
Note
In the first case, there are only two balls. In the first two rounds, Andrew must have drawn the 2 and Jerry must have drawn the 1, and vice versa in the final round. Thus, Andrew's sum is 5 and Jerry's sum is 4, so Jerry never has a higher total.
In the second case, each game could've had three outcomes — 10 - 2, 10 - 1, or 2 - 1. Jerry has a higher total if and only if Andrew won 2 - 1 in both of the first two rounds, and Jerry drew the 10 in the last round. This has probability
.
题目链接:http://codeforces.com/contest/626/problem/D
题意:给定n个球以及每个球对应的分值a[],现在A和B进行三局比赛,每局比赛两人随机抽取一个球进行比拼,分值高的获胜。现在A胜了两局,B不服输,因为他三局总分高于A。问发生的概率。
分析:首先分值最高为5000,可以考虑枚举分值求概率。假设B胜的那一局胜X分,A胜的两局胜Y分,我们可以考虑枚举X或者Y。以枚举X来说要求X > Y,关键在于求出B一局胜分X概率Pb[X] 以及 A两局胜分Y的概率Pa[Y]。
那么直接暴力就好了,暴力前sort一下。对于第i个球a[i],胜分的球在j(1 <= j < i),把所有胜分求出并统计cnt[]。这样对于一局比拼的胜分T,概率为cnt[T] / (n*(n-1)/2)。
求出一局的胜分,两局也就好求了。对于A而言,两局胜T分显然概率为cnt[a] / (n*(n-1)/2) * cnt[b] / (n*(n-1)/2) 其中(a + b == T)。A两局胜分T,可以O(a[max] * a[max])求出。
这题会爆int,所以。。。。。
下面给出AC代码:
1 #include <bits/stdc++.h>
2 using namespace std;
3 typedef long long ll;
4 const int N=5050;
5 int n;
6 double ans;
7 ll cnt[N<<2],a[N<<2],b[N<<2];
8 inline int read()
9 {
10 int x=0,f=1;
11 char ch=getchar();
12 while(ch<'0'||ch>'9')
13 {
14 if(ch=='-')
15 f=-1;
16 ch=getchar();
17 }
18 while(ch>='0'&&ch<='9')
19 {
20 x=x*10+ch-'0';
21 ch=getchar();
22 }
23 return x*f;
24 }
25 int main()
26 {
27 n=read();
28 for(int i=1;i<=n;i++)
29 a[i]=read();
30 sort(a+1,a+1+n);
31 for(int i=1;i<=n;i++)
32 {
33 for(int j=n-1;j>=1;j--)
34 {
35 cnt[a[i]-a[j]]++;
36 }
37 }
38 ll sum=(n-1)*n/2;
39 for(int i=1;i<=5000;i++)
40 {
41 for(int j=1;j<=5000;j++)
42 {
43 b[i+j]+=1ll*cnt[i]*cnt[j];
44 }
45 }
46 for(int i=1;i<=5000;i++)
47 {
48 for(int j=i-1;j>=1;j--)
49 {
50 ans+=1.0*cnt[i]*b[j]/sum/sum/sum;
51 }
52 }
53 printf("%.10lfn",ans);
54 return 0;
55 }
- MySQL 5.7 General Tablespace学习(r11笔记第34天)
- Veeam Backup & Replication(一):安装及配置
- HDUOJ-----Computer Transformation
- Veeam Backup & Replication(二):添加虚拟化主机和配置备份存储
- HDUOJ 2672---god is a girl 《斐波那契数》
- Golang语言--一些基础用法
- 复杂SQL性能优化的剖析(一)(r11笔记第36天)
- hduoj1073--Online Judge
- Golang语言--- channel
- Golang语言--将byte的int转换
- HDUOJ------Daydream字符查找-并求其始末位置
- HDUOJ------敌兵布阵
- 复杂SQL性能优化的剖析(二)(r11笔记第37天)
- HDUOJ-------Being a Good Boy in Spring Festival
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法
- Redis持久化策略
- Redis二进制安全的原理
- 面试必备 Vue 知识点
- 数据传输 | mysqldiff/mysqldbcompare 实现 DTLE 自动化测试
- CPU有个禁区,内核权限也无法进入!
- 分布式 | DBLE 3.20.07.0 来啦!
- C语言三剑客之《C陷阱与缺陷》一书精华提炼
- Linux进程间通信(上)之管道、消息队列实践
- FPGA上电时序
- 更新Kubernetes APIServer证书
- R语言连续时间马尔科夫链模拟案例 Markov Chains
- 如何用R语言在机器学习中建立集成模型?
- 从零开始Kubernetes Operator
- TiKV源码解析系列文章(二十)Region Split源码解析
- scrapy爬虫框架和selenium的使用:对优惠券推荐网站数据LDA文本挖掘