【二分图匹配入门专题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;
}



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

二分图中对最小顶点覆盖、最小边覆盖、最大独立集的理解

仅仅用于自己理解,若有共鸣,别太吐槽就行哈~ 首先是匈牙利算法的本质:(图参考了zxy的) 这个图要详细看完,那么刚开始我想的“找小三”实际上就是递归找增广路的过程,如果找到增广路,匹配数...
  • Flynn_curry
  • Flynn_curry
  • 2016年10月29日 20:01
  • 2450

二分图最大匹配,最小路径覆盖,最小点覆盖,最大独立集,最小边覆盖与建图方法

前言:         有自己写的,有摘的别人的,前面是摘的,也是无心整理,出错是难免的,反正我都不会证明,智人见智,别被我误导了。 §1图论点、边集和二分图的相关概念和性质 点覆盖、最小点覆盖...
  • hitwhacmer1
  • hitwhacmer1
  • 2015年07月02日 01:10
  • 2721

HDU1150/POJ1325_Machine Schedule(二分图/最小点覆盖=最大匹配)

解题报告 题目传送门 题意: A机器有n个模式,B机器有m个模式,每个作业可以在任何机器的特定模式下工作,转换模式需要耗时,求最小耗时 思路: 把AB两机器的模式当成二分图顶点,模式之间的连线就是某个...
  • u013320038
  • u013320038
  • 2014年07月26日 17:11
  • 1063

HDU 1150 Machine Schedule(匈牙利算法 二分图的最小顶点覆盖 二分图最大匹配)

简单的求二分图最大匹配的
  • desire_ing
  • desire_ing
  • 2014年07月28日 21:55
  • 444

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

当做模板来用吧.. #include #include int n1,n2,m,ans; int result[1005]; int state[1005]; int maps[1005][100...
  • love_clanguage
  • love_clanguage
  • 2012年08月18日 20:08
  • 662

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

Problem Description As we all know, machine scheduling is a very classical problem in computer scie...
  • u010372095
  • u010372095
  • 2014年07月28日 14:51
  • 643

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

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

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

Machine Schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...
  • long71751380
  • long71751380
  • 2013年09月01日 16:21
  • 727

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

C - Machine Schedule Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u S...
  • zp___waj
  • zp___waj
  • 2015年11月17日 12:04
  • 265

HDU1150/POJ1325_Machine Schedule(二分图/最小点覆盖=最大匹配)

解题报告 题目传送门 题意: A机器有n个模式,B机器有m个模式,每个作业可以在任何机器的特定模式下工作,转换模式需要耗时,求最小耗时 思路: 把AB两机器的模式当成二分图顶点,模式之间的连线就是某个...
  • u013320038
  • u013320038
  • 2014年07月26日 17:11
  • 1063
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:【二分图匹配入门专题1】C - Machine Schedule hdu1150 【最小顶点覆盖】
举报原因:
原因补充:

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