【USACO06NOV】路障

【题目链接】

点击打开链接

【算法】

最短路

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXN 5000
#define MAXM 100000

int i,N,M,shortest,ans;
int dista[MAXN+],distb[MAXN+],x[MAXM+],y[MAXM+],d[MAXM+],
        visa[MAXN+],visb[MAXN+];
vector<pair<int,int> > E[MAXN+];

template <typename T> void read(T &x) {
        int f=; char c = getchar(); x=;
        for (; !isdigit(c); c = getchar()) { if (c=='-') f=-; }
        for (; isdigit(c); c = getchar()) x=x*+c-'';
        x*=f;
}

inline void dijkstra1() {
        int i,x,to;
        priority_queue<pair<int,int> > q;
        for (i = ; i <= N; i++) dista[i] = 2e9;
        q.push(make_pair(-,));
        while (!q.empty()) {
                x = q.top().second; q.pop();
                if (visa[x]) continue;
                visa[x] = ;
                for (i = ; i < E[x].size(); i++) {
                        to = E[x][i].first;
                        if (dista[x] + E[x][i].second < dista[to]) {
                                dista[to] = dista[x] + E[x][i].second;
                                q.push(make_pair(-dista[to],to));
                        }
                }
        }
}

inline void dijkstra2() {
        int i,x,to;
        priority_queue<pair<int,int> > q;
        for (i = ; i < N; i++) distb[i] = 2e9;
        q.push(make_pair(-,N));
        while (!q.empty()) {
                x = q.top().second; q.pop();
                if (visb[x]) continue;
                visb[x] = ;
                for (i = ; i < E[x].size(); i++) {
                        to = E[x][i].first;
                        if (distb[x] + E[x][i].second < distb[to]) {
                                distb[to] = distb[x] + E[x][i].second;
                                q.push(make_pair(-distb[to],to));
                        }
                }
        }
} 

int main() {

        read(N); read(M);

        for (i = ; i <= M; i++) {
                read(x[i]); read(y[i]); read(d[i]);
                E[x[i]].push_back(make_pair(y[i],d[i]));
                E[y[i]].push_back(make_pair(x[i],d[i]));
        }

        dijkstra1();
        dijkstra2();

        shortest = dista[N];
        ans = 2e9;

        for (i = ; i <= M; i++) {
                if (dista[x[i]] + d[i] + distb[y[i]] > shortest)
                        ans = min(ans,dista[x[i]]+d[i]+distb[y[i]]);
                if (dista[y[i]] + d[i] + distb[x[i]] > shortest)
                        ans = min(ans,dista[y[i]]+d[i]+distb[x[i]]);
        }

        cout<< ans << endl;

        return ;

}