(hdu step 6.3.5)Card Game Cheater(匹配的最大数:a与b打牌,问b赢a多少次)
称号:
Card Game Cheater |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 103 Accepted Submission(s): 74 |
Problem Description
Adam and Eve play a card game using a regular deck of 52 cards. The rules are simple. The players sit on opposite sides of a table, facing each other. Each player gets k cards from the deck and, after looking at them, places the cards face down in a row on the table. Adam’s cards are numbered from 1 to k from his left, and Eve’s cards are numbered 1 to k from her right (so Eve’s i:th card is opposite Adam’s i:th card). The cards are turned face up, and points are awarded as follows (for each i ∈ {1, . . . , k}):
If Adam’s i:th card beats Eve’s i:th card, then Adam gets one point. If Eve’s i:th card beats Adam’s i:th card, then Eve gets one point. A card with higher value always beats a card with a lower value: a three beats a two, a four beats a three and a two, etc. An ace beats every card except (possibly) another ace. If the two i:th cards have the same value, then the suit determines who wins: hearts beats all other suits, spades beats all suits except hearts, diamond beats only clubs, and clubs does not beat any suit. For example, the ten of spades beats the ten of diamonds but not the Jack of clubs. This ought to be a game of chance, but lately Eve is winning most of the time, and the reason is that she has started to use marked cards. In other words, she knows which cards Adam has on the table before he turns them face up. Using this information she orders her own cards so that she gets as many points as possible. Your task is to, given Adam’s and Eve’s cards, determine how many points Eve will get if she plays optimally. |
Input
There will be several test cases. The first line of input will contain a single positive integer N giving the number of test cases. After that line follow the test cases.
Each test case starts with a line with a single positive integer k <= 26 which is the number of cards each player gets. The next line describes the k cards Adam has placed on the table, left to right. The next line describes the k cards Eve has (but she has not yet placed them on the table). A card is described by two characters, the first one being its value (2, 3, 4, 5, 6, 7, 8 ,9, T, J, Q, K, or A), and the second one being its suit (C, D, S, or H). Cards are separated by white spaces. So if Adam’s cards are the ten of clubs, the two of hearts, and the Jack of diamonds, that could be described by the line TC 2H JD |
Output
For each test case output a single line with the number of points Eve gets if she picks the optimal way to arrange her cards on the table.
|
Sample Input
3 |
Sample Output
1 |
Source
Northwestern Europe 2004
|
Recommend
8600
|
题目大意:
a和b手上都有n张牌,b的一张牌赢了a的一张牌,b就得一分,问b能得多少分。
例子分析:
输入:
3
1//两个人手中的牌的张数
JD//adams手上的牌
JH//eves手上的牌
2
5D TC
4C 5H
输出:
第二个例子中的输出结果为1.为什么呢。
由于eves手上仅仅有5H比adams手上的5D大。得1分。他手上的4C要比
adams手上的TC要小,不能得分。
题目分析:
二分图,求最大匹配。需要注意的是。
1、这道题中的匹配规则已经不是“a愿不愿意与b匹配”了。而是,仅仅有在b>a的时候才干匹配
2、这道题中b和a都是字符串。
怎样比較大小呢?先比較第1个字符然后,假设第1个字符相等再比較第2个字符。
3、这道题是用的是邻接表求的最大匹配数。
代码例如以下:
/*
* e.cpp
*
* Created on: 2015年3月14日
* Author: Administrator
*/ #include <iostream>
#include <cstdio>
#include <vector>
#include <cstring> using namespace std; const int maxn = 27; vector<int> map[maxn];
bool useif[maxn];
int link[maxn]; int n; /**
* 获取一张牌前缀的索引
*/
int card_pre(char a){
string pre = "23456789TJQKA";
int len = pre.length(); int i;
for(i = 0 ; i < len ; ++i){
if(a == pre.at(i)){
return i;
}
} return 0;
} /**
* 获取一张牌后缀的索引
*/
int card_suf(char a){
string suf = "CDSH";
int len = suf.length();
int i;
for(i = 0 ; i < len ; ++i){
if(a == suf.at(i)){
return i;
}
} return 0;
} /**
* 比較a和b这两张牌哪一张牌比較大
*/
bool isBig(string a,string b){
int aa = card_pre(a[0]);//获取一张牌的前缀
int bb = card_pre(b[0]);//获取一张牌的后缀 if(aa == bb){//假设这两张牌的前缀同样
return card_suf(a[1]) < card_suf(b[1]);//则比較后缀
} //假设这两张牌的前缀已经不同样则直接比較前缀
return aa < bb;
} /**
* 推断一个节点t是否能找到和她匹配的节点
*/
bool can(int t){
int i;
int size = map[t].size();//获取愿意与节点t匹配的结点的数量
for(i = 0 ; i < size ; ++i){//遍历每个愿意和结点t匹配的结点
int index = map[t][i];//获取当前愿意和结点t匹配的节点的索引
if(useif[index] == false){//假设这个节点还没有匹配
useif[index] = true;//那么将这个节点标记为已经匹配
//假设这个节点还没有匹配的节点||月这个节点匹配的节点可以找到其它结点与它匹配
if(link[index] == -1 || can(link[index])){
link[index] = t;//那么将当前节点匹配的结点设置为t return true;//返回true,表示根节点t可以找到与它匹配的节点
}
}
} return false;//返回false,表示节点t无法找到与它匹配的结点
} /**
* 求醉大匹配数
*
*/
int max_match(){
int num = 0; int i;
for(i = 0 ; i < n ; ++i){//遍历每个结点
memset(useif,false,sizeof(useif));
if(can(i) == true){
num++;
}
} return num;
} int main(){
int t;
scanf("%d",&t); string adams[maxn]; while(t--){
// int n;//这里千万不要在定义一个局部变量,否则会覆盖全局变量
scanf("%d",&n);
int i; //初始化变量
memset(link,-1,sizeof(link));
for(i = 0 ; i < n ; ++i){
map[i].clear();
} for(i = 0 ; i < n ; ++i){//初始化adams的牌
cin >> adams[i];
} string eves;
/**
* 每次读入eves当前的牌,都接着计算它能与adams的那些牌匹配.
* 这列的匹配规则已经不是:a愿不愿意 与b匹配了.
* 而是仅仅有当b>a的时候,b才干与a匹配
* (为什么呢?由于eves要得分,那么他手上的牌就必需要比adams的大)
*/
for(i = 0 ; i < n ; ++i){
cin >> eves; int j;
for(j = 0 ; j < n ; ++j){
if(isBig(adams[j],eves) == true){
map[i].push_back(j);
}
}
} printf("%d\n",max_match());//计算最大匹配数
} return 0;
}
版权声明:本文博客原创文章,博客,未经同意,不得转载。
(hdu step 6.3.5)Card Game Cheater(匹配的最大数:a与b打牌,问b赢a多少次)的更多相关文章
- (简单匹配)Card Game Cheater -- hdu --1528
http://acm.hdu.edu.cn/showproblem.php?pid=1528 Card Game Cheater Time Limit: 2000/1000 MS (Java/Othe ...
- hdu 1528 Card Game Cheater (二分匹配)
Card Game Cheater Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others ...
- hdu----(1528)Card Game Cheater(最大匹配/贪心)
Card Game Cheater Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others ...
- Card Game Cheater(贪心+二分匹配)
Card Game Cheater Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others ...
- HDOJ 1528 Card Game Cheater
版权声明:来自: 码代码的猿猿的AC之路 http://blog.csdn.net/ck_boss https://blog.csdn.net/u012797220/article/details/3 ...
- Card Game Cheater
Card Game Cheater Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others ...
- hdu 1528 Card Game Cheater ( 二分图匹配 )
题目:点击打开链接 题意:两个人纸牌游戏,牌大的人得分.牌大:2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < T < J < ...
- POJ 2062 HDU 1528 ZOJ 2223 Card Game Cheater
水题,感觉和田忌赛马差不多 #include<cstdio> #include<cstring> #include<cmath> #include<algor ...
- (hdu step 7.1.5)Maple trees(凸包的最小半径寻找掩护轮)
称号: Maple trees Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Tot ...
随机推荐
- Factorization Machines 学习笔记(四)学习算法
近期学习了一种叫做 Factorization Machines(简称 FM)的算法.它可对随意的实值向量进行预測.其主要长处包含: 1) 可用于高度稀疏数据场景:2) 具有线性的计算复杂度.本文 ...
- Web Api 2(Cors)Ajax跨域访问
支持Ajax跨域访问ASP.NET Web Api 2(Cors)的简单示例教程演示 随着深入使用ASP.NET Web Api,我们可能会在项目中考虑将前端的业务分得更细.比如前端项目使用Ang ...
- sleep和wait的区别
sleep指线程被调用时,占着CPU不工作,形象地说明为“占着CPU睡觉”,此时,系统的CPU部分资源被占用,其他线程无法进入,会增加时间限制.wait指线程处于进入等待状态,形象地说明为“等待使用C ...
- hdu4126(最小生成树+dfs)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4126 题意:给出一幅3000个点的图,有10000次操作: 求将某条边的权值变大后的最小生成树,最后输 ...
- 京东商城招聘scala 高级开发工程师 T3级别
岗位级别:T3 岗位职责: 1.参与自动调价.匹配系统的设计和实现 岗位要求: 1. 一年以上scala开发经验2.良好的函数式编程能力3. JAVA基础扎实4.熟悉大数据处理,有hadoop/hba ...
- Android中Broadcast Receiver组件具体解释
BroadcastReceiver(广播接收器)是Android中的四大组件之中的一个. 以下是Android Doc中关于BroadcastReceiver的概述: ①广播接收器是一个专注于接收广播 ...
- Luci - UCI (Unified Configuration Interface)
参考: http://wiki.openwrt.org/doc/techref/uc http://luci.subsignal.org/api/luci/modules/luci.model.uci ...
- Linux环境编程之同步(二):条件变量
相互排斥锁用于上锁,条件变量则用于等待.条件变量是类型为pthread_cond_t的变量.一般使用例如以下函数: #include <pthread.h> int pthread_con ...
- LeetCode——Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). ...
- Apache James使用的方法及相关心得(转)
经过一番的辛苦努力,终于把James 配置搞定啦,好记性不如烂笔头啊,赶紧记下我的成功经过,以备以后查阅! 首先要做的就是配置域名的MX 记录啦: 先添加一条A记录: mail.abc.com 指向 ...