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

最新推荐文章于 2022-12-03 19:48:18 发布

Menglei Min

最新推荐文章于 2022-12-03 19:48:18 发布

阅读量956

点赞数

分类专栏：基本算法-贪心文章标签： HDU

本文链接：https://blog.csdn.net/Hush_lei/article/details/38505447

版权

基本算法-贪心专栏收录该内容

5 篇文章 0 订阅

订阅专栏

[BestCoder Round #5]冠军的奖励是小米3手机一部
恭喜福州大学杨楠获得[BestCoder Round #4]冠军（iPad Mini一部）
《BestCoder用户手册》下载

Tian Ji -- The Horse Racing

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18136 Accepted Submission(s): 5273

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

Sample Output

Source

2004 Asia Regional Shanghai

Recommend

JGShining

题目大意：

田忌赛马，输出赢得的最多的金币。

解题思路：

一：当田忌最快的马比国王最快的马快，直接比赛，赢一场；

二：当田忌最快的马比国王最快的马慢，则用田忌最慢的马去浪费国王最快的马，输一场；

三：当两个最快的马一样快时：

1：:如果田忌最慢的马比国王最慢的马快，则用田忌的最慢的马和国王最慢的马比赛，赢一场。

2：若田忌最慢的比国王最慢的马慢，则用田忌最慢的去浪费国王最快的马，输一场。

3：若田忌和国王最慢的马速度一样，且田忌最慢的马的速度比国王最快的马的速度慢，就用田忌最慢的马去浪费国王的最快的马，输一场。

（一直尽量保留快的马在场上，如果田忌最慢的马的速度与国王最快的马速度相等，则说明在场还未比赛的马的所有速度相等，则直接退出，输赢不加不减。）

代码：

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;

int n;
vector<int> vt,vk;

void input(){
    int speed;
    for(int i=0;i<n;i++){
        scanf("%d",&speed);
        vt.push_back(speed);
    }
    for(int i=0;i<n;i++){
        scanf("%d",&speed);
        vk.push_back(speed);
    }
    sort(vt.begin(),vt.end());
    sort(vk.begin(),vk.end());
}

void solve(){
    int win=0;
    for(int i=0;i<n;i++){
        if(vt.back()>vk.back()){
            vt.pop_back();vk.pop_back();
            win++;
            continue;
        }
        if(vt.back()<vk.back()){
            vt.erase(vt.begin());vk.pop_back();
            win--;
            continue;
        }
        if(vt.back()==vk.back()){
            if(vt.front()>vk.front()){
                vt.erase(vt.begin());vk.erase(vk.begin());
                win++;
            }
            else {
                    if(vt.front()<vk.back()){
                        vt.erase(vt.begin());vk.pop_back();
                        win--;
                    }
            }
        }
    }
    printf("%d\n",200*win);
}

int main(){
    while(scanf("%d",&n)!=EOF&&n){
        vt.clear();
        vk.clear();
        input();
        solve();
    }
    return 0;
}