POJ1325Machine Schedule(匈牙利算法)
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 14375 | Accepted: 6135 |
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
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
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
【分析】本题要求二部图的最小点覆盖集问题,即求最小的顶点集合,覆盖住所有的点。转换成求二部图的最大匹配问题,因为:二部图的点覆盖数==匹配数。
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include<functional>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
using namespace std;
typedef long long ll;
const int N=;
const int M=;
int nx,ny;
int job;
int edg[N][N];
int ans=;
int visx[N],visy[N];
int cx[N],cy[N];
int dfs(int u)
{
visx[u]=;
for(int v=;v<=ny;v++){
if(edg[u][v]&&!visy[v]){
visy[v]=;
if(!cy[v]||dfs(cy[v])){
cx[u]=v;cy[v]=u;
return ;
}
}
}
return ;
}
int solve()
{
memset(cx,,sizeof(cx));memset(cy,,sizeof(cy));
for(int i=;i<=nx;i++){
if(!cx[i]){
memset(visx,,sizeof(visx));memset(visy,,sizeof(visy));
ans+=dfs(i);
}
}
}
int main() {
int x,y,m;
scanf("%d%d%d",&nx,&ny,&job);
memset(edg,,sizeof(edg));
for(int i=;i<job;i++){
scanf("%d%d%d",&m,&x,&y);
edg[x][y]=;
}
solve();
printf("%d\n",ans);
return ;
}
最新文章
- 基于Lattice_CPLD/FPGA Diamond 开发流程
- MES开发学习一
- Swift学习二
- Centos 上使用Mono+MVC5+WebApi+Sqlite
- wpf中dropdownButton控件下拉居中。。。
- Java JDBC连接数据库 Access连接数据库
- fopen\fread\fwrite\fscanf\fprintf\fseek\feof\rewind\fgets\fputc等系列函数使用总结
- if else配对问题
- Unity3D发布WebPlayer时Failed to download data file解决方案
- 协作图(通信图)collaboration diagram
- 说说final关键字(好像有干货)
- SSH整合总结(xml与注解)
- kafka 自定义分区器
- struts2+hibernate+spring注解版框架搭建以及简单测试(方便脑补)
- shell编程(二)之算术运算
- java根据图片创建日期,或最后修改日期重命名
- 在Mac上 python中使用tesseract OCR (Pytesser) 识别图片中的文字
- Linux服务器上搭建web项目环境
- Maven pom.xml详解(转)
- MS-Windows中的Git命令行
热门文章
- [Leetcode] Swap nodes in pairs 成对交换结点
- 【BZOJ3887】【Usaco2015 Jan】Grass Cownoisseur Tarjan+Spfa
- The 13th Zhejiang Provincial Collegiate Programming Contest - C
- Codeforces Round #487 (Div. 2) A Mist of Florescence (暴力构造)
- CentOS 安装 debuginfo-install
- border-1px;避免移动端下边框部分2px
- 关于GitHub学习的地方,很明了
- c++ fstream用法(2)
- PHP等比例生成缩略图
- js实现2048小游戏