POJ 3268-Silver Cow Party【正向+反向最短路】
来源:互联网 发布:迷恋荷尔蒙 知乎 编辑:程序博客网 时间:2024/05/23 23:43
Description
One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; roadi requires Ti (1 ≤ Ti ≤ 100) units of time to traverse.
Each cow must walk to the party and, when the party is over, return to her farm. Each cow is lazy and thus picks an optimal route with the shortest time. A cow's return route might be different from her original route to the party since roads are one-way.
Of all the cows, what is the longest amount of time a cow must spend walking to the party and back?
Input
Lines 2..M+1: Line i+1 describes road i with three space-separated integers:Ai, Bi, and Ti. The described road runs from farmAi to farm Bi, requiring Ti time units to traverse.
Output
Sample Input
4 8 21 2 41 3 21 4 72 1 12 3 53 1 23 4 44 2 3
Sample Output
10
Hint
Source
题目大意就是有n头牛m条路,x最为目的地问在这个有向途中,回去再回来,最短路的情况下的花费,最小话费取厥于,最大的哪一个,将x这位出发点。正向和反向建图。
记住是有向图
#include<stdio.h>#include<cstring>#include<algorithm>#define INF 0x3f3f3f3fusing namespace std;int mapz[1100][1100];int mapf[1100][1100];int disz[1100],disf[1100];bool vis[1100];int n,m,x;void PP1(int x){int i,j;for(i=1;i<=n;i++){disz[i]=mapz[x][i];}vis[x]=true;disz[x]=0;for(i=0;i<n-1;i++){int pos=x,min=INF;for(j=1;j<=n;j++){if(!vis[j]&&disz[j]<min){pos=j;min=disz[j];}}vis[pos]=true;for(j=1;j<=n;j++){if(!vis[j]&&disz[j]>disz[pos]+mapz[pos][j]){disz[j]=disz[pos]+mapz[pos][j];}}}}void PP2(int x){int i,j;for(i=1;i<=n;i++){disf[i]=mapf[x][i];}vis[x]=true;disf[x]=0;for(i=0;i<n-1;i++){int pos=x,min=INF;for(j=1;j<=n;j++){if(!vis[j]&&disf[j]<min){pos=j;min=disf[j];}}vis[pos]=true;for(j=1;j<=n;j++){if(!vis[j]&&disf[j]>disf[pos]+mapf[pos][j]){disf[j]=disf[pos]+mapf[pos][j];}}}}int main(){while(scanf("%d%d%d",&n,&m,&x)!=EOF){int i,j;memset(mapz,INF,sizeof(mapz));memset(mapf,INF,sizeof(mapf));for(i=0;i<m;i++){int xx,yy,tt;scanf("%d%d%d",&xx,&yy,&tt);mapz[xx][yy]=min(mapz[xx][yy],tt);mapf[yy][xx]=min(mapf[yy][xx],tt);}memset(vis,false,sizeof(vis));PP1(x);memset(vis,false,sizeof(vis));PP2(x);int ans=-1;for(i=1;i<=n;i++){ans=max(ans,disz[i]+disf[i]);}printf("%d\n",ans);}return 0;}
- POJ 3268-Silver Cow Party【正向+反向最短路】
- poj 3268 Silver Cow Party(最短路)
- POJ 3268 Silver Cow Party 最短路
- POJ 3268 Silver Cow Party 最短路
- POJ 3268 Silver Cow Party 最短路
- POJ 3268 Silver Cow Party 最短路
- POJ 3268 Silver Cow Party 最短路
- poj 3268 Silver Cow Party(最短路)
- POJ Silver Cow Party (最短路+反向建图)
- Poj 3268 Silver Cow Party + Poj 1511 Invitation Cards (最短路反向建图)
- POJ 3268 Silver Cow Party (单源最短路Dijkstra+反向构图)
- poj--3268--Silver Cow Party(最短路)(建反向图)
- poj 3268 Silver Cow Party(最短路+SPFA)
- poj 3268 Silver Cow Party 最短路/dijkstra
- poj 3268 Silver Cow Party(dijkstra最短路)
- POJ 3268 Silver Cow Party 最短路 dij
- POJ 3268 - Silver Cow Party(最短路dijkstra)
- POJ 3268 Silver Cow Party(最短路dijkstra)
- hihocoder 1197 : Give My Text Back
- 字典序的生成
- 面试题整理 二
- 第一天学习内容
- HTTP协议详解
- POJ 3268-Silver Cow Party【正向+反向最短路】
- java中jdk与jre的区别
- Bootstrap学习笔记—关于表单
- 如何把微信朋友圈的小视频转发到自己的朋友圈
- mogodb 创建数据库
- properties读取配置文件(配置白名单的时候)
- EventBus使用攻略(转载)
- sar命令详解
- 沼泽鳄鱼_SSL2511_矩阵乘法