【期望】fuzoj 2265 Card Game (Second Edition)
来源:互联网 发布:移动监控软件 编辑:程序博客网 时间:2024/06/08 18:18
Accept: 73 Submit: 220
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem Description
Fat brother and Maze are playing a kind of special (hentai) game with some cards. In this game, every player gets N cards at first and these are their own card deck. The game goes for N rounds and in each round, Fat Brother and Maze would draw one card from their own remaining card deck randomly and compare for the integer which is written on the cards. The player with the higher number wins this round and score 1 victory point. And then these two cards are removed from the game such that they would not appear in the later rounds. As we all know, Fat Brother is very clever, so he would like to know the expect number of the victory points he could get if he knows all the integers written in these cards.
Note that the integers written on these N*2 cards are pair wise distinct. At the beginning of this game, each player has 0 victory point.
Input
The first line of the data is an integer T (1 <= T <= 100), which is the number of the text cases.
Then T cases follow, each case contains an integer N (1 <=N<=10000) which described before. Then follow two lines with N integers each. The first N integers indicate Fat Brother’s cards and the second N integers indicate Maze’s cards.
All the integers are positive and no more than 10000000.
Output
For each case, output the case number first, and then output the expect number of victory points Fat Brother would gets in this game. The answer should be rounded to 2 digits after the decimal point.
Sample Input
Sample Output
Source
第七届福建省大学生程序设计竞赛-重现赛(感谢承办方闽江学院)思路:我们不要直接考虑游戏最后得分的期望,而是而是转化为每一轮游戏得分的期望和! 游戏总共有n轮,每一轮的结果是:fat要么得1分要么不得分(服从两点分布),所以每一轮得分的期望就是1*(k/n);(k是maze的牌值 小于fat第i张牌值 的数量)。
代码:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[10010],b[10010];int main(){ int t,round=0; scanf("%d",&t); while(t--) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); int n; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int i=0;i<n;i++) scanf("%d",&b[i]); sort(a,a+n); sort(b,b+n); double sum=0; for(int i=0;i<n;i++) { int k=upper_bound(b,b+n,a[i])-b; sum+=k;// printf("%d\n",k); } printf("Case %d: ",++round); printf("%.2f\n",sum/n); } return 0;}
- 【期望】fuzoj 2265 Card Game (Second Edition)
- 2265 Card Game (Second Edition)
- Game Design, Second Edition
- 2264 Card Game (First Edition)
- 2266 Card Game (Third Edition)
- Game Programming for Teens, Second Edition
- fzu2265Card Game (Second Edition) (数学)(简单)
- FZU 2264 Card Game (First Edition)(数学概率题)
- Understanding .NET, Second Edition
- Beginning JavaScript Second Edition
- Hardening Windows, Second Edition
- Swing, Second Edition
- Python Cookbook, Second Edition
- Programming Python, Second Edition
- Using Samba, Second Edition
- Beginning XML, Second Edition
- Beginning JavaScript Second Edition
- JavaServer Pages, Second Edition
- FusionAccess 桌面在线人数统计不一致
- 图片走马灯
- 算术基本定理
- 手机数据丢失!没想到是这样找回来的
- Linux企业部分学习笔记一
- 【期望】fuzoj 2265 Card Game (Second Edition)
- Kafka设计解析(一)- Kafka背景及架构介绍
- electron 使用 node-ffi 调用 C++ 动态链接库(DLL)
- 利用 JSP 中的反射机制封装一个 Servlet ,就不用每张表的每个方法都写一个 Servlet
- Android动画全面剖析-Frame动画
- flume 写入hdfs 采用lzo 格式 教程
- log4go的全局封装Wrapper和标准log库函数的兼容
- 设计模式--状态模式
- HDU1180 诡异的楼梯(BFS)