POJ3268————Silver Cow Party(最短路)
来源:互联网 发布:大数据对旅游业的影响 编辑:程序博客网 时间:2024/04/30 13:09
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; road i 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 farm Ai 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
裸的最短路
熟悉一下
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <queue>using namespace std;const int MAXN=1010;const int MAXM=100010;const int INF=1000000007;int tot=0;int head[MAXN];struct edge{int v,w,next;};edge e[MAXM];void add(int u,int v,int w){e[tot].v=v;e[tot].w=w;e[tot].next=head[u];head[u]=tot++;}int d[MAXN][MAXN];typedef pair <int,int> P; void dij(int s){ priority_queue<P,vector<P>,greater<P> > que; fill(d[s],d[s]+MAXN,INF); d[s][s]=0; que.push(P(0,s)); while(!que.empty()){ P p=que.top(); que.pop(); int u=p.second; if(d[s][u]<p.first) continue; for(int k=head[u];k!=-1;k=e[k].next){ int v=e[k].v; int w=e[k].w; if(d[s][v]>d[s][u]+w){ d[s][v]=d[s][u]+w; que.push(P(d[s][v],v)); } } } } int main(){int n,m,x;scanf("%d%d%d",&n,&m,&x);tot=0;memset(head,-1,sizeof(head));for(int i=0;i<m;i++){int u,v,w;scanf("%d%d%d",&u,&v,&w);add(u,v,w);}for(int i=1;i<=n;i++){dij(i);}int MAX=0;for(int i=1;i<=n;i++){MAX=max(MAX,d[i][x]+d[x][i]);}printf("%d\n",MAX);}
- POJ3268—Silver Cow Party(反向最短路)
- POJ3268—Silver Cow Party
- POJ3268—Silver Cow Party
- POJ3268————Silver Cow Party(最短路)
- poj3268——Silver Cow Party(最短路+godv之力)
- POJ3268 Silver Cow Party DIJ最短路
- POJ3268 Silver Cow Party 最短路
- 【POJ3268】Silver Cow Party 最短路
- poj3268 Silver Cow Party(最短路变形)
- POJ3268 Silver Cow Party(最短路问题)
- poj3268 Silver Cow Party【最短路】
- POJ3268 Silver Cow Party spfa求解 最短路
- POJ3268-Silver Cow Party(最短路径)
- POJ3268---Silver Cow Party (最短路径)
- POJ3268 Silver Cow Party(最短路径)
- POJ 3268 Silver Cow Party(好题,最短路—dijkstra算法+置换矩阵处理)
- POJ 3268 Silver Cow Party 最短路—dijkstra算法的优化。
- Silver Cow Party(最短路)
- Linux netstat命令详解
- java的Set类和Hashset类
- OSI七层模型
- [算法]Floyd-Warshall算法理解
- WIN7中全新安装WIN7
- POJ3268————Silver Cow Party(最短路)
- Android UiAutomator环境配置与编译运行
- 【SSH】java真分页实现
- 51nod 1057 N的阶乘
- Android中App启动优化
- Cocos发布Apk失败
- Category和Extension的区别
- Linux makefile 教程 非常详细,且易懂
- PS之通道和蒙版