2265 Card Game (Second Edition)
来源:互联网 发布:javascript中的事件 编辑:程序博客网 时间:2024/06/07 00:00
Accept: 113 Submit: 309
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
第七届福建省大学生程序设计竞赛-重现赛(感谢承办方闽江学院)【题解】:其实我也不太懂,新增了一个知识,也不算新的,upper_bound()里面是二分的算法的,才不会超时,就是找比目标函数大的第一个数的下标
【代码】:
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<vector>#include<map>#define MAX 11000using namespace std;bool cmp(int a,int b){ return a>b;}long long a1[MAX];long long a2[MAX];int main(){ int re,cn=1,n; scanf("%d",&re); while(re--) { memset(a1,0,sizeof(a1)); memset(a2,0,sizeof(a2)); scanf("%d",&n); for(int t=0;t<n;t++) scanf("%lld",&a1[t]); for(int t=0;t<n;t++) scanf("%lld",&a2[t]); sort(a2,a2+n); double cnt=0.0; int a; for(int t=0;t<n;t++){ a=upper_bound(a2,a2+n,a1[t])-a2; printf("A: %d\n",a); cnt+=a; } printf("Case %d: %.2f\n",cn++,cnt/n); } return 0;}
- 2265 Card Game (Second Edition)
- 【期望】fuzoj 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
- 背包问题——0-1背包
- bzoj 1611: [Usaco2008 Feb]Meteor Shower流星雨
- 求字符串中的,最长不重复子串--java代码
- HDU --- 5703 Desert 水题【找规律】
- 扫地机器人排行榜
- 2265 Card Game (Second Edition)
- 关于讯飞语音的一些思路
- 使用Node.js+Socket.IO搭建WebSocket 实现多人群聊
- hibernate之一对一
- 协程(2)
- 基于libcurl,使用PUT方法上传内存数据
- kafka消费和生产的xml配置
- spark2.2编译
- php获取用户真实IP地址