poj 1325 Machine Schedule 题解

Machine Schedule

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 14479		Accepted: 6172

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 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

Sample Output

3

Source

Beijing 2002

——————————————————————我是华丽丽的分割线————————————————————————————————

二分图最大点覆盖。

最小点集覆盖—— 用最少的点，覆盖所有边。

这里面，边指任务，点指机器模式。

这里面的特点是在任务执行顺序没有要求的条件下才可以使用最小点集覆盖。

这里具体还是使用匈牙利算法，找到最大匹配的边数——实际意义为找到匹配边的其中三个对应点，能够覆盖所有的任务。

 /*
     Problem:
     OJ:
     User:
     Time:
     Memory:
     Length:
 */
 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<cstdlib>
 #include<iomanip>
 #include<cassert>
 #include<climits>
 #include<vector>
 #include<list>
 #include<map>
 #define maxn 101
 #define F(i,j,k) for(int i=j;i<=k;i++)
 #define M(a,b) memset(a,b,sizeof(a))
 #define FF(i,j,k) for(int i=j;i>=k;i--)
 #define inf 0x7fffffff
 #define maxm 2016
 #define mod 1000000007
 //#define LOCAL
 using namespace std;
 int read(){
     int x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 int n,m,k;
 int mp[maxn][maxn];
 int px[maxn],py[maxn];
 int ans;
 int cx[maxn],cy[maxn];
 inline int path(int u)
 {
     cx[u]=;
     F(i,,m){
         if(mp[u][i]>&&!cy[i]){
             cy[i]=;
             if(!py[i]||path(py[i]))
             {
                 px[u]=i;
                 py[i]=u;
                 return ;
             }
         }
     }
     return ;
 }
 inline void solve()
 {
     ans=;
     M(px,);M(py,);
     F(i,,n){
         if(!px[i]){
             M(cx,);M(cy,);
             ans+=path(i);
         }
     }
     return;
 }
 int main()
 {
     std::ios::sync_with_stdio(false);//cout<<setiosflags(ios::fixed)<<setprecision(1)<<y;
     #ifdef LOCAL
     freopen("data.in","r",stdin);
     freopen("data.out","w",stdout);
     #endif
     while(cin>>n)
     {
         if(n==) break;
         cin>>m>>k;M(mp,);
         F(i,,k){
             int a,b,c;
             cin>>a>>b>>c;
             mp[b][c]=;
         }
         solve();
         cout<<ans<<endl;
     }
     return ;
 }