【图算法之二分图】HDU 1150---Machine Schedule
来源:互联网 发布:js获取浏览器ip 编辑:程序博客网 时间:2024/05/16 09:57
Machine Schedule
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5782 Accepted Submission(s): 2908
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.
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#include<stdio.h>#include<string.h>int map[501][501],flag[501],pre[501],n;int get(int i){ int j,k,l; for(j=1;j<=n;j++) { if(map[i][j]&&flag[j]==0) { flag[j]=1; if(pre[j]==-1||get(pre[j])) { pre[j]=i; return 1; } } } return 0;}int main(){ int num,m,l,r,i,k; while(scanf("%d",&m),m) { memset(map,0,sizeof(map)); memset(pre,-1,sizeof(pre)); scanf("%d%d",&n,&num); for(i=0;i<num;i++) { scanf("%d%d%d",&k,&l,&r); map[l][r]=1; } int sum=0; for(int i=1;i<=m;i++) { memset(flag,0,sizeof(flag)); sum+=get(i); } printf("%d\n",sum); } return 0;}
0 0
- 【图算法之二分图】HDU 1150---Machine Schedule
- hdu Machine Schedule 1150 二分图匹配
- HDU 1150 Machine Schedule 二分图匹配
- HDU 1150 Machine Schedule(二分图匹配)
- HDU 11150 Machine Schedule [二分图之求最小覆盖]
- 【图算法之二分图】HDU1150---Machine Schedule
- Machine Schedule(二分图匹配--匈牙利算法)
- hdu 1150 || poj 1325 Machine Schedule (二分图匹配)
- Machine Schedule hdu 1150 二分图的最小点覆盖
- POJ-1325 && 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 1150 Machine Schedule(二分匹配,简单匈牙利算法)
- IOS-根据TableviewCell 总体高度 做自适应
- 最短路径
- HDU 2063 过山车
- spring mvc 文件上传
- HDU1528_Card Game Cheater(二分图/最大匹配)
- 【图算法之二分图】HDU 1150---Machine Schedule
- UIViewController生命周期
- Trie树(模糊匹配)poj1816
- pat gee 2013-10-7 a,b and c(64bit)
- 盒子游戏
- UILite-MFC/WTL/DirectUI界面库
- NYOJ 题目91 阶乘之和(贪心)
- Dividing (HDU 1059) —— 多重背包
- ssh配置的数据库连接不上