POJ1797(dijkstra)
2016-01-20 23:05
471 查看
Heavy Transportation
Description
Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.
Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's place). You may assume that there is at least one path. All streets can be travelled in both directions.
Input
The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.
Output
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for the scenario with a blank line.
Sample Input
Sample Output
Time Limit: 3000MS | Memory Limit: 30000K | |
Total Submissions: 26442 | Accepted: 7044 |
Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.
Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's place). You may assume that there is at least one path. All streets can be travelled in both directions.
Input
The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.
Output
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for the scenario with a blank line.
Sample Input
1 3 3 1 2 3 1 3 4 2 3 5
Sample Output
Scenario #1: 4 题意:求结点1到结点n的所有每个路径中的最长边中的最小值。
/* dijkstra Accepted 4316 KB 391 ms */ #include"cstdio" #include"cstring" #include"algorithm" using namespace std; const int MAXN=1002; const int INF=0x3fffffff; int mp[MAXN][MAXN]; int V,E; int dijkstra(int s) { int vis[MAXN]; memset(vis,0,sizeof(vis)); int d[MAXN];//代表最大承载量 for(int i=1;i<=V;i++) d[i]=mp[s][i]; int n=V; while(n--) { int maxcost,k; maxcost=0; for(int i=1;i<=V;i++) { if(!vis[i]&&d[i]>maxcost) { k=i; maxcost=d[i]; } } vis[k]=1; for(int i=1;i<=V;i++) { if(!vis[i]&&d[i]<min(d[k],mp[k][i])) { d[i]=min(d[k],mp[k][i]); } } } return d[V]; } int main() { int T; scanf("%d",&T); for(int cas=1;cas<=T;cas++) { memset(mp,0,sizeof(mp)); scanf("%d%d",&V,&E); for(int i=0;i<E;i++) { int u,v,cost; scanf("%d%d%d",&u,&v,&cost); mp[u][v]=mp[v][u]=cost; } printf("Scenario #%d:\n",cas); printf("%d\n\n",dijkstra(1)); } return 0; }
/* floyd Time Limit Exceeded */ #include"cstdio" #include"algorithm" using namespace std; const int MAXN=1002; const int INF=0x3fffffff; int mp[MAXN][MAXN]; int main() { int T; scanf("%d",&T); for(int cas=1;cas<=T;cas++) { int V,E; scanf("%d%d",&V,&E); for(int i=1;i<=V;i++) for(int j=1;j<=V;j++) if(i==j) mp[i][j]=0; else mp[i][j]=INF; for(int i=0;i<E;i++) { int u,v,cost; scanf("%d%d%d",&u,&v,&cost); mp[u][v]=mp[v][u]=cost; } for(int k=1;k<=V;k++) for(int i=1;i<=V;i++) for(int j=1;j<=V;j++) if(mp[i][k]<mp[i][j]&&mp[k][j]<mp[i][j]) mp[i][j]=max(mp[i][k],mp[k][j]); printf("Scenario #%d:\n",cas); printf("%d\n\n",mp[1][V]); } return 0; }
/* 堆优化dijkstra 1797 Accepted 5224K 329MS */ #include"cstdio" #include"queue" #include"vector" #include"algorithm" #include"cstring" using namespace std; const int MAXN=1002; const int INF=0x3fffffff; struct Edge{ int to,cost; Edge(int to,int cost) { this->to=to; this->cost=cost; } friend bool operator<(const Edge &a,const Edge &b) { return a.cost < b.cost; } }; int V,E; vector<int> G[MAXN]; int mp[MAXN][MAXN]; int dijkstra(int s) { int d[MAXN]; priority_queue<Edge> que; for(int i=1;i<=V;i++) { que.push(Edge(i,mp[s][i])); d[i]=mp[s][i]; } while(!que.empty()) { Edge e=que.top();que.pop(); if(e.to==V) return e.cost; int v=e.to; if(d[v]>e.cost) continue; for(int i=0;i<G[v].size();i++) { int u=G[v][i]; if(d[u]<min(d[v],mp[v][u])) { d[u]=min(d[v],mp[v][u]); que.push(Edge(u,d[u])); } } } return -1; } int main() { int T; scanf("%d",&T); for(int cas=1;cas<=T;cas++) { memset(mp,0,sizeof(mp)); scanf("%d%d",&V,&E); for(int i=1;i<=V;i++) { G[i].clear(); } for(int i=0;i<E;i++) { int u,v,cost; scanf("%d%d%d",&u,&v,&cost); G[u].push_back(v); G[v].push_back(u); mp[u][v]=mp[v][u]=cost; } printf("Scenario #%d:\n",cas); printf("%d\n\n",dijkstra(1)); } return 0; }
相关文章推荐
- Thinking in java学习笔记—泛型(擦除)
- 注*TP 3.2 使用 官方 WeChat 类. 获取用户信息(授权页面) ---纯手工打造!
- Java笔记15:多线程
- MySQL中Index Condition Pushdown(ICP)优化
- 开闭原则
- 怎么命名变量?
- 虚拟机中Windows XP的安装步骤
- Lighttpd1.4.20源码分析 笔记 状态机之请求处理
- 代理模式-静态代理
- 移动开发(IOS) – Objective-C-01-概述
- Mac和 iOS下的对称和非对称加密算法的使用
- Cassandra与HBase的大数据对决 谁是胜者?
- Android 上滑弹性动画+下拉放大图像+淘宝菜单
- 查询卫星轨道参数网址 http://celestrak.com/satcat/search.asp
- commons-loging 、log4j 、slf4j 、LogBack日志相关知识详解
- python核心编程-线程threading模块之单线程多线比较
- 使用宏定义让参数含义更清晰
- 巧用Ajax的beforeSend 提高用户体验
- C和C++语言编程里面常用函数或者编程技巧总结(不断更新)
- CentOS 7.0 MySQL 5.6.19安装与卸载脚本小结