1150 Machine Schedule-CSDN博客

本文链接：https://blog.csdn.net/m0_52796585/article/details/120209725

题目详情：

Machine Schedule

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12936 Accepted Submission(s): 6437

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.

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

Source

Asia 2002, Beijing (Mainland China)

Recommend

Ignatius.L

题目大意：

两个机器，有多种模式，每个机器都可以重启切换模式，机器默认模式是模式0，现有多种任务，每个任务对应一种模式，问两个机器最少需要重启多少次才可以完成这些任务。

解题思路：

匈牙利算法，此题可以转化成二分图的最大匹配。

AC代码：

#include <iostream>
#include <vector>
#include <cstring>
#define MAX 101
using namespace std;
vector<int> unvisit(MAX, 1); //存放是否访问过
vector<int> bo_f(MAX, -1);   //女生的男朋友
bool dfs(vector<vector<int>> &machine, int b_w, int n, int m){
    for (int i = 0; i < m; ++i){
        if (machine[b_w][i] && unvisit[i]){ //传过来的男生有女朋友且该女生没有访问过
            unvisit[i] = 0;
            if (bo_f[i] == -1 || dfs(machine, bo_f[i], n, m)){ //该女生没有男朋友且dfs后为真
                bo_f[i] = b_w;
                return true;
            }
        }
    }
    return false;
}
int xyl(vector<vector<int>> &machine, int n, int m){
    int s = 0;
    for (int i = 0; i < n; ++i){
        fill(unvisit.begin(), unvisit.end(), 1);
        if (dfs(machine, i, n, m))  ++s;
    }
    return s;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    int i, x, y;
    while (cin >> n && n){
        cin >> m >> k;
        vector<vector<int>> machine(MAX, vector<int>(MAX, 0)); //邻接矩阵
        fill(unvisit.begin(), unvisit.end(), 1);
        fill(bo_f.begin(), bo_f.end(), -1);
        while (k--){
            cin >> i >> x >> y;
            if (x != 0 && y != 0)
                machine[x][y] = 1;
        }
        cout << xyl(machine, n, m) << endl;
    }
    return 0;
}