0.0

# Card Game Cheater

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1805    Accepted Submission(s): 983

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 1 JD JH 2 5D TC 4C 5H 3 2H 3H 4H 2D 3D 4D

Sample Output
1 1 2

Source

1、明显两个人，当做两个集合，集合中的元素就是其拥有的牌面。

2、然后建图：设定map【i】【j】=x；如果x==1表示第二个人的第j张牌可以赢第一个人的第i张牌，那么对应每个牌都处理一下，就能将图建好了。

3、然后将建好的图跑一遍匈牙利最大匹配算法即可，最大匹配即答案。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
char a[100][15];
char b[100][15];
int map[100][100];
int match[100];
int vis[100];
int n;
int judge(int i,int j)
{
int vali=-1;
int valj=-1;
if(a[i][0]=='T')vali=10;
if(a[i][0]=='J')vali=11;
if(a[i][0]=='Q')vali=12;
if(a[i][0]=='K')vali=13;
if(a[i][0]=='A')vali=14;
if(vali==-1)vali=a[i][0]-'0';
if(b[j][0]=='T')valj=10;
if(b[j][0]=='J')valj=11;
if(b[j][0]=='Q')valj=12;
if(b[j][0]=='K')valj=13;
if(b[j][0]=='A')valj=14;
if(valj==-1)valj=b[j][0]-'0';
if(vali<valj)return 1;
else if(vali==valj)
{
vali=-1;
valj=-1;
if(a[i][1]=='C')vali=1;
if(a[i][1]=='D')vali=2;
if(a[i][1]=='S')vali=3;
if(a[i][1]=='H')vali=4;
if(b[j][1]=='C')valj=1;
if(b[j][1]=='D')valj=2;
if(b[j][1]=='S')valj=3;
if(b[j][1]=='H')valj=4;
if(vali<valj)return 1;
else return 0;
}
else return 0;
}
void getmap()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(judge(i,j)==1)
{
map[i][j]=1;
}
}
}
}
int find(int u)
{
for(int i=1;i<=n;i++)
{
if(map[u][i]==1&&vis[i]==0)
{
vis[i]=1;
if(match[i]==-1||find(match[i]))
{
match[i]=u;
return 1;
}
}
}
return 0;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(map,0,sizeof(map));
memset(match,-1,sizeof(match));
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%s",a[i]);
}
for(int i=1;i<=n;i++)
{
scanf("%s",b[i]);
}
getmap();
/*
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
printf("%d ",map[i][j]);
}
printf("\n");
}
*/
int output=0;
for(int i=1;i<=n;i++)
{
memset(vis,0,sizeof(vis));
if(find(i)==1)output++;
}
printf("%d\n",output);
}
}


09-15 557

#### hdu acm 教案(10)

2008年10月02日 132KB 下载

07-05 942

04-16 727

07-22 1507

07-28 357

01-12 1176

09-06 1356

07-15 702