HDU 11150 Machine Schedule [二分图之求最小覆盖]
来源:互联网 发布:电气计算软件中文 编辑:程序博客网 时间:2024/06/05 19:31
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.
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.
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 100 1 11 1 22 1 33 1 44 2 15 2 26 2 37 2 48 3 39 4 30
Sample Output
3
题目大意:
有两台机器A和B以及N个需要运行的任务。每台机器有M种不同的模式,而每个任务都恰好在一台机器上运行。
如果它在机器A上运行,则机器A需要设置为模式xi,如果它在机器B上运行,则机器A需要设置为模式yi。
每台机器上的任务可以按照任意顺序执行,但是每台机器每转换一次模式需要重启一次。请合理为每个任务安排一台机器并合理安排顺序,使得机器重启次数尽量少。
算法思想:首先知道求的是最小覆盖数,对于匈牙利算法中: 最小顶点覆盖数 = 最大匹配数; 故直接求最大匹配数即可;
AC代码:
#include <bits/stdc++.h>using namespace std ;int vis[2000] , link[2000] , k , n , m , ma[2000][2000] ;int find(int x){for(int i = 0 ; i <=m;i++){if(ma[x][i]&&!vis[i]){vis[i] = 1 ;if(!link[i]||find(link[i])){link[i] = x ;return 1 ;}}}return 0 ;}int main(){while(cin>>n,n){cin>>m>>k;memset(vis,0,sizeof(vis));memset(link,0,sizeof(link));memset(ma,0,sizeof(ma));for(int i = 1 ; i<=k;i++){int a , b , t ;cin>>t>>a>>b;ma[a][b] = 1;}int ans = 0 ;for(int i = 1 ; i<=n;i++){memset(vis,0,sizeof(vis));if(find(i)) ans++;}cout<<ans<<endl;}}
0 0
- HDU 11150 Machine Schedule [二分图之求最小覆盖]
- poj 1325 Machine Schedule---二分图求最小顶点覆盖
- hdu 1150 Machine Schedule(二分图求最小点覆盖)
- hdu Machine Schedule(二分图的最小覆盖)
- Machine Schedule hdu 1150 二分图的最小点覆盖
- HDU 1150 Machine Schedule 二分图最小覆盖点
- HDU 1150 Machine Schedule 二分图最小覆盖点
- HDU-1150-Machine Schedule【最小点覆盖】【二分图匹配】
- HDU 1150 Machine Schedule (二分图最小点覆盖)
- [HDU]1150 Machine Schedule 二分图 + 最小点覆盖
- HDU 1150 Machine Schedule(最小点覆盖) 二分匹配
- hdu 1150 Machine Schedule(求最小点覆盖)
- 【二分图匹配(最小顶点覆盖)】hdu 1150 Machine Schedule(外:hdu 1054 Strategic Game)
- 杭电 hdu 1150 Machine Schedule (二分图最小覆盖)
- (step6.3.3)hdu 1150(Machine Schedule——二分图的最小点覆盖数)
- POJ 1325 Machine Schedule 二分图最小点覆盖
- 二分图最小覆盖点数(最大匹配):Machine Schedule
- HDU1150-- Machine Schedule( 二分图最小顶点覆盖)
- Linux文件操作总结
- PHP之Bool类型
- hdu5536(字典树的插入和删除)
- Mongodb 介绍
- Android应用学习记录------通讯录的增,删,改,查
- HDU 11150 Machine Schedule [二分图之求最小覆盖]
- MYeclipse中使用maven插件的时候,运行run as maven build的时候报错
- Markdown语法简介
- Android原型设计工具探索
- 1.实现一个函数,可以左旋字符串中的k个字符。 AABCD左旋一个字符得到ABCDA AABCD左旋两个字符得到BCDAA 2.判断一个字符串是否为另外一个字符串旋转之后的字符串。 例如:给定s1
- Java通过CMD命令启动和停止外部应用程序
- Python 类货币四舍五入规则
- android的软件盘的处理
- 转载z转载