HDU Tian Ji -- The Horse Racing
2016-03-04 21:18
471 查看
Tian Ji -- The Horse Racing
Problem Description
Here is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others."
"Both of Tian and the king have three horses in different classes, namely, regular, plus, and super. The rule is to have three rounds in a match; each of the horses must be used in one round. The winner of a single round takes two hundred silver dollars from the loser."
"Being the most powerful man in the country, the king has so nice horses that in each class his horse is better than Tian's. As a result, each time the king takes six hundred silver dollars from Tian."
"Tian Ji was not happy about that, until he met Sun Bin, one of the most famous generals in Chinese history. Using a little trick due to Sun, Tian Ji brought home two hundred silver dollars and such a grace in the next match."
"It was a rather simple trick. Using his regular class horse race against the super class from the king, they will certainly lose that round. But then his plus beat the king's regular, and his super beat the king's plus. What a simple trick. And how do you think of Tian Ji, the high ranked official in China?"
Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum matching in a bipartite graph. Draw Tian's horses on one side, and the king's horses on the other. Whenever one of Tian's horses can beat one from the king, we draw an edge between them, meaning we wish to establish this pair. Then, the problem of winning as many rounds as possible is just to find the maximum matching in this graph. If there are ties, the problem becomes more complicated, he needs to assign weights 0, 1, or -1 to all the possible edges, and find a maximum weighted perfect matching...
However, the horse racing problem is a very special case of bipartite matching. The graph is decided by the speed of the horses --- a vertex of higher speed always beat a vertex of lower speed. In this case, the weighted bipartite matching algorithm is a too advanced tool to deal with the problem.
In this problem, you are asked to write a program to solve this special case of matching problem.
Input
The input consists of up to 50 test cases. Each case starts with a positive integer n (n <= 1000) on the first line, which is the number of horses on each side. The next n integers on the second line are the speeds of Tian’s horses. Then the next n integers on the third line are the speeds of the king’s horses. The input ends with a line that has a single 0 after the last test case.Output
For each input case, output a line containing a single number, which is the maximum money Tian Ji will get, in silver dollars.Sample Input
392 83 71
95 87 74
2
20 20
20 20
2
20 19
22 18
0
Sample Output
2000
0
Source
2004 Asia Regional Shanghai#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
int main()
{
int n;
int t[1001],k[1001];
while(scanf("%d",&n)&&n)
{
int i;
for(i=1;i<=n;i++)
scanf("%d",&t[i]);
for(i=1;i<=n;i++)
scanf("%d",&k[i]);
int ti,ki;ti=ki=1;
int tj,kj;tj=kj=n;
std::sort(t+1,t+1+n,greater<int>());
std::sort(k+1,k+1+n,greater<int>());
int win;
for(i=1,win=0;i<=n;i++)
{
if(t[ti]>k[ki])
{
win++;
ti++;
ki++;
}
else if(t[ti]<k[ki])
{
win--;
tj--;
ki++;
}
else
{
if(t[tj]>k[kj])
{
win++;
tj--;
kj--;
}
else
{ if(t[tj]<k[ki])
{win--;
tj--;
ki++;
}
}
}
}
printf("%d\n",win*200);
}
}
相关文章推荐
- hdu2795 线段树 贴广告
- 解决Themida加壳程序在VMware虚拟机无法运行问题TheMida Soory, this application cannt run under a Virtual Machine---
- 知乎-怎样算是精通c++
- 快速入门:十分钟学会PythonTutorial - Learn Python in 10 minutes
- iOS之加载等待指示器(工具类)
- JSON
- CE下可用的3G
- Linux scp 命令
- 经典汉诺塔问题分析
- Requests库的几种请求 - 通过API操作Github
- 游戏软件的发展和特点
- 不能将多个项传入“Microsoft.Build.Framework.ITaskItem”类型的参数
- 网络-HTTPS科普扫盲贴(转)
- 在对结构体分配的内存进行free时出现,关于 Windows 已在 **.exe 中触发一个断点。其原因可能是堆被损坏.
- TabLayout和ViewPager的简单联用
- 盒子模型 制作三角形 圆形 导航
- 数据库事务
- java中的二维数组
- 使用指定的Action,Category调用系统Activity
- HTTP协议之ContentType