hdu1150(二分图最小顶点覆盖)

原创 2016年06月01日 17:51:33

Machine Schedule

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7792    Accepted Submission(s): 3895


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和B以及N个需要运行的任务。每台机器有M种不同的模式,而每个任务都恰好在一台机器上运行。如果它在机器A上运行,则机器A需要设置为模式xi,如果它在机器B上运行,则机器A需要设置为模式yi。每台机器上的任务可以按照任意顺序执行,但是每台机器每转换一次模式需要重启一次。请合理为每个任务安排一台机器并合理安排顺序,使得机器重启次数尽量少。

二分图的最小顶点覆盖数=最大匹配数

本题就是求最小顶点覆盖数的。


#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
const int N=555;///两边的最大数量
bool tu[N][N];
int from[N];///记录右边的点如果配对好了它来自哪里
bool use[N];///记录右边的点是否已经完成了配对
int n,m;///m,n分别表示两边的各自数量,n是左边,m是右边
bool dfs(int x)
{
    for(int i=1; i<=m; i++) ///m是右边,所以这里上界是m
        if(!use[i]&&tu[x][i])
        {
            use[i]=1;
            if(from[i]==-1||dfs(from[i]))
            {
                from[i]=x;
                return 1;
            }
        }
    return 0;
}
int hungary()
{
    int tot=0;
    memset(from,-1,sizeof(from));
    for(int i=1; i<=n; i++) ///n是左边,所以这里上界是n
    {
        memset(use,0,sizeof(use));
        if(dfs(i))
            tot++;
    }
    return tot;
}

int main()
{
    while(scanf("%d",&n)&&n)
    {
        int k;
        scanf("%d%d",&m,&k);
        memset(tu,0,sizeof(tu));
        while(k--)
        {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            tu[b][c]=1;
        }
        printf("%d\n",hungary());
    }
    return 0;
}


版权声明:本文为博主原创文章,若转载请注明转载地址http://blog.csdn.net/martinue。

UVA11889:Benefit(已知LCM和其中一个数,求另一个数)

Recently Yaghoub is playing a new trick to sell some more. When somebody gives him A Tomans, he who...

hdu4568(旅行商变形)

链接:点击打开链接 题意:有一个n*m的棋盘,每一个格子有一个值,代表经过这个格子的花费,给出k个宝藏点的坐标,求从棋盘的任意一个边进入棋盘,经过所有的宝藏点后在走出棋盘所需要的最小花费 代码: #i...

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

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

hdu 1150二分图最小顶点覆盖

题目大意: 有两台机器A和B以及N个需要运行的任务。每台机器有M种不同的模式,而每个任务都恰好在一台机器上运行。 如果它在机器A上运行,则机器A需要设置为模式xi,如果它在机器B上运行,则机器A需...
  • vsooda
  • vsooda
  • 2012年04月10日 22:46
  • 1426

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

简单的求二分图最大匹配的

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

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

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

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

HDU 1150 二分图最小点集覆盖

题意:有两台机器,第一台机器有n个模式,第二台机器有m个模式,有k个任务,一个任务可以在第一台机器下用u模式解决,也可以在第二台机器下用v模式解决。每转换一次模式,就要花费1,问最少花费。思路:就是用...
  • NMfloat
  • NMfloat
  • 2016年02月19日 16:27
  • 202

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

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

HDU-1150(求最小覆盖顶点数=二分最大匹配数)

关于这道题目,我也是迷迷糊糊的,上网找资料也是看不懂,,,,  到底 为什么最小覆盖顶点数=二分最大匹配数,自己也确实弄得不是很清楚,反正这个好像是前人已经证明了的,所以自己还是可以拿来用的, 至于...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu1150(二分图最小顶点覆盖)
举报原因:
原因补充:

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