POJ 1797 Heavy Transportation
来源:互联网 发布:创意礼物 知乎 编辑:程序博客网 时间:2024/05/17 23:57
Description
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
Output
Sample Input
13 31 2 31 3 42 3 5
Sample Output
Scenario #1:4
与POJ 2253 相反该题目是求最大最小值,同用dijkstra,代码如下:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#define F 10000005
using namespace std;
typedef structnode
{
int u,c;
node(int uu=0,int cc=0):u(uu),c(cc){}
bool operator < (const node&t) const
{
return c<t.c;
}
}node;
typedef structedge
{
int u,c;
edge(int uu=0,int cc=0):u(uu),c(cc){}
}edge;
bool r[1005];
int d[1005];
vector<edge> e[1005];
int n=0,m,Max;
int dijplus(int st)
{
for(int i=1;i<=n;++i) d[i]=0;
memset(r,false,sizeof(r));
priority_queue<node> q;
node t;
d[st]=F;
q.push(node(st,0));
while(!q.empty())
{
t=q.top(),q.pop();
int u=t.u;
if(r[u])continue;
r[u]=true;
for(int i=0;i<e[u].size();++i)
{
int v=e[u][i].u,c=min(e[u][i].c,d[u]);
if(!r[v]&&c>d[v])
{
d[v]=c;
q.push(node(v,c));
}
}
}
return d[n];
}
int main()
{
int t,p=1,x,y,w;
scanf("%d",&t);
while(t--)
{
for(int i=0;i<n;++i) e[i].clear();
scanf("%d %d",&n,&m);
for(int i=0;i<m;++i)
{
scanf("%d %d %d",&x,&y,&w);
e[x].push_back(edge(y,w));
e[y].push_back(edge(x,w));
}
printf("Scenario #%d:\n",p++);
printf("%d\n\n",dijplus(1));
}
return 0;
}
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- Poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ-1797-Heavy Transportation
- POJ 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- poj 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- POJ 1797 Heavy Transportation
- 浅谈& 0xff
- RxBus(一)
- READING NOTE: Pixel Objectness
- Maven:Generating Project in Batch mode 卡住问题
- FreeRTOS之源码及移植解析
- POJ 1797 Heavy Transportation
- =w=一个月的u3d学习纪念日记
- android 触摸事件
- 使用nginx作为http负载均衡器
- Hbase集群迁移
- Espresso Idling Resource
- poj2488——A Knight's Journey(dfs)
- 关于eclipse下junit出错问题
- 图解Android - Android GUI 系统 (5) - Android的Event Input System