zoukankan      html  css  js  c++  java
  • POJ1325(最小顶点覆盖)

    Machine Schedule
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 14429   Accepted: 6153

    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

    思路:因为两个机器一开始工作在0号模式,所以(u,0)、(0,v)不需要填边。
    #include <cstdio>
    #include <vector>
    #include <cstring>
    using namespace std;
    const int MAXN=205;
    vector<int> arc[MAXN];
    int n,m,k;
    int match[MAXN],vis[MAXN];
    bool dfs(int u)
    {
        for(int i=0;i<arc[u].size();i++)
        {
            int to=arc[u][i];
            if(!vis[to])
            {
                vis[to]=1;
                int w=match[to];
                if(w==-1||dfs(w))
                {
                    match[to]=u;
                    match[u]=to;
                    return true;
                }
            }
        }
        return false;
    }
    int max_flow()
    {
        int ans=0;
        memset(match,-1,sizeof(match));
        for(int i=1;i<n;i++)
        {
            if(match[i]==-1)
            {
                memset(vis,0,sizeof(vis));
                if(dfs(i))
                {
                    ans++;
                }
            }
        }
        return ans;
    }
    int main()
    {
        while(scanf("%d",&n)!=EOF&&n!=0)
        {
            scanf("%d%d",&m,&k);
            for(int i=0;i<MAXN;i++)    arc[i].clear();
            for(int i=0;i<k;i++)
            {
                int u,v;
                scanf("%*d%d%d",&u,&v);
                if(u==0||v==0)    continue;
                v+=n;
                arc[u].push_back(v);
                arc[v].push_back(u);
            }
            int res=max_flow();
            printf("%d
    ",res);
        }
        return 0;
    }
  • 相关阅读:
    20169204,EXP 3:Java object
    20169204,EXP 2:Java object
    20169204,exp1:Familiar with the Java development environment(Linux+IDEA)
    20169204 2016-2017-2 <Mobbile Platform Development and Practice> Learning Summary, Seventh Week
    第一次使用MarkDown写博客
    理解IOC
    .net与技术经理面谈时经常被提问到的相关技术点
    缓存二、HttpRuntime.Cache用法
    缓存一、Asp.net页面缓存
    一次提交涉及两个数据库处理
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5838895.html
Copyright © 2011-2022 走看看