HUD1052 P2 1002 Tian Ji -- The Horse Racing

最新推荐文章于 2022-04-21 00:08:00 发布

Ychosen

最新推荐文章于 2022-04-21 00:08:00 发布

阅读量411

点赞数

分类专栏： ACM 文章标签： acm 算法贪心

本文链接：https://blog.csdn.net/u013159557/article/details/46227073

版权

ACM 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

田忌赛马

原问题

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.

提炼

田忌赛马问题的一般解, 第一行输入马数n, 第二行n个数据为田忌的马的速度, 第三行为国王的马的速度
赢一场+200, 输一场-200
输出最后田忌可以获得的钱数

解(C)

#include <stdio.h>
#include <string.h>
int tianH[1001];
int kingH[1001];
void quickSort(int a[], int begin, int end)
{
    if(begin < end)
    {
        int i = begin, j = end;
        int vot = a[i];
        while(i != j)
        {
            while(i < j && vot >= a[j])
                j--;
            if(i < j)
                a[i++] = a[j];
            while(i < j && a[i] >= vot)
                i++;
            if(i < j)
                a[j--] = a[i];
        }
        a[j] = vot;
        quickSort(a, begin, j - 1);
        quickSort(a, i + 1, end);
    }
}
int race(int tian[], int king[], int n)
{
    quickSort(tian, 0, n - 1);
    quickSort(king, 0, n - 1);
    int h1,h2,t1,t2;
    int w=0,l=0;
    h1 = 0, h2 = 0, t1 = n - 1, t2 = n - 1;

    for(int i = 0; i < n; i++)
    {
        if(tian[h1] > king[h2])
        {
            w++;
            h1++;
            h2++;
        }
        else
        {
            if(tian[t1] > king[t2])
            {
                w++;
                t1--;
                t2--;
            }
            else
            {
                if(!(tian[t1] == king[h2]))
                {
                    l++;
                    t1--;
                    h2++;
                }
            }
        }
    }
    return (w-l) * 200;
}

main()
{
    int n;
    while(scanf("%d", &n))
    {
        if(!n)
            break;
        int ans = 0;

        for(int i = 0; i < n; i++)
            scanf("%d", &tianH[i]);
        for(int i = 0; i < n; i++)
            scanf("%d", &kingH[i]);

        printf("%d\n", race(tianH, kingH, n));
    }
}