杭电 HDU ACM 1150 Machine Schedule(二分匹配)
2015-08-29 12:00
375 查看
Machine Schedule
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7056 Accepted Submission(s): 3537
Problem 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
虽然是模版重要的是学习建模
/*============================================================================= # # Author: liangshu - cbam # # QQ : 756029571 # # School : 哈尔滨理工大学 # # Last modified: 2015-08-29 12:00 # # Filename: B.cpp # # Description: # The people who are crazy enough to think they can change the world, are the ones who do ! =============================================================================*/ # #include<iostream> #include<sstream> #include<algorithm> #include<cstdio> #include<string.h> #include<cctype> #include<string> #include<cmath> #include<vector> #include<stack> #include<queue> #include<map> #include<set> using namespace std; const int INF=101; int from[INF],tot; bool use[INF]; int n, m, k; vector<int>G[INF]; bool match(int x) { for(int i=0;i<G[x].size();i++) { if(!use[G[x][i]]) { use[G[x][i]]=1; if(from[G[x][i]]==-1||match(from[G[x][i]])) { from[G[x][i]]=x; return 1; } } } return 0; } int hungary( ) { tot=0; memset(from,255,sizeof(from)); for(int i=1;i<= m;i++) { memset(use,0,sizeof(use)); if(match(i)) { ++tot; } } return tot; } int main(){ while(cin>>n, n){ if(n == 0)break; cin>>m>>k; for(int i = 0; i < k; i++){ int a, b, c; cin>>a>>b>>c; G[b].push_back(c); } int ans = hungary(); cout<<ans<<endl; for(int i = 0; i < INF; i++){ G[i].clear(); } } return 0; }
相关文章推荐
- VS2005中乱码问题
- 网络抓包以及进行简单数据分析
- (转)FCKeditor文本编辑器的使用方法
- Sicily 1419 On the run 动态规划的应用
- C#异步SOCKET发送帮肋类,支持UDP,TCP
- [软件操作]记一次基于Unity的Profiler性能分析
- android再按一次退出程序提示
- LoadRunner11学习记录五
- 【设计模式】之 透过工厂方法看 抽象类和接口
- 【设计模式】之 透过工厂方法看 抽象类和接口
- UI 14 GET & POST 数据请求 & block异步
- [Unity3D]关于Android真机调测Profiler
- 线索树
- 细说java.util.Timer
- ui-router
- 从Oracle迁移到Mysql之前必须知道的50件事
- Idiot的间谍网络
- 叶存菜鸟笔记之Map一般应用
- File类
- Java优化之输出十万以内的质数