hdu 1150 Machine Schedule 最少点覆盖转化为最大匹配
Machine Schedule
Time Limit: 1 Sec Memory Limit: 256 MB
题目连接
http://acm.hdu.edu.cn/showproblem.php?pid=1150
Description
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 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
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
HINT
题意
一项任务能在两个机器的状态a和b中一个完成,两个机器分别有n,m中状态,问k项任务做多能最少在转换多少次状态下完成;
题解:
把A机器的n个状态和B的m个状态看作顶点,如果任务1能在状态Ai和状态Bi下完成则在Ai--Bi间连一条边这样构造一个二部图
代码:
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <queue>
#include <typeinfo>
#include <map>
#include <stack>
typedef long long ll;
#define inf 0x7fffffff
using namespace std;
inline ll read()
{
ll x=,f=;
char ch=getchar();
while(ch<''||ch>'')
{
if(ch=='-')f=-;
ch=getchar();
}
while(ch>=''&&ch<='')
{
x=x*+ch-'';
ch=getchar();
}
return x*f;
}
//*************************************************
int n,m;
int lk[];
int g[][];
int y[];
int ans;
bool dfs(int v)
{
for(int i=;i<=m;i++){
if(g[v][i]&&!y[i])
{
y[i]=;
if(lk[i]==||dfs(lk[i]))
{
lk[i]=v;
return ;
}
}
}
return ;
}
void solve()
{
for(int i=;i<=n;i++)
{
memset(y,,sizeof(y));
ans+=dfs(i);
}
cout<<ans<<endl;
}
int main()
{
int k;
while(cin>>n)
{
if(n==)break;
cin>>m>>k;
ans=;
memset(g,,sizeof(g));
memset(lk,,sizeof(lk));
int x,a,b;
for(int i=;i<=k;i++){cin>>x>>a>>b;g[a][b]=;}
solve();
}
return ;
}
最新文章
- 用js实现动画效果核心方式
- 打开gvim发现菜单栏是乱码
- python 函数传递参数的多种方法
- HTTP Code
- 安装Linux 16.04 时,选择好分区后,进到选择地点的界面后,总是闪退,退到最原始的界面
- C#获取程序集自动增加的版本号和编译时间
- Delphi iOS 开启文件共享 UIFileSharingEnabled
- 最大权闭合图 &;&; 【BZOJ】1497: [NOI2006]最大获利
- Java学习第一步: Win7配置JDK环境
- 【MySQL案例】HA: GTID_MODE配置不一致
- Java 并发 关键字volatile
- 一步步教你轻松学KNN模型算法
- RTTI和反射小结
- 【CF860E】Arkady and a Nobody-men 长链剖分
- Nginx中配置http和https做反向代理
- hbase Problem binding to node1/192.168.1.13:16020 : 地址已在使用
- .NET Standard / dotnet-core / net472 —— .NET 究竟应该如何大小写?
- str中的join方法; set集合;深浅拷贝
- BumpMap、NormalMap的区别
- C语言关键字:auto、static、register、const、volatile 、extern 总结 <;转>;
热门文章
- gcc的-D和-U参数:宏的设置与取消 _CCFLAGS="; -w -enable-threads=posix -DLINUX -D_REENTRANT -DWORKONGN -Dlinux -D_GN_DETAIL_SDR_";
- emmet-vim
- form表单那点事儿(上) 基础篇
- __set(),__get() 魔术方法示例
- Oulipo (kmp)
- Rescue
- FineUI第四天---PageManage的概述
- KMP算法精髓
- Python Django 的 django templatedoesnotexist
- Python学习之字典详解