hdu1150—Machine Schedule(最小点覆盖)
来源:互联网 发布:大数据接入dpi 编辑:程序博客网 时间:2024/06/06 07:23
传送门:点我
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<bits/stdc++.h>using namespace std;#define N 105vector<int>q[N];int match[N];bool vis[N];bool hungary(int u){ int i; for(i=0; i<q[u].size(); i++) { int v=q[u][i]; if(!vis[v]) { vis[v]=1; if(!match[v]||hungary(match[v])) { match[v]=u; return 1; } } } return 0;}int main(){ int n,m,i,k; while(scanf("%d",&n),n) { scanf("%d%d",&m,&k); for(i=1; i<=n; i++) q[i].clear(); int a,b; while(k--) { scanf("%d%d%d",&i,&a,&b); q[a].push_back(b); } memset(match,0,sizeof(match)); int ans=0; for(i=1; i<=n; i++) { memset(vis,0,sizeof(vis)); ans+=hungary(i); } printf("%d\n",ans); } return 0;}
阅读全文
0 0
- HDU1150:Machine Schedule(最小点覆盖)
- hdu1150—Machine Schedule(最小点覆盖)
- hdu1150 Machine Schedule 最小点覆盖
- hdu1150 Machine Schedule(最小点覆盖)
- hdu1150 Machine Schedule 最小点覆盖
- HDU1150 Machine Schedule(最小顶点覆盖)
- 【hdu1150】【Machine Schedule】二分图最小点覆盖+简单感性证明
- Machine Schedule(最小点覆盖数)
- Machine Schedule--------最小点覆盖
- HDU1150-- Machine Schedule( 二分图最小顶点覆盖)
- hdu1150 Machine Schedule (二分图的最小顶点覆盖)
- hdu1150 最小点覆盖
- HDU1150最小点覆盖
- hdu1150——最小点覆盖
- HDU1150 (最小点集覆盖)
- Machine Schedule(最小覆盖)
- POJ 1325 Machine Schedule(匈牙利—最小点覆盖)
- HDU 1150 Machine Schedule(最小点覆盖问题)
- uCOS-II系统中的任务
- python 列表
- spoon连接资源库的一些问题
- 程序员必须掌握的8大排序算法(四):堆排序
- mac下安装和使用brew
- hdu1150—Machine Schedule(最小点覆盖)
- Spring的配置及引用
- fprintf函数
- UNIX环境高级编程习题——第八章
- 牛客网 Wannafly模拟赛 矩阵 二分+hash矩阵
- UIView
- leetcode 235. Lowest Common Ancestor of a Binary Search Tree
- java 中的大数据类型(BigInteger和BigDecimal)
- Linux上安装wildfly-10.1.0.Final并部署iServer9D war包