D - Machine Schedule

D - Machine Schedule

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status

Description

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₀ , mode₁ , ... , mode_n-1 , likewise machine B has m kinds of working modes, mode₀ , mode₁ , ... , mode_m-1 . At the beginning they are both work at mode₀ .

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₃ or in machine B at mode₄ , job 1 can either be processed in machine A at mode₂ or in machine B atmode₄ , 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 Aat 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

5 5 10
0 1 1
1 1 2
2 1 3
3 1 4
4 2 1
5 2 2
6 2 3
7 2 4
8 3 3
9 4 3
0

Sample Output

3

题意是告诉你有两台机器A,B，A机器有0~n-1种模式，B机器有0~m-1种模式，然后告诉你有N个零件，对于 i,x,y表示i零件可以由A的x模式或者B的y模式来完成，对于每台机器来说如果要切换模式则需要一个花费，你可以任意选择零件的加工先后和机器使用，问你最小花费为多少。

其实我们可以注意到花费和零件根本都没有任何关系，实际上这个问题可以等价于在x,y之间连一条边，然后求最小点覆盖（最大二分匹配），使用匈牙利算法即可。

需要注意的是，因为两台机器的初始模式为0，所以如果x,y其中一个为0那么实际上是可以当成不存在的，不需要加入边。

#include"iostream"
#include"cstring"
#include"cstdio"

using namespace std;

bool line[105][105];
bool vis[105];
int link[105];
int n,m,k;

int find(int x)
{
    int i,j;
    for(i = 0;i < m;i++)
    {
        if(line[x][i] && !vis[i])
        {
            vis[i] = true;
            if(link[i] == -1 || find(link[i]))
            {
                link[i] = x;
                return true;
            }
        }
    }
    return false;
}

int main(void)
{
    while(~scanf("%d",&n) && n)
    {
        scanf("%d%d",&m,&k);
        memset(line,false,sizeof(line));
        while(k--)
        {
            int i,x,y;
            scanf("%d%d%d",&i,&x,&y);
            if(x > 0 && y > 0)
            {
                line[x][y] = true;
            }
        }
        int ans = 0;
        memset(link,-1,sizeof(link));
        for(int i = 0;i < n;i++)
        {
            memset(vis,false,sizeof(vis));
            if(find(i)) ans ++;
        }
        printf("%d\n",ans);
    }
    return 0;
}