CSU1808 地铁 （最短路，好题）

题目链接

题意：中文题不解释了。

题解：因为再转车的过程中要另外的时间，所以我们平时那种以顶点为对象的最短路算法在这道题上面已经不适用了，在这个题当中我们要以边作为研究对象，但是用数组肯定存不下边的所有信息，这时候我们可以用链式向前星方法来存图，然后每个边都有一个对应的数字，然后以边为对象算最短路，细节看代码。

#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<cmath>
#include<stack>
#include<string>

const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf = 2e9;
const long long onf = 1e18;
#define me(a, b) memset(a,b,sizeof(a))
#define lowbit(x) x&(-x)
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI 3.14159265358979323846
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int n, m;
int head[maxn], tot;
ll dis[maxn << 1];
struct node {
    int v, next, val, c;
} maps[maxn << 1];

struct Node {
    int i;
    ll val;

    bool friend operator<(Node a, Node b) {
        return a.val > b.val;
    }
};

void add_edge(int u, int v, int val, int c) {
    maps[tot] = node{v, head[u], val, c};
    head[u] = tot++;
}

void ins(int u, int v, int val, int c) {
    add_edge(u, v, val, c);
    add_edge(v, u, val, c);
}

ll Dijkstra() {
    bool vis[maxn << 1];
    for (int i = 0; i <= tot; i++)///初始化这个不是顶点的数目，是边的数目。
        dis[i] = onf, vis[i] = 0;
    priority_queue<Node> q;
    for (int i = head[1]; i != -1; i = maps[i].next) {///首先把跟起点连接的边放到队列里面。
        dis[i] = maps[i].val;
        q.push(Node{i, dis[i]});
    }
    ll ans = onf;
    while (!q.empty()) {
        Node cur = q.top();
        q.pop();
        if (vis[cur.i])
            continue;
        vis[cur.i] = 1;
        int u = maps[cur.i].v;
        if (u == n)
            ans = min(ans, dis[cur.i]);
        for (int i = head[u]; i != -1; i = maps[i].next) {
            int temp = abs(maps[cur.i].c - maps[i].c);
            int val = maps[i].val;
            if (dis[i] > dis[cur.i] + val + temp) {
                dis[i] = dis[cur.i] + val + temp;
                q.push(Node{i, dis[i]});
            }
        }
    }
    return ans;
}

void init() {
    for (int i = 1; i <= n; i++)
        head[i] = -1;
    tot = 0;
}

void work() {
    while (scanf("%d%d", &n, &m) != EOF) {
        init();
        for (int i = 1; i <= m; i++) {
            int a, b, c, t;
            scanf("%d%d%d%d", &a, &b, &c, &t);
            ins(a, b, t, c);
        }
        printf("%lld\n", Dijkstra());
    }
}

int main() {
#ifndef ONLINE_JUDGE
    //freopen("1.in", "r", stdin);
#endif
    int t = 1, Case = 1;
    //cin >> t;
    while (t--) {
        //  printf("Case %d: ", Case++);
        work();
    }
    return 0;
}