Tian Ji -- The Horse Racing
Tian Ji -- The Horse Racing
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 19 Accepted Submission(s) : 5
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
"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
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
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
题意:
田忌赛马的故事大家都知道吧,现在你要做的工作就是,计算田忌能赚多少钱,赢一场200,平一场0,负一场-200.
分析:
这是一道贪心算法题。
要用田忌快的马去跟国王的马比。
一步一步实现。
注意:
Solution:这题有多种解体思路,DP,二分图最大匹配算法等,这里给出的是比较容易理解的贪心算法
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int t[3001],k[3001];
int main(){
int n,i,j,a,b,w;
while(scanf("%d",&n),n){
for(i=0;i<n;i++)
scanf("%d",&t[i]);
for(i=0;i<n;i++)
scanf("%d",&k[i]);
w=0;
sort(t,t+n);
sort(k,k+n);//sort的默认排列顺序是升序。
for(i=0,j=n-1,a=0,b=n-1;a<=b&&i<=j;)//从两头逼近,两边同时缩小范围
{ if(t[i]>k[a])//最慢的跟最慢的比,如果快就sum++
{
i++;
a++;
sum++;
}
else if(t[i]<k[a])//再比倒数第二组,如果田忌的马还是慢的话,
{
i++;
b--;
sum--;
}
else if(t[j]>k[b])//快的跟快的比
{
j--;
b--;
sum++;
}
else if(t[j]<k[b])
{
i++;
b--;
sum--;
}
else if(t[i]<k[b])
{
i++;
b--;
sum--;
}
else
{
i++;
b--;
}
}
printf("%d\n",sum*200);
}
return 0;
}
未完待续,DP,二分图最大匹配算法。
Tian Ji -- The Horse Racing的更多相关文章
- Hdu 1052 Tian Ji -- The Horse Racing
Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (J ...
- UVA 1344 Tian Ji -- The Horse Racing
Tian Ji -- The Horse Racing Here is a famous story in Chinese history. That was about 2300 years ago ...
- hdoj 1052 Tian Ji -- The Horse Racing【田忌赛马】 【贪心】
思路:先按从小到大排序, 然后从最快的開始比(如果i, j 是最慢的一端, flag1, flag2是最快的一端 ),田的最快的大于king的 则比較,如果等于然后推断,有三种情况: 一:大于则比較, ...
- hdu1052 Tian Ji -- The Horse Racing 馋
转载请注明出处:http://blog.csdn.net/u012860063 题目链接:pid=1052">http://acm.hdu.edu.cn/showproblem.php ...
- 杭州电 1052 Tian Ji -- The Horse Racing(贪婪)
http://acm.hdu.edu.cn/showproblem.php? pid=1052 Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS ...
- 【贪心】[hdu1052]Tian Ji -- The Horse Racing(田忌赛马)[c++]
Tian Ji -- The Horse Racing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java ...
- 【OpenJ_Bailian - 2287】Tian Ji -- The Horse Racing (贪心)
Tian Ji -- The Horse Racing 田忌赛马,还是English,要不是看题目,我都被原题整懵了,直接上Chinese吧 Descriptions: 田忌和齐王赛马,他们各有n匹马 ...
- Tian Ji -- The Horse Racing HDU - 1052
Tian Ji -- The Horse Racing HDU - 1052 (有平局的田忌赛马,田忌赢一次得200块,输一次输掉200块,平局不得钱不输钱,要使得田忌得到最多(如果只能输就输的最少) ...
- ZOJ 2397:Tian Ji -- The Horse Racing
Tian Ji -- The Horse Racing Time Limit: 5 Seconds Memory Limit: 32768 KB Here is a famous story ...
随机推荐
- 使用 StoryBoard 的时候加入用户引导页面
如果想让一个APP加上引导页面是一个非常完美的举动 但是,总会遇到一些问题 (不要忘记在APDelegate里面加上用户引导页面的头文件和程序启动时的第一个页面哦) 情况一:纯代码 判断是否是第一次启 ...
- EF如何正确的进行实体中修改
本文转载:http://www.cnblogs.com/Ruiky/archive/2012/12/29/2839011.html 不推荐方式一: 思路:先从ObjectContext取出实体,然后将 ...
- CocoaPods使用命令
5.需要在工程中创建一个Podfile文件, 使用命令: $cd /Users/shiyunlei/Desktop/CocoapodsSample(进入工程目录,cd后面的是工程的路径) $ touc ...
- poj 1147 Binary codes
Binary codes Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5647 Accepted: 2201 Desc ...
- [Bootstrap] 8. 'Collapse', data-target, data-toggle & data-parent
Using Bootstrap JavaScript Plugins If we want to add behavior to our website, which of the following ...
- java_jdbc_spring框架查询操作简例
1.添加commons-dbcp-1.4,commons-logging,commons-pool-1.2//线程池,commons.collections-3.2.1.jar,spring.jar ...
- multithread synchronization use mutex and semaphore
#include <malloc.h> #include <pthread.h> #include <semaphore.h> struct job { /* Li ...
- 关于SWT中的Combo类和List类
Combo类的谱系图: 一个Combo类的实例: Combo1.java public class Combo1 { public static void main(String[] args) { ...
- 关于Spring中AOP的理解
AOP简介[理解][重点] 1.AOP(Aspect Oriented Programing)面向切面/方面编程 2.AOP隶属软件工程的范畴,指导开发人员如何制作开发软件,进行结构设计 3.AOP联 ...
- matlab——sparse函数和full函数(稀疏矩阵和非稀疏矩阵转换)
函数功能:生成稀疏矩阵 使用方法 :S = sparse(A) 将矩阵A转化为稀疏矩阵形式,即矩阵A中任何0元素被去除,非零元素及其下标组成矩阵S.如果A本身是稀疏的,sparse(S)返回S. S ...