HDU—1052—Tian Ji -- The Horse Racing
2016-07-24 17:02
225 查看
Tian Ji -- The Horse Racing
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice HDU
1052
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
3
92 83 71
95 87 74
2
20 20
20 20
2
20 19
22 18
0
Sample Output
200
0
0
代码:
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice HDU
1052
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
3
92 83 71
95 87 74
2
20 20
20 20
2
20 19
22 18
0
Sample Output
200
0
0
代码:
#include<cstdio> #include<algorithm> using namespace std; bool cmp(int x,int y) { return x>y; } int tian[1010],king[1010]; int main() { int n; while(scanf("%d",&n)&&n) { for(int i=0;i<n;i++) scanf("%d",&tian[i]); for(int i=0;i<n;i++) scanf("%d",&king[i]); sort(tian,tian+n,cmp); sort(king,king+n,cmp); int t_max=0,t_min=n-1; int k_max=0,k_min=n-1; int win=0; for(int i=0;i<n;i++) //要进行 n 轮比赛 { if(tian[t_max]>king[k_max]) { t_max++; k_max++; win++; } else if(tian[t_max]<king[k_max]) //让田忌最慢的vs国王最快的 先输一场 { t_min--; k_max++; win--; } else //田忌最快的马等于国王最快的马 { if(tian[t_min]>king[k_min]) { t_min--; k_min--; win++; } else if(tian[t_min]<king[k_min]) { t_min--; k_max++; win--; } else //田忌最慢的马等于国王最慢的马,让田忌最慢的马vs国王最快的马 输一场 { if(tian[t_min]<king[k_max]) { t_min--; k_max++; win--; } } } } printf("%d\n",win*200); } return 0; }
相关文章推荐
- 常用聚类算法以及算法评价
- Sublime Text 默认是没有显示或隐藏行号的快捷键
- 数论基础1011 UVA 11754 剩余定理+枚举
- linux从入门到高手的学习书籍整理
- Android 6.0中添加硬件抽象层(HAL)
- Java的初始化块、静态初始化块、构造函数的执行顺序及用途探究
- 代码审计的艺术系列—第三篇
- 全局获取Context
- WPF报表
- IO流以日志文件记录异常
- hdu 5726 2016 Multi-University Training Contest 1(二分+dp)
- 深入浅出看流媒体前世今生,分分钟二逼变牛逼
- Python 之 pickle/json序列化
- 安全卫士 主界面 适配器ada的优化
- win10安装oracle 11g 时出现INS-13001环境不满足最低要求
- Java异常处理-----运行时异常(RuntimeException)
- Java异常处理-----运行时异常(RuntimeException)
- 【C++ 与 STL】集合:set
- Leetcode 107. Binary Tree Level Order Traversal II (Easy) (cpp)
- 【杭电 1222】Wolf and Rabbit