poj 1325 Machine Schedule

点击打开链接

Machine Schedule

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15790 Accepted: 6763

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. 

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. 

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<iostream>#include<cstdio>#include<cstring>using namespace std;int cost[1005][1005],link[1005];int vis[1005];int n,m,k;int find(int x){int i;for(i=1;i<=m;i++){if (cost[x][i]&&!vis[i]){vis[i]=1;if(!link[i]||find(link[i])){link[i]=k;return 1;}}}return 0;}int main(){int a,b,c;while(cin>>n,n){cin>>m>>k;memset(cost,0,sizeof(cost));memset(link,0,sizeof(link));for (int i = 0; i < k; ++i){cin>>a>>b>>c;if(b*c)cost[b][c]=1;}int sum=0;for(int i=1;i<=n;i++){memset(vis,0,sizeof(vis));if(find(i))sum++;}printf("%d\n",sum);}    return 0;}

最小点集覆盖=二分图最大匹配

二分图_互动百科

代码中find(i）就是寻找有没有从x点i开始的增广轨，如果有就进行上述操作，代码是递归的，所以看起来不是很显然，画个图试试就很清楚了.

参考博客

https://www.cnblogs.com/pony1993/archive/2012/08/13/2636916.html