hdoj 1150 Machine Schedule【匈牙利算法+最小顶点覆盖】
2015-07-20 21:22
316 查看
Machine Schedule
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6701 Accepted Submission(s): 3358
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
The output should be one integer per line, which means the minimal times of restarting machine.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
3
最大匹配数:在所有的顶点都两两被不重复的线连接起来时的边数
最小顶点覆盖==最大匹配数
二分图求最小顶点覆盖:即用最少的顶点个数可以让每条边至少与其中一个点关联
#include<stdio.h> #include<string.h> #define MAX 1100 int map[MAX][MAX],vis[MAX],mode[MAX]; int t,n,m; int find(int x) { int i,j; for(i=0;i<m;i++) { if(map[x][i]&&vis[i]==0) { vis[i]=1; if(mode[i]==0||find(mode[i])) { mode[i]=x; return 1; } } } return 0; } int main() { int j,i,s,k; int x,y; while(scanf("%d",&n),n) { memset(map,0,sizeof(map)); memset(mode,0,sizeof(mode)); scanf("%d%d",&m,&k); while(k--) { scanf("%d%d%d",&t,&x,&y); if(x&&y) map[x][y]=1; } s=0; for(i=0;i<n;i++) { memset(vis,0,sizeof(vis)); if(find(i)) s++; } printf("%d\n",s); } return 0; }
相关文章推荐
- C关键字和关键语句
- hd-1089:A+B for Input-Output Practice (I)
- 技术框架集合
- MyBatis 相关下载
- 自己总结的 Makefile 小模板
- C#之Lamba表达式
- H5开发小技巧二、性能优化
- ARC (Automatic Reference Counting)
- Git之分支创建策略
- 关于const 作用和用法 C++ const 的全面总结
- Windows 代码实现关机(直接黑屏)
- 批量Shink所有日志或数据文件
- CentOS 6使用openssl搭建根CA
- 深度优先搜索的实现及本质
- HDUOJ1092
- ios修改根视图控制器
- AOJ AHU 173编辑距离
- 【Spark Core】从作业提交到任务调度完整生命周期浅析
- 积分赚取太麻烦了
- polipo代理服务器简介