# HDU 1150 Machine Schedule 二分图最小覆盖点

C - Machine Schedule
Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

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

ACcode:

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int map[105][105];
int vis[105];
bool can(int i)
{
int j;
for(j=0;j<m;j++)
{
if(!vis[j]&&map[i][j])
{
vis[j]=1;
{
return true;
}
}
}
return false;
}
int main()
{
while(scanf("%d",&n),n!=0)
{
scanf("%d%d",&m,&k);
int i;
int z;
memset(map,0,sizeof(map));
for(i=0;i<k;i++)
{
int t1,t2;
scanf("%d%d%d",&z,&t1,&t2);
if(t1>0&&t2>0)
map[t1][t2]=1;
}
int s=0;
for(i=0;i<n;i++)
{
memset(vis,0,sizeof(vis));
if(can(i))
s++;
}
printf("%d\n",s);
}
}


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

## HDU 1150 Machine Schedule 二分图最小覆盖点

C - Machine Schedule Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u S...

## 【hdu1150】【Machine Schedule】二分图最小点覆盖+简单感性证明

（上不了p站我要死了，侵权度娘背锅） 题目大意 有两台机器A和B以及N个需要运行的任务。每台机器有M种不同的模式，而每个任务都恰好在一台机器上运行。如果它在机器A上运行，则机器A需要设置为模...

## POJ-1325 && HDU-1150 Machine Schedule 二分图匹配

#include #include #include #include #include #include #include using namespace std; int map[1...

## 【图算法之二分图】HDU1150---Machine Schedule

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

## hdu1150Machine Schedule (二分匹配，最小顶点覆盖)

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

举报原因： 您举报文章：HDU 1150 Machine Schedule 二分图最小覆盖点 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)