zoukankan      html  css  js  c++  java
  • POJ 1325 Machine schedine (二分图-最小点覆盖数=最大匹配边数)

    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
    题解:最小点覆盖数==最大匹配边数
    参考代码:
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<cmath>
     5 #include<cstdlib>
     6 #include<algorithm>
     7 #include<queue>
     8 #include<deque>
     9 #include<stack>
    10 #include<set>
    11 #include<vector>
    12 #include<map>
    13 using namespace std;
    14 const int maxn=105;
    15 int n,m,k,ok[maxn];
    16 bool a[maxn][maxn],vis[maxn];
    17 
    18 bool Find(int x)
    19 {
    20     for(int i=1;i<=m;i++)
    21     {
    22         if(a[x][i]&&!vis[i])
    23         {
    24             vis[i]=true;
    25             if(!ok[i]||Find(ok[i]))
    26             {
    27                 ok[i]=x;
    28                 return true;
    29             }
    30         }
    31     }
    32     return false;
    33 }
    34 int maxP()
    35 {
    36     int ans=0;
    37     memset(ok,0,sizeof(ok));
    38     for(int i=1; i<=n; i++)
    39     {
    40         memset(vis,false,sizeof(vis));
    41         if(Find(i)) ans++;
    42     }
    43     return ans;
    44 }
    45 int main()
    46 {
    47     int kase=0;
    48     while(scanf("%d",&n) && n)
    49     {
    50         scanf("%d%d",&m,&k);
    51         memset(a,false,sizeof(a));
    52         int x,y,z;
    53         while(k--)
    54         {
    55             cin>>x>>y>>z;
    56             a[y][z]=true;
    57         }
    58         int ans=maxP();
    59         int cnt=0;
    60         printf("%d
    ",ans);
    61     }
    62     return 0;
    63 }
    View Code
  • 相关阅读:
    现在的技术QQ群为什么都变成了这样?效率高也是有弊端的?
    【php】php中mail()不可用,php中sendmail不能用的解决方法
    Cannot validate since no PHP executable is set. Use the setting 'php.validate.executablePath' to configure the PHP executable.无法使用PHP可执行的设置。设置php.validate。executablePath配置PHP可执行文件。
    20150907自动化测试之Appinum For Android(前篇)
    [摘]关于目标管理
    婚恋网站应该有视频功能
    GIS的双屏显示模式是一个实用的创新
    移动产品将越分越细
    基于开源GIS软件的电子政务地理信息应用解决方案
    手机长途话费应再降!
  • 原文地址:https://www.cnblogs.com/csushl/p/9520620.html
Copyright © 2011-2022 走看看