# ZOJ 1364 Machine Schedule(二分图最大匹配)

#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int g[N][N], a[N], b[N], vis[N];
int n, m, k, ans;

int dfs(int i)   //DFS增广
{
for(int j = 1; j < m; ++j)
{
if(g[i][j] && !vis[j])
{
vis[j] = 1;
if( b[j] == -1 || dfs(b[j]))
{
//机器a的模式i与机器b的模式j匹配
a[i] = j;
b[j] = i;
return 1;
}
}
}
return 0;
}

int main()
{
int u, v, t;
while(scanf("%d", &n), n)
{
memset(g, 0, sizeof(g));
scanf("%d%d", &m, &k);
for(int i = 0; i < k; ++i)
{
scanf("%d%d%d", &t, &u, &v);
g[u][v] = 1;
}

ans = 0;
memset(a, -1, sizeof(a));
memset(b, -1, sizeof(b));
//状态0不需要重启  所以可以忽略0
for(int i = 1; i < n; ++i)
{
if(a[i] == -1)  //i没被匹配 以i为起点找一条增广路
{
memset(vis, 0, sizeof(vis));
ans += dfs(i);  //
}
}

printf("%d\n", ans);
}
return 0;
}


Machine Schedule

Time Limit: 2 Seconds      Memory Limit: 65536 KB

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

• 本文已收录于以下专栏：

## ZOJ 1364 Machine Schedule(二分图最大匹配)

} int main() { int u, v, t; while(scanf("%d", &n), n) { memset(g, 0, sizeof(g))...
• acvay
• 2015-07-10 15:30
• 561

## 二分图最小覆盖点数（最大匹配）：Machine Schedule

Machine ScheduleTime Limit:1000MS    Memory Limit:10000KB    64bit IO Format:%I64d & %I64u Submit...

## Machine Schedule （二分匹配）

Machine Schedule Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) ...

## poj 1325 Machine Schedule 二分图最小点覆盖=最大匹配

Description As we all know, machine scheduling is a very classical problem in computer science and ...

## 【二分图|最大匹配】POJ-1325 Machine Schedule

Machine Schedule Time Limit: 1000MS   Memory Limit: 10000K       Descript...

## （杭电1150）（poj1325） Machine Schedule （二分图最大匹配）

http://acm.hdu.edu.cn/showproblem.php?pid=1150 http://poj.org/problem?id=1325

## POJ 1325、ZOJ 1364、HDU 1150 Machine Schedule - from lanshui_Yang

Problem Description As we all know, machine scheduling is a very classical problem in computer scie...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)