HDU 1052 Tian Ji -- The Horse Racing
来源:互联网 发布:以是知公子恨之复返也 编辑:程序博客网 时间:2024/05/16 09:26
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1052
Tian Ji -- The Horse Racing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26864 Accepted Submission(s): 7937
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
Source
2004 Asia Regional Shanghai
Recommend
JGShining
思路:田忌赛马的策略就是自己强大的如果大于国王强大的,就拿强大的比强大的;不敌的话,就拿弱小的来消耗国王强大的;平手的话,就比较弱小的,自己弱小的大于国王弱小的,就拿弱小的比弱小的,否则就判断自己弱小的是否不敌国王强大的,不敌的话,就消耗国王最强的,否则就直接结束,因为再比下去也全部都是平局了。详见代码。
附上AC代码:
#include <bits/stdc++.h>using namespace std;const int maxn = 1005;int t[maxn], k[maxn];int n;int main(){while (~scanf("%d", &n) && n){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, greater<int>());sort(k, k+n, greater<int>());int tl=0, tr=n-1;int kl=0, kr=n-1;int ans = 0;for (int i=0; i<n; ++i){if (t[tl] > k[kl])++ans, ++tl, ++kl;else if (t[tl] < k[kl])--ans, --tr, ++kl;else{if (t[tr] > k[kr])++ans, --tr, --kr;else if (t[tr] < k[kl])--ans, --tr, ++kl;elsebreak;}}printf("%d\n", ans*200);}return 0;}
1 0
- 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
- 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
- HDU 1052 Tian Ji -- The Horse Racing
- hdu 1052 Tian Ji -- The Horse Racing
- HDU 1052 Tian Ji -- The Horse Racing
- hdu-1052Tian Ji -- The Horse Racing
- HDU - 1052 Tian Ji -- The Horse Racing
- hdu-1052-Tian Ji -- The Horse Racing
- 对象的序列化和反序列化---使用Serializable接口
- scala进阶14-自身类型self type
- 蚁群算法
- log4j.properties配置详解
- resolve in ui-router
- HDU 1052 Tian Ji -- The Horse Racing
- 遗传算法
- Java常量和变量及数据类型
- python学习笔记二(pandas基础)
- 序列化与反序列化
- log4j.properties
- CICD—版本管理 Git
- 中文分词--逆向最大匹配
- 计算N的阶乘结果末尾含多少个零