Silver Cow Party POJ - 3268 (dijkstra)

最新推荐文章于 2018-08-05 17:17:59 发布

qq_38665638

最新推荐文章于 2018-08-05 17:17:59 发布

阅读量133

点赞数

分类专栏：算法学习

本文链接：https://blog.csdn.net/qq_38665638/article/details/79592066

版权

算法学习专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Silver Cow Party

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 26103		Accepted: 11930

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 T_i (1 ≤ T_i ≤ 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

Line 1: Three space-separated integers, respectively: N, M, and X
Lines 2.. M+1: Line i+1 describes road i with three space-separated integers: A_i, B_i, and T_i. The described road runs from farm A_i to farm B_i, requiring T_i time units to traverse.

Output

Line 1: One integer: the maximum of time any one cow must walk.

Sample Input

Sample Output

Hint

Cow 4 proceeds directly to the party (3 units) and returns via farms 1 and 3 (7 units), for a total of 10 time units.

路径是单向的，利用dijkstra正反两次建图搜索，采用邻接表建图，利用优先队列。

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define INF 9999999

using namespace std;

typedef pair<int,int> p;

int M,N,X;
int A,B,L;
int dis[1005];
int dis2[1005];
struct edge
{
    int to;
    int cost;
};
vector<edge> G[100005],G2[100005];
void Dij()
{
    priority_queue<p,vector<p>,greater<p> > que;
    fill(dis,dis+1005,INF);
    dis[X]=0;
    que.push(p(0,X));
    while(!que.empty()){
        p a=que.top();
        que.pop();
        if(a.first>dis[a.second])
            continue;
        int b=a.second;
        for(int i=0;i<G[b].size();i++){
            edge e=G[b][i];
            if(dis[e.to]>dis[b]+e.cost){
                dis[e.to]=dis[b]+e.cost;
                que.push(p(dis[e.to],e.to));
            }
        }
    }
}
void Dij2()
{
    priority_queue<p,vector<p>,greater<p> > que;
    fill(dis2,dis2+1005,INF);
    dis2[X]=0;
    que.push(p(0,X));
    while(!que.empty()){
        p a=que.top();
        que.pop();
        if(a.first>dis2[a.second])
            continue;
        int b=a.second;
        for(int i=0;i<G2[b].size();i++){
            edge e=G2[b][i];
            if(dis2[e.to]>dis2[b]+e.cost){
                dis2[e.to]=dis2[b]+e.cost;
                que.push(p(dis2[e.to],e.to));
            }
        }
    }
}
int main()
{
    cin>>N>>M>>X;
    for(int i=0;i<M;i++){
        cin>>A>>B>>L;
        edge a;
        a.to=B,a.cost=L;
        G[A].push_back(a);
        edge b;
        b.to=A,b.cost=L;
        G2[B].push_back(b);
    }
    Dij();
    Dij2();
    int num=0;
    for(int i=1;i<=N;i++)
    {
        if(num<dis[i]+dis2[i])
            num=dis[i]+dis2[i];
    }
    cout<<num<<endl;
}

利用数组建立邻接表，非常方便，而且0ms就通过了。

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define INF 10000000000LL

using namespace std;

int N,M,X;
typedef pair<int,int> p;
int u[100005],v[100005],w[100005];
int frist[1005],next[100005];
int dis[1005];
int d[1005];


void dji()
{
    priority_queue<p,vector<p>,greater<p> >que;
    fill(dis,dis+1005,INF);
    dis[X]=0;
    que.push(p(0,X));
    while(!que.empty()){
        p a=que.top();
        que.pop();
        int t1=a.first;
        int t2=a.second;
        if(a.first>dis[a.second])
            continue;
        int k=frist[t2];
        while(k!=-1){
            if(dis[v[k]]>dis[t2]+w[k]){
                dis[v[k]]=dis[t2]+w[k];
                que.push(p(dis[v[k]],v[k]));
            }
            k=next[k];
        }
    }
}

int main()
{
    scanf("%d%d%d",&N,&M,&X);
    fill(frist,frist+1005,-1);
    for(int i=1;i<=M;i++){
        scanf("%d%d%d",&u[i],&v[i],&w[i]);
        next[i]=frist[u[i]];
        frist[u[i]]=i;
    }
    dji();
    long long num=0;
    for(int i=1;i<=N;i++){
        d[i]+=dis[i];
    }
    fill(frist,frist+1005,-1);
    for(int i=1;i<=M;i++){
        swap(u[i],v[i]);
        next[i]=frist[u[i]];
        frist[u[i]]=i;
    }
    dji();
    for(int i=1;i<=N;i++){
        d[i]+=dis[i];
    }
    for(int i=1;i<=N;i++){
        if(num<d[i])
            num=d[i];
    }
    cout<<num;
    return 0;
}