Tian Ji -- The Horse Racing(田忌赛马)

原创 2016年08月29日 17:11:22

Tian Ji -- The Horse Racing

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5595 Accepted Submission(s): 1337
 
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.
 
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
 

思路:

田忌赛马的道理大家都懂,尽可能多的赢比赛局数,那么我们就要考虑最优情况!

分为三种情况:

1、田忌的马优于国王的马

2、田忌的马劣于国王的马

3、田忌的马和国王马一样

具体情况看代码及注解。


AC代码:

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define Pai 3.1415926

int main()
{
	int tol,i,j,tian[1100],king[1100],sum;
	while(~scanf("%d",&tol))
	{
		sum=0;
		if(tol==0)
			break;
		for(i=0;i<tol;i++)
			scanf("%d",&tian[i]);
		for(i=0;i<tol;i++)
			scanf("%d",&king[i]);
		sort(tian,tian+tol);
		sort(king,king+tol);//从小到大排序
		for(i=0;i<tol;i++)
		{
			if(tian[i]>king[i])//第一种情况,田忌的马比国王的马要优等
			{
				sum++;//赢一局
			}
			else if(tian[i]<king[i])//第二种情况,田忌的马比国王的马要劣等
			{
				sum--;//因为已排好序,比国王最劣等的马还要差,这一匹马去比赛肯定是要输掉的,就拿这匹马和国王最好的马比赛
				for(j=tol-1;j>i;j--)//移掉国王最好的一匹马
					king[j]=king[j-1];
			}
			else if(tian[i]==king[i])//第三种情况,田忌的马和国王的马一样
			{//此时需倒着比较最好的马
				if(tian[tol-1]>king[tol-1])//若最好的马优于国王的马
				{
					sum++;//赢一局
					for(j=tol-1;j>i;j--)
					{
						tian[j]=tian[j-1];
						king[j]=king[j-1];
					}
				}
				else if(tian[tol-1]<king[tol-1])//若最好的马劣于国王的马
				{
					sum--;//国王这批最好的马必赢,输一局先,拿最差的那匹马去比
					for(j=tol-1;j>i;j--)
					{
						king[j]=king[j-1];
					}
				}
				else if(tian[tol-1]==king[tol-1])//若相等
				{
					if(tian[i]<king[tol-1])//看田忌最差的马和国王最好的马,想等就平局,要劣势就先拿这匹马输一局
					{
						sum--;
						for(j=tol-1;j>i;j--)
						{
							king[j]=king[j-1];
						}
					}
				}
			}
		}
		printf("%d\n",sum*200);
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU 1052田忌赛马 Tian Ji -- The Horse Racing

Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (...
  • sizaif
  • sizaif
  • 2017年05月17日 13:17
  • 111

ACM--田忌赛马--贪心--HDOJ 1052--Tian Ji -- The Horse Racing

HDOJ题目地址:传送门 Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others)    Memory Li...

田忌赛马(Tian Ji -- The Horse Racing)中的动态规划以及贪心算法

这两天碰到一道看似很简单,但是实际做起来确实比较难的问题,在这里分析讨论一下。 题目:http://acm.hdu.edu.cn/showproblem.php?pid=1052 Tian...
  • pi9nc
  • pi9nc
  • 2012年11月02日 20:53
  • 1428

田忌赛马Tian Ji -- The Horse Racing(hdu 1052)

刚开始用二分图的最大匹配,超时了。 二分图最大分配代码: #include #include   int n; int tian[1005],king[1005]; int path[1...

hdu1052 Tian Ji -- The Horse Racing (贪心,田忌赛马)

Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (...

【贪心】[hdu1052]Tian Ji -- The Horse Racing(田忌赛马)[c++]

Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 ...
  • MIECZ
  • MIECZ
  • 2017年03月06日 18:24
  • 121

【贪心专题】HDU 1052 Tian Ji -- The Horse Racing (田忌赛马)

链接:click here~~ 题意: 田忌和齐王各有N匹马,判断怎样比赛,使田忌净胜场数最多。 之前无意看到强哥写的题解(很早就做了~~囧)感觉很有意思,但是当时忘了去A 了,现在回想起来...

LA 3266&HDU 1052 Tian Ji -- The Horse Racing(田忌赛马,贪心)

Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (...

1052 Tian Ji -- The Horse Racing 田忌赛马 贪心算法

Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768...
  • Jolesen
  • Jolesen
  • 2016年12月15日 09:44
  • 199

HDU1052 Tian Ji -- The Horse Racing 田忌赛马 贪心

田忌赛马 贪心算法 Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Tian Ji -- The Horse Racing(田忌赛马)
举报原因:
原因补充:

(最多只允许输入30个字)