POJ 3268 Silver Cow Party(迪杰斯特拉最短路)

题意:

一共$N$个节点,每个节点一头牛,现在每头牛都去$X$处聚会,图是有向图,所以每头牛去和回来的路程不一样,求$N$头牛中走的路程最远的一头的路程.

思路:

首先我们先跑正着从$x$点跑一次最短路,然后得到的是$x$到每个点的距离,从$x$点出发的最短路是从x到每个点的路程
这是每头牛从$x$回去的最短路程.
然后就是神奇的一步:
把图中所有有向边全部方向反过来,再从$x$跑一次最短路,从$x$点出发的最短路是从每个点到$x$的路程,因为有向图反转过来了
这个时候得到的是每头牛来参加聚会的最短路程
然后把答案一相加,去最大值即可.

暴力

第一次暴力搜$n$个点的居然也过了

//正向求解
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#define ll long long
#define pb push_back
#define mp make_pair
#define PII pair<int,int> 
using namespace std;
int n,m,x;
const int N = 1010,M = 1e5 + 10;
int e[M],ne[M],h[N],w[M],idx;
int dist[N];
bool st[N];
void add(int a,int b,int c)
{
    e[idx] = b,ne[idx] = h[a],h[a] = idx,w[idx++] = c;
}
void init()
{
    memset(dist,0x3f,sizeof dist);
}
ll dijkstra(int where,int to)
{
    init();
    dist[where] = 0;
    priority_queue<PII,vector<PII>,greater<PII> >q;
    q.push(mp(0,where));
    while(q.size())
    {
        PII t = q.top();
        q.pop();
        int v = t.second,distance = t.first;
        if(st[v])continue;
        for(int i = h[v];i != -1;i = ne[i])
        {
            int j = e[i];
            if(dist[j] > dist[v] + w[i])
            {
                dist[j] = dist[v] + w[i];
                q.push(mp(dist[j],j));
            }
        }
    }
    return dist[to];
}
int main()
{
    cin >> n >> m >> x;
    memset(h,-1,sizeof h);
    for(int i = 0;i < m;i++)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);
    }
    vector<ll> ans;
    for(int i = 1;i <= n;i++)
    {
        if(i == x)ans.push_back(0);
        else ans.pb(dijkstra(i,x));
    }
    //for(int i = 0;i < n ;i++)cout << ans[i] <<" ";
    //cout << endl;
    int t = dijkstra(x,1);
    //for(int i = 1;i <= n;i++)cout << dist[i] <<" ";
    //cout << endl;
    for(int i = 1;i <= n;i++)
    ans[i-1] += dist[i];
    //for(int i = 0;i < ans.size();i++)cout << ans[i] <<" ";
    cout << *max_element(ans.begin(),ans.begin()+n);
    return 0;
}

正解

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#define ll long long
#define pb push_back
#define mp make_pair
#define PII pair<int,int> 
using namespace std;
int n,m,x;
const int N = 1010,M = 1e5 + 10;
int e[M],ne[M],h[N],w[M],idx;
int dist[N];
bool st[N];
int e1[M],ne1[M],h1[N],w1[M],idx1;
int dist1[N];
bool st1[N];
void add(int a,int b,int c)
{
    e[idx] = b,ne[idx] = h[a],h[a] = idx,w[idx++] = c;
}
void add1(int a,int b,int c)
{
    e1[idx1] = b,ne1[idx1] = h1[a],h1[a] = idx1,w1[idx1++] = c;
}
ll dijkstra(int where,int to)
{
    memset(dist,0x3f,sizeof dist);
    dist[where] = 0;
    priority_queue<PII,vector<PII>,greater<PII> >q;
    q.push(mp(0,where));
    while(q.size())
    {
        PII t = q.top();
        q.pop();
        int v = t.second,distance = t.first;
        if(st[v])continue;
        for(int i = h[v];i != -1;i = ne[i])
        {
            int j = e[i];
            if(dist[j] > dist[v] + w[i])
            {
                dist[j] = dist[v] + w[i];
                q.push(mp(dist[j],j));
            }
        }
    }
    return dist[to];
}
ll dijkstra1(int where,int to)
{
    memset(dist1,0x3f,sizeof dist1);
    dist1[where] = 0;
    priority_queue<PII,vector<PII>,greater<PII> >q;
    q.push(mp(0,where));
    while(q.size())
    {
        PII t = q.top();
        q.pop();
        int v = t.second,distance = t.first;
        if(st1[v])continue;
        for(int i = h1[v];i != -1;i = ne1[i])
        {
            int j = e1[i];
            if(dist1[j] > dist1[v] + w1[i])
            {
                dist1[j] = dist1[v] + w1[i];
                q.push(mp(dist1[j],j));
            }
        }
    }
    return dist1[to];
}
int main()
{
    cin >> n >> m >> x;
    memset(h,-1,sizeof h);memset(h1,-1,sizeof h1);
    for(int i = 0;i < m;i++)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);add1(b,a,c);
    }
    vector<ll> ans;
    int t = dijkstra(x,1);

    for(int i = 0;i < n;i++)ans.pb(dist[i+1]);
    t = dijkstra1(x,1);

    for(int i = 1;i <= n;i++)ans[i-1] += dist1[i];

    cout << *max_element(ans.begin(),ans.begin()+n);
    return 0;
}