洛谷 P4568 [JLOI2011]飞行路线(分层图最短路)

很容易理解的一个算法，只要把图画出来看看就行，感觉也很实用。

#include<cstdio>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<vector>
#include<queue>
#include<math.h>
#include<climits>
#include<set>
#include<sstream>
#include<time.h>
#include<iomanip>

#define debug(x) cout <<#x<<" = "<<x<<endl
#define debug2(x, y) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<endl
#define gg cout <<"---------------QAQ---------------"<<endl
#define fi first
#define SZ(x) (int)x.size()
#define se second
#define pb push_back
#define MEM(a) memset(a, 0, sizeof(a))
#define inf 0x3f3f3f3f
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define PI cos(-1)
#define endl "\n"
#define eps 1e-8
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, ll> Pii;
template<class T> inline void read(T &x){
    x=0; char c=getchar(); int f=1;
    while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
    while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
const int N = 2e5+10, maxn = 1e6+10;
//void FAST(){ios::sync_with_stdio(false);cin.tie(nullptr); cout.tie(nullptr);}
const ll mod =  1e9+7;


int n, m, k, s, t;
struct edge
{
    int v, w;
};
vector<edge> edges;
vector<int> g[N];
int d[N];
bool vis[N];
void add(int u, int v,int w = 0)
{
    edges.push_back(edge{v, w});
    int m = SZ(edges);
    g[u].pb(m-1);
}
void dij(int s)
{
    memset(d, 0x3f, sizeof(d));
    MEM(vis);
    priority_queue<pii, vector<pii>, greater<pii> > q;
    q.push(pii(0, s));
    d[s] = 0;
    while(!q.empty())
    {
        int u = q.top().se; q.pop();
        if(vis[u]) continue;
        vis[u] = 1;
        for(int i = 0; i < SZ(g[u]); ++i) {
            edge e = edges[g[u][i]];
            int v = e.v, w = e.w;
            if(d[v] > d[u]+w)
            {
                d[v] = d[u]+w;
                q.push(pii(d[v], v));
            }
        }
    }
}
void solve()
{
   scanf("%d%d%d%d%d", &n, &m, &k, &s, &t);
   while(m--)
   {
       int u, v, w;
       scanf("%d%d%d", &u, &v, &w);
       add(u, v, w);
       add(v, u, w);
       for(int i = 1; i <= k; ++i) {
        add(u+(i-1)*n, v+i*n);
        add(v+(i-1)*n, u+i*n);
        add(u+i*n, v+i*n, w);
        add(v+i*n, u+i*n, w);
       }
   }
   for(int i = 1;i <= k; ++i) add(t+(i-1)*n, t+i*n);
    dij(s);
    printf("%d\n", d[t+k*n]);
}

int main()
{
//    FAST();
//    init();
//    int _;scanf("%d", &_); while(_--)
//    while(scanf("%d", &n)&&n)
//    while(scanf("%d%d%d", &n, &m, &k)&&(n+m+k))
//    for(ll i = 1; i <= _; ++i)
    solve();
    return 0;
}