HDU 4109 Instrction Arrangement 差分约束系统
来源:互联网 发布:软件开发管理平台 编辑:程序博客网 时间:2024/05/21 15:45
Instrction Arrangement
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 107 Accepted Submission(s): 48
Problem Description
Ali has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW.
If the distance between two instructions is less than the Safe Distance, it will result in hazard, which may cause wrong result. So we need to design special circuit to eliminate hazard. However the most simple way to solve this problem is to add bubbles (useless operation), which means wasting time to ensure that the distance between two instructions is not smaller than the Safe Distance.
The definition of the distance between two instructions is the difference between their beginning times.
Now we have many instructions, and we know the dependent relations and Safe Distances between instructions. We also have a very strong CPU with infinite number of cores, so you can run as many instructions as you want simultaneity, and the CPU is so fast that it just cost 1ns to finish any instruction.
Your job is to rearrange the instructions so that the CPU can finish all the instructions using minimum time.
If the distance between two instructions is less than the Safe Distance, it will result in hazard, which may cause wrong result. So we need to design special circuit to eliminate hazard. However the most simple way to solve this problem is to add bubbles (useless operation), which means wasting time to ensure that the distance between two instructions is not smaller than the Safe Distance.
The definition of the distance between two instructions is the difference between their beginning times.
Now we have many instructions, and we know the dependent relations and Safe Distances between instructions. We also have a very strong CPU with infinite number of cores, so you can run as many instructions as you want simultaneity, and the CPU is so fast that it just cost 1ns to finish any instruction.
Your job is to rearrange the instructions so that the CPU can finish all the instructions using minimum time.
Input
The input consists several testcases.
The first line has two integers N, M (N <= 1000, M <= 10000), means that there are N instructions and M dependent relations.
The following M lines, each contains three integers X, Y , Z, means the Safe Distance between X and Y is Z, and Y should run after X. The instructions are numbered from 0 to N - 1.
The first line has two integers N, M (N <= 1000, M <= 10000), means that there are N instructions and M dependent relations.
The following M lines, each contains three integers X, Y , Z, means the Safe Distance between X and Y is Z, and Y should run after X. The instructions are numbered from 0 to N - 1.
Output
Print one integer, the minimum time the CPU needs to run.
Sample Input
5 21 2 13 4 1
Sample Output
2HintIn the 1st ns, instruction 0, 1 and 3 are executed;In the 2nd ns, instruction 2 and 4 are executed.So the answer should be 2.
Source
2011 Alibaba-Cup Campus Contest
Recommend
lcy
差分约束系统
加一个源点s指向所有点边权为0,
加一个汇点t,所有点指向t边权为0,
u和v安全距离为w,则加边v->u,边权为-w
求s到t最短路即可。
代码:
#include<cstdio>#include<cstring>#define N 1005int n,m,num,adj[N],low[N],f[N],q[N];struct edge{int v,w,pre;}e[N*10];void insert(int u,int v,int w){e[num].v=v;e[num].w=w;e[num].pre=adj[u];adj[u]=num++;}void spfa(int x){int i,v,head=0,tail=0;memset(f,0,sizeof(f));memset(low,0x3f,sizeof(low));low[x]=0;q[++tail]=x;while(head!=tail){x=q[head=(head+1)%N];f[x]=0;for(i=adj[x];~i;i=e[i].pre)if(low[v=e[i].v]>low[x]+e[i].w){low[v]=low[x]+e[i].w;if(!f[v]){f[v]=1;q[tail=(tail+1)%N]=v;}}}}int main(){int u,v,w;while(~scanf("%d%d",&n,&m)){num=0;memset(adj,-1,sizeof(adj));while(m--){scanf("%d%d%d",&u,&v,&w);u++;v++;insert(v,u,-w);}for(u=1;u<=n;u++){insert(0,u,0);insert(u,n+1,0);}spfa(0);printf("%d\n",1-low[n+1]);}}
- HDU 4109 Instrction Arrangement(差分约束)
- hdu 4109 Instrction Arrangement (差分约束)
- HDU 4109 Instrction Arrangement 差分约束系统
- HDU 4109 Instrction Arrangement(差分约束系统)
- Instrction Arrangement (hdu 4109 差分约束)
- HDU-4109 Instrction Arrangement(差分约束系统+增加源点技巧)
- HDU 4109 Instrction Arrangement (拓扑or差分约束求关键路径)
- HDU4109 Instrction Arrangement【差分约束】【拓扑排序】
- HDU 4109 Instrction Arrangement
- Hdu 4109 Instrction Arrangement
- HDU 4109 Instrction Arrangement
- HDU 4109 Instrction Arrangement
- HDU 4109 Instrction Arrangement
- FOJ1898:Cows Arrangement(差分约束系统)
- hdu 4109 Instrction Arrangement(关键路径)
- (关键路径)HDU 4109 Instrction Arrangement
- HDU 4109 【差分约束系统】 ||【拓扑排序】
- HDU 1384(差分约束系统)
- 修改表空间大小和自动扩展
- sql 语句练习
- 一个程序员对学弟学妹的建议
- Cover flow基本原理及Tapku实现方法
- 转:陈志武 从2049年看中国(来自2049年的一封信)
- HDU 4109 Instrction Arrangement 差分约束系统
- 个人开发总结分享:Android学习及如何利用android来赚钱
- hdu_2002_计算球体积_刷之
- 智能卡
- 指定パスと格式でファイル名称を取得処理.bat
- 用Enumeration 来访问 Iterator
- 分区表及分区索引(7.1)--怎样管理
- 很伤的话
- 设备号的静态申请与动态分配