hdu 1150 Machine Schedule(二分匹配,简单匈牙利算法)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1150
Machine Schedule
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6733 Accepted Submission(s):
3375
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.
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.
the minimal times of restarting machine.
#include <iostream>
#include <cstdio>
#include <cstring> using namespace std; int Map[][],vis[],n,m;
int ok[]; bool Find(int x)
{
for (int i=;i<=m;i++)
{
if (Map[x][i]==&&!vis[i])
{
vis[i]=;
if (ok[i]==-)
{
ok[i]=x;
return true;
}
else
{
if (Find(ok[i])==true)
{
ok[i]=x;
return true;
}
}
}
}
return false;
} int main()
{
int k,i,x,y;
int ans;
while (~scanf("%d",&n))
{
ans=;
memset(Map,,sizeof(Map));
memset(ok,-,sizeof(ok));
if (n==)
break;
scanf("%d%d",&m,&k);
while (k--)
{
scanf("%d%d%d",&i,&x,&y);
//if(x>0&&y>0)
Map[x][y]=;
}
for (int j=;j<=n;j++)
{
memset(vis,,sizeof(vis));
if (Find(j)==true)
ans++;
}
printf ("%d\n",ans);
}
return ;
}
最新文章
- log4j 文档
- UC浏览器 分享到朋友圈和微信好友 分类: JavaScript 2015-04-28 14:45 615人阅读 评论(1) 收藏
- Scala深入浅出实战经典-----002Scala函数定义、流程控制、异常处理入门实战
- IIS 出现如下错误:PageHandlerFactory-Integrated”
- Jenkins自动部署Tomcat项目
- webpack入坑之旅(三)webpack.config入门
- 滚动固定TAB在顶部显示
- 直播技术资源站 http://lib.csdn.net/base/liveplay/structure
- CSS和字符串实现三角形
- gO语言的安装和环境变量的配置
- python 批量爬取代理ip
- ECharts案例教程1
- iOS5编程--ARC在工程上的相关设置
- BZOJ 1043 下落的圆盘
- mysql c haracter
- myeclipse6.0安装svn插件
- 关于QT中的音频通信问题
- [最短路][部分转] P1073 最优贸易
- SQL Server 2016 快照代理过程分析
- Android开发之漫漫长途 Fragment番外篇——TabLayout+ViewPager+Fragment
热门文章
- Thinkphp5的ajax接口实现
- 【Docker】- 基本命令
- WDCP V3.2面板安装且新增PHP多版本和免费Let&#39;s Encrypt SSL证书
- Jetty与Tomcat综合比较
- 2011 Multi-University Training Contest 8 - Host by HUST
- Elasticsearch Query DSL备忘(1)(Constant score query和Bool Query)
- Java异常捕捉
- POJ2891:Strange Way to Express Integers——题解
- BZOJ5329: [SDOI2018]战略游戏——题解
- 从零开始学Linux系统(三)安装CentOS-7及软件包管理操作