hdu 1150
来源:互联网 发布:tcp多线程网络编程 编辑:程序博客网 时间:2024/05/17 02:26
“HDOJ新浪微博” “HDOJ腾讯微博”欢迎关注~
Machine Schedule
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3939 Accepted Submission(s): 1910
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.
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.
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 100 1 11 1 22 1 33 1 44 2 15 2 26 2 37 2 48 3 39 4 30
Sample Output
3
代码:
0是初始状态,不需要重启
#include<iostream>#include<stdio.h>#include<string.h>using namespace std;int n,m,k;const int maxn=105;struct node{ int from,to,next;} edge[maxn*maxn];int tol=0;int head[maxn],link[maxn];bool visit[maxn];void add(int a,int b){ edge[tol].from=a; edge[tol].to=b; edge[tol].next=head[a]; head[a]=tol++;}bool getnum(int i){ int j,v; for(j=head[i];j!=-1;j=edge[j].next) { v=edge[j].to; if(!visit[v]) { visit[v]=true; if(link[v]==-1||getnum(link[v])) { link[v]=i; return true; } } } return false;}int solve(){ int count=0; memset(link,-1,sizeof(link)); for(int i=1;i<=n;i++) { memset(visit,false,sizeof(visit)); if(getnum(i)) count++; } return count;}int main(){ int tmpa,tmpb,tmpc; while(scanf("%d",&n),n) { tol=0; memset(head,-1,sizeof(head)); scanf("%d%d",&m,&k); for(int i=0;i<k;i++) { scanf("%d%d%d",&tmpa,&tmpb,&tmpc); add(tmpb,tmpc); } printf("%d\n",solve()); } return 0;}
- hdu 1150
- HDU 1150
- hdu 1150
- HDU 1150
- hdu 1150
- HDU 1150
- HDU 1150
- hdu 1150
- hdu 1150 匈牙利算法
- hdu 1150 二分匹配
- hdu 1150 Machine Schedule
- hdu 1150 Machine Schedule
- hdu 1150 Machine Schedule
- HDU 1150 二分图
- HDU 1150 Machine Schedule
- hdu 1150 Machine Schedule
- HDU-1150-Machine Schedule
- hdu 1150 Machine Schedule
- poj 1611
- 黑马程序员----JAVA基础集合框架_迭代器
- 16周规划17周总结
- cygwin中的环境变量设置
- Oracle11g RAC for Linux 实施手册
- hdu 1150
- 软RAID-mdadm 折腾小记
- Linux下Oracle_11G_r2_(64位)安装教程
- 雅安 挺住
- 传说中的A51
- Linux_Oracle_11g_R2_RAC_安装配置详细过程
- poj 1703 Find them, Catch them
- linux-gcc 编译时头文件和库文件搜索路径
- [STF]Java问题:用Canvas绘图超出边框部分显示不全