HDOJ4109 关键路径入门题
来源:互联网 发布:淘宝退货运费险怎么用 编辑:程序博客网 时间:2024/06/16 11:27
Instrction Arrangement
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1955 Accepted Submission(s): 821
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 | We have carefully selected several similar problems for you: 4103 4105 4104 4101 4102
赤裸裸的求关键路径,用拓扑排序实现。
第一次用c++写出来,发个博文纪念一下。
#include <iostream>#include <ctime>#include <cstring>#include <cmath>#include <queue>#include <vector>using namespace std;const int maxn = 1005;struct node{ int to,val;};vector<node>G[maxn];int i,j,k,m,n;int in[maxn],t[maxn];void init(){ int u,v,w; for (i=0; i<n; i++) { in[i] = t[i] = 0; G[i].clear(); } for (i=1; i<=m; i++) { cin >> u >> v >> w; G[u].push_back(node{v,w}); in[v]++; }}void tuopu(){ queue<int>que; int u,v,w; for (i=0; i<n; i++) if (in[i]==0) { que.push(i); t[i]++; } while (!que.empty()) { u = que.front(); que.pop(); for (i=0; i<G[u].size(); i++) { v = G[u][i].to; w = G[u][i].val; t[v] = max(t[v],t[u]+w); if (--in[v]==0) que.push(v); } }}void output(){ int ans = 0; for (i=0; i<n; i++) ans = max(ans,t[i]); cout << ans << endl;}int main(){ std::ios::sync_with_stdio(false); while (cin >> n >> m) { init(); tuopu(); output(); } return 0;}
阅读全文
0 0
- HDOJ4109 关键路径入门题
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 关键路径
- 新建jsp出现Multiple annotations found at this line:
- tomcat-redis-session共享
- split命令
- 火狐浏览器 兼容性 问题 简单概述
- mysql 多表查询
- HDOJ4109 关键路径入门题
- 杭电OJ_(2042)不容易系列之二
- sqlalchemy 链接数据库,指定编码,解决密码含有特殊字符
- Spring框架中的设计模式(一)
- 第三十二篇:JAVA应用小程序(Applet)
- Activity中使用Thread导致的内存泄漏
- 利用Python搭建用户画像系统
- 面试问题:发一个随机红包,100块钱给10个人。每个人最多12块钱,最少6块钱。怎么分?
- 计算机网络数据链路层和物理层