【二分图匹配入门专题1】C - Machine Schedule hdu1150 【最小顶点覆盖】

原创 2017年08月13日 06:06:27
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. 

InputThe 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. 
OutputThe 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
题意:输入三个数,n,m,k,再输入k行数,每行输入三个数i,x,y。问,使x,y连通的最小顶点覆盖
思路:用一次最大匹配的模板就好啦。
一大早wwrong两发来迎接我真是醉了
#include<stdio.h>
#include<string.h>
#define N 110
int n,m,k;
int book[N],e[N][N],match[N];

int dfs(int u)
{
    int i;
    for(i = 1; i <= m; i ++)
    {
        if(!book[i]&&e[u][i])
        {
            book[i] = 1;
            if(!match[i]||dfs(match[i]))
            {//printf("i=%d u=%d \n",i,u);
                match[i] = u;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    int i,j,t1,t2,t3,sum;
    while(scanf("%d",&n),n!=0)
    {
        memset(e,0,sizeof(e));
        memset(match,0,sizeof(match));
        scanf("%d%d",&m,&k);
        for(i = 0; i < k; i ++)
        {
            scanf("%d%d%d",&t1,&t2,&t3);
            e[t2][t3] = 1;
        }
        sum = 0;
        for(i = 1; i <= n; i ++)
        {
            memset(book,0,sizeof(book));
            if(dfs(i))
            {
                sum ++;//printf("sum=%d\n",sum);
            }
                
        }
        printf("%d\n",sum);
    }
    return 0;
}



                    
版权声明:转载的时候给我说一声哦~~~

相关文章推荐

HDU1150-- Machine Schedule( 二分图最小顶点覆盖)

当做模板来用吧.. #include #include int n1,n2,m,ans; int result[1005]; int state[1005]; int maps[1005][100...

hdu1150Machine Schedule (二分匹配,最小顶点覆盖)

Problem Description As we all know, machine scheduling is a very classical problem in computer scie...

杭电 hdu 1150 Machine Schedule (二分图最小覆盖)

附上大牛的地址,这篇文章写得很好,代码有高亮,有注释,一目了然…… http://www.cnblogs.com/183zyz/archive/2011/03/21/1990598.html ...

HDU 1150 Machine Schedule (匈牙利算法 最小顶点覆盖= 最大匹配数)

Machine Schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...

HDU 1150 Machine Schedule 二分图最小覆盖点

C - Machine Schedule Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u S...

Machine Schedule HDoj (二分图最小顶点覆盖--最大匹配数)

Machine Schedule Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...

POJ-1325 && HDU-1150 Machine Schedule 二分图匹配

#include #include #include #include #include #include #include using namespace std; int map[1...

hdu 1150 Machine Schedule【最小顶点覆盖】

Machine Schedule Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Othe...

HDU 1150 Machine Schedule 最小顶点覆盖

Machine Schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)...

HDU 1150 Machine Schedule【最小顶点覆盖】

Machine Schedule Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:【二分图匹配入门专题1】C - Machine Schedule hdu1150 【最小顶点覆盖】
举报原因:
原因补充:

(最多只允许输入30个字)