HDOJ 1052 Tian Ji -- The Horse Racing
来源:互联网 发布:淘宝app官方下载 编辑:程序博客网 时间:2024/06/09 19:18
Tian Ji -- The Horse Racing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23508 Accepted Submission(s): 6876
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
田忌赛马
大致意思:
田忌与齐王赛马,每回合输者给赢者200银元,试编出程序,使田忌赢的钱尽可能多。
输入:
每组数的第一行为比赛的马的个数(<=100)第二行为田忌的马的速度,第三行为齐王的马的速度。
输出:
田忌赢得的钱数
#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;int n;int a[1010], b[1010];int main(){ while (scanf("%d", &n) != EOF){ for (int i = 0; i < n; i++) scanf("%d", &a[i]); for (int i = 0; i < n; i++) scanf("%d", &b[i]); sort(a, a + n); sort(b, b + n); int ans = 0; for (int i = 0, j = 0, k = n - 1, l = n - 1; i <= k;){ if (a[i] > b[j]){ //田忌最慢的马比齐王最慢的马快 ans++; i++; j++; } else if (a[k] > b[l]){ //田忌最快的马比齐王最快的马快 ans++; k--; l--; } else{ //其他情况 if (a[i] < b[l]) ans--; i++; l--; } } printf("%d\n", ans * 200); } return 0;}
0 0
- hdoj 1052-Tian Ji -- The Horse Racing
- hdoj 1052 Tian Ji -- The Horse Racing
- hdoj 1052 Tian Ji -- The Horse Racing
- hdoj 1052 Tian Ji -- The Horse Racing
- HDOJ 1052 Tian Ji -- The Horse Racing
- hdoj 1052 Tian Ji -- The Horse Racing
- hdoj-1052-Tian Ji -- The Horse Racing
- HDOJ 1052 Tian Ji -- The Horse Racing
- hdoj 1052 Tian Ji -- The Horse Racing
- HDOJ 1052 Tian Ji -- The Horse Racing 贪心
- HDOJ题目1052Tian Ji -- The Horse Racing(贪心)
- hdoj 1052Tian Ji -- The Horse Racing 【贪心】
- HDOJ 1052 Tian Ji -- The Horse Racing(贪心)
- hdoj 1052Tian Ji -- The Horse Racing【贪心算法】
- HDOJ 1052 Tian Ji -- The Horse Racing (贪心)
- HDOJ HDU 1052 Tian Ji -- The Horse Racing
- HDOJ--1052Tian Ji -- The Horse Racing 贪心!!!
- HDU 1052 Tian Ji -- The Horse Racing
- Android 悬浮窗
- Android SQLite操作
- android开发之自定义View 详解 资料整理 小冰原创整理,原创作品。
- 过滤器
- JAVA泛型一
- HDOJ 1052 Tian Ji -- The Horse Racing
- STL allocator的rebind接口的作用
- 两年嵌入式软件开发的工作感想
- eclipse-3.3.2在CentOS-5.4下启动时崩溃的解决方法
- ifconfig eth0 XXX 显示NO SUCH DEVICE
- JFinal 常见报错
- PAT乙级题目1002的构思和简单实践
- hdoj 简单计算器 1237 (栈模拟)
- HackerRank Self Balancing Tree(AVL树)