UVALive 3266 Tian Ji -- The Horse Racing
2015-08-10 10:31
309 查看
分析
贪心,以最大的收益(最小的费用,即两匹马速度的差)与齐王赛马。思路
如果 当田忌最慢的马比齐王最慢的马快,赢。 否则 如果 当田忌最快的马比齐王最快的马快,赢。 否则 如果 当田忌最慢的马比齐王最快的马慢,输。 否则 田忌最慢的马与齐王最快的马速度相同,平。
代码
#include <cstdio> #include <algorithm> #define MAX_N 1005 using std::sort; int N, T[MAX_N], K[MAX_N]; void solve() { sort(T, T+N); sort(K, K+N); int a1 = 0, a2 = N-1, b1 = 0, b2 = N-1, M = 0; for (int i = 0; i < N; i++) if (T[a1] > K[b1]) { a1++; b1++; M += 1; } else if (T[a2] > K[b2]) { a2--; b2--; M += 1; } else if (T[a1] < K[b2]) { a1++; b2--; M -= 1; } else { a1++; b2--; } printf("%d\n", 200*M); } 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]); solve(); } return 0; }
题目
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.
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≤ \le1000) 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
相关文章推荐
- 使用Log Analyzer分析性能瓶颈
- 4.2 设计具有背景图的按钮---ImageButton的焦点以及事件的处理
- C++/C语言_宏函数存在的问题
- git的基本使用
- IoC/DI,控制反转和依赖注入
- 理解Java抽象类和接口区别与联系
- 前段-页面优化方法1
- Mantis、Testlink从Windows移植到Ubuntu系统
- Autojump:一个可以在 Linux 文件系统快速导航的高级 cd 命令
- 密码重置测试流程
- eclipse android 设置及修改生成apk的签名文件
- 基本固件框架的追踪研读之USB控制传输
- dmp dump文件的代码生产
- 9秒学院Cocos2d-X学习之动作特效介绍
- oracle转mysql
- 【iOS-Android开发对比】 之 APP入口
- HDU 3496(Watch The Movie)二维费用背包
- Leetcode58 Length of Last Word
- iOS6的旋屏控制技巧
- POJ 1088 滑雪