Machine Schedule POJ - 1325 二分匹配最小点覆盖数

最新推荐文章于 2021-03-18 22:30:38 发布

Cworld2017

最新推荐文章于 2021-03-18 22:30:38 发布

阅读量250

点赞数

本文链接：https://blog.csdn.net/Cworld2017/article/details/82180352

版权

As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that must be satisfied and the type of schedule desired. Here we consider a 2-machine scheduling problem.

There are two machines A and B. Machine A has n kinds of working modes, which is called mode_0, mode_1, ..., mode_n-1, likewise machine B has m kinds of working modes, mode_0, mode_1, ... , mode_m-1. At the beginning they are both work at mode_0.

For k jobs given, each of them can be processed in either one of the two machines in particular mode. For example, job 0 can either be processed in machine A at mode_3 or in machine B at mode_4, job 1 can either be processed in machine A at mode_2 or in machine B at mode_4, and so on. Thus, for job i, the constraint can be represent as a triple (i, x, y), which means it can be processed either in machine A at mode_x, or in machine B at mode_y.

Obviously, to accomplish all the jobs, we need to change the machine's working mode from time to time, but unfortunately, the machine's working mode can only be changed by restarting it manually. By changing the sequence of the jobs and assigning each job to a suitable machine, please write a program to minimize the times of restarting machines.

Input

The input file for this program consists of several configurations. The first line of one configuration contains three positive integers: n, m (n, m < 100) and k (k < 1000). The following k lines give the constrains of the k jobs, each line is a triple: i, x, y.

The input will be terminated by a line containing a single zero.

Output

The output should be one integer per line, which means the minimal times of restarting machine.

Sample Input

两个机器A，B分别有n，m中工作模式，刚开始都处于模式0，现在有k个工作

对于输入i,x,y表示工作i只有A的模式x或B的模式y能完成

问要将所有的工作完成需要A,B改变几次工作模式

将x，y连接为线，其实每个工作就是一条线，那么我们

需要求出选出最少的点，覆盖了所有的边，改题就是最小点覆盖

#include<cstdio>
#include<cstring>
using namespace std;
int k,m,n;
bool llink[2550][2550];
int girl[2550];int used[2550];
bool find(int x)
{
    int j;
    for(j=1;j<m;j++)//m为女
    {
        if(llink[x][j]==true&&used[j]==0)//
        {
            used[j]=1;
            if(girl[j]==0||find(girl[j]))//如果girl[j]已有partner了，就判断girl[j]的partner能否换一个女伴
            {
                girl[j]=x;
                return true;
            }
        }
    }
    return false;
}
 int main()
{
    while(~scanf("%d",&n)&&n)
    {
        scanf("%d%d",&m,&k);
        memset(llink,0,sizeof llink);
        while(k--)
        {
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            llink[y][z]=1;
        }
        int sum=0;
        memset(girl,0,sizeof girl);
        for(int j=1;j<n;j++)//刚开始的模式就是0，所以要从模式1开始
        {
            memset(used,0,sizeof(used));
            if(find(j))
                sum++;
        }
        printf("%d\n",sum);
    }
}