Machine Schedule
来源:互联网 发布:ipad矢量图软件 编辑:程序博客网 时间:2024/06/05 20:47
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。每台机器上的任务可以按照任意顺序执行,但是每台机器每转换一次模式需要重启一次。请合理为每个任务安排一台机器并合理安排顺序,使得机器重启次数尽量少。
其实就是求最小顶点覆盖数
//先贪心,加入贪心之后未找到未匹配点,则说明已经是最优的,否则则从贪心的基础上DFS进行更新#include<iostream>#include<stdio.h>#include<string.h>#include<stdlib.h>using namespace std;int n,m;int map[1100][1100];int flag[1100];//y节点标记int vist[1100];//与Y节点相交的x节点void init(){ memset(map,0,sizeof(map)); memset(vist,-1,sizeof(vist));}int find(int i){ int j; for(j=1; j<=m; j++) { if(map[i][j]&&!flag[j]) { flag[j]=1; if(vist[j]==-1||find(vist[j])) { vist[j]=i; return 1; } } } return 0;}int main(){ int i,j,k; int x,y,a; int count; while(~scanf("%d",&n)&&n) { init(); scanf("%d%d",&m,&k); for(i=0; i<k; i++) { scanf("%d%d%d",&a,&x,&y); map[x][y]=1; } count=0; for(i=1; i<=n; i++) { memset(flag,0,sizeof(flag)); if(find(i)) count++; } printf("%d\n",count);//二分图最大独立集=顶点数-二分图最大匹配 } return 0;}
0 0
- Machine Schedule
- Machine Schedule
- Machine Schedule
- Machine Schedule
- Machine Schedule
- Machine Schedule
- Machine Schedule
- pku1325 Machine Schedule
- PKU 1325 Machine Schedule
- 1325 Machine Schedule //MaxMatch
- POJ 1325 Machine Schedule
- HDOJ 1150 Machine Schedule
- POJ 1325 Machine Schedule
- Machine Schedule (P1325)
- POJ 1325 Machine Schedule
- poj 1325 Machine Schedule
- hdoj 1150 Machine Schedule
- Poj 1325 Machine Schedule
- VMware centos系统联网解决方案
- 2014年最酷的30个JavaScript库
- Winform窗口弹出位置控制
- cgi
- Java线程(二):线程同步synchronized和volatile
- Machine Schedule
- Java线程(一):线程安全与不安全
- TextView显示系统时间(秒针变化)
- ios与js交互,获取webview完整url,title,获取元素并赋值跳转
- 『IOS』ios nil、NULL和NSNull 的使用
- 指针函数与函数指针的区别
- [Coursera][Stanford] Machine Learning Week 3
- POJ 2186 Popular Cows(强连通分量)
- 仔细确认当前this对象是否是你所想指定的元素