HDU 1052.Tian Ji -- The Horse Racing【很好的贪心】【8月27】
来源:互联网 发布:淘宝视频制作教程 编辑:程序博客网 时间:2024/04/29 18:15
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.
"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 7195 87 74220 2020 20220 1922 180
Sample Output
20000
田忌赛马的故事。贪心,策略:
1.田忌最快的比国王最快的快,比!
2.田忌最快的比国王最快的慢,用田忌最慢的与国王最快的比!
3.田忌最快的跟国王最快的相等:
1).田忌最慢的比国王最慢的快,比!
2).田忌最慢的不比国王最慢的快,用田忌最慢的跟国王最快的比!
代码如下:
#include<cstdio>#include<algorithm>using namespace std;int main(){ int n; while(scanf("%d",&n)==1&&n){ int t[1010],k[1010]; int t_low=0,k_low=0,t_fast=n-1,k_fast=n-1; for(int i=0;i<n;i++) scanf("%d",&t[i]); for(int i=0;i<n;i++) scanf("%d",&k[i]); sort(t,t+n); sort(k,k+n); int sum=0; while(t_low<=t_fast){ if(t[t_fast]>k[k_fast]){//最快的比国王最快的快 sum++; t_fast--; k_fast--; } else if(t[t_fast]<k[k_fast]){//最快的比国王最快的慢 sum--; t_low++; k_fast--; } else{//最快的一样快 if(t[t_low]<k[k_low]){//最慢的比国王最慢的慢 sum--; t_low++; k_fast--; } else if(t[t_low]>k[k_low]){//最慢的比国王最慢的快 sum++; t_low++; k_low++; } else{//最慢的也一样快,用最慢的跟国王最快的比 if(t[t_low]<k[k_fast]) sum--; t_low++; k_fast--; } } } printf("%d\n",sum*200); } return 0;}
0 0
- HDU 1052.Tian Ji -- The Horse Racing【很好的贪心】【8月27】
- hdu 1052 Tian Ji -- The Horse Racing(很好的贪心)
- HDU hdu 1052 Tian Ji -- The Horse Racing 贪心算法
- hdu 1052 Tian Ji -- The Horse Racing(贪心)
- 杭电hdu 1052 Tian Ji -- The Horse Racing 贪心
- hdu 1052 Tian Ji -- The Horse Racing 贪心算法
- HDU 1052 Tian Ji -- The Horse Racing 两头贪心
- ZOJ 2397(HDU 1052) Tian Ji -- The Horse Racing 贪心
- HDU 1052 Tian Ji -- The Horse Racing(贪心)
- HDU 1052 Tian Ji -- The Horse Racing(贪心)
- hdu 1052 Tian Ji -- The Horse Racing(贪心)
- hdu 1052 Tian Ji -- The Horse Racing 贪心算法
- hdu 1052 Tian Ji -- The Horse Racing dp/贪心
- HDU 1052 Tian Ji -- The Horse Racing (贪心)
- HDU 1052 Tian Ji -- The Horse Racing(贪心)
- hdu 1052 Tian Ji -- The Horse Racing(贪心)
- hdu :Tian Ji -- The Horse Racing 之贪心算法
- hdu 1052 Tian Ji -- The Horse Racing(贪心策略)
- 安装及使用YUICompressor(压缩JS,CSS文件)4
- hdu5317 RGCDQ(dp)
- 深度学习(DL)与卷积神经网络(CNN)学习笔记随笔-02-基于Python的卷积运算
- RedisUtil
- Ubuntu下Appium环境搭建。
- HDU 1052.Tian Ji -- The Horse Racing【很好的贪心】【8月27】
- POJ 3189--Steady Cow Assignment【二分图多重匹配 && 最大流求解 && 枚举 && 经典】
- Android px pt dp sp...
- Oracle(一)--> 数据库对象详解(文字解释,先有个小理解~)
- 10个加速Table Views开发的Tips
- jvm参数设置
- Java基础--------IO流
- Mybatis执行Update返回行数为负数
- HDU2449 Remmarguts' Date(第k短路)