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

72人阅读 评论(0)

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

#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;
}

0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：8347次
• 积分：1486
• 等级：
• 排名：千里之外
• 原创：144篇
• 转载：3篇
• 译文：0篇
• 评论：11条
阅读排行
最新评论