Machine Schedule(二分图匹配--匈牙利算法)

Machine Schedule
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6733 Accepted Submission(s): 3375

Problem 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_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
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的N种模式作为二分图的左部，机器B的M种模式作为二分图的右部，如果某个任务可以使用机器A的模式xi也可以使用机器B的模式yi完成，则连接xi,yi。
题目要求使机器重启的次数要尽量少，又要把所有的任务都执行完，也就可以把题目转换成最小顶点覆盖，根据二分图的性质：最小顶点覆盖=最大匹配数。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n, m, k;
int ma[121][121];
int v[121];
int match[121];
bool dfs(int u)
{
    for(int i=1;i<=m;i++)
    {
        if(v[i]==0&&ma[u][i]==1)
        {
            v[i] = 1;
            if(match[i]==-1||dfs(match[i]))
            {
                match[i] = u;
                return true;
            }
        }
    }
    return false;
}
int g()
{
    int sum = 0;
    memset(match, -1, sizeof(match));
    for(int u=1;u<=n;u++)
    {
        memset(v, 0, sizeof(v));
        if(dfs(u))
            sum++;
    }
    return sum;
}
int main()
{
    while(cin>>n)
    {
        if(n==0)
            break;
        memset(ma, 0, sizeof(ma));
        cin>>m>>k;
        for(int j=0;j<k;j++)
        {
            int a, b, c;
            cin>>a>>b>>c;
            ma[b][c] = 1;
        }
        printf("%d\n", g());
    }
    return 0;
}