pat1030 Travel Plan

题意：n个城市，m条地铁，每条地铁有一个距离和费用，输入起点和终点，输出起点到终点的最短路径，若距离相等，输出费用最小的。

思路：最短路径的裸题，spfa即可，或者dijkstra。

代码

spfa

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <climits>

using namespace std;

const int MAX_N = 510;

struct Data {
    int to, nxt, d, c;
}e[MAX_N * MAX_N];
int head[MAX_N], inq[MAX_N], d[MAX_N], c[MAX_N], from[MAX_N], cnt = 1;
int n, m, a, b;

void ins(int u, int v, int d, int c) {
    cnt++;
    e[cnt].to = v; e[cnt].d = d; e[cnt].c = c;
    e[cnt].nxt = head[u]; head[u] = cnt;
    cnt++;
    e[cnt].to = u; e[cnt].d = d; e[cnt].c = c;
    e[cnt].nxt = head[v]; head[v] = cnt;
}

void spfa(int x) {
    memset(inq, 0, sizeof(inq));
    memset(from, -1, sizeof(from));
    fill(d, d + n, INT_MAX);
    fill(c, c + n, INT_MAX);
    queue<int> q; q.push(x); inq[x] = 1; d[x] = 0; c[x] = 0;
    while (!q.empty()) {
        int t = q.front(); q.pop();
        for (int i = head[t]; i; i = e[i].nxt) {
            if (d[t] + e[i].d < d[e[i].to]) {
                d[e[i].to] = d[t] + e[i].d;
                c[e[i].to] = c[t] + e[i].c;
                from[e[i].to] = t;
                if (!inq[e[i].to]) inq[e[i].to] = 1, q.push(e[i].to);
            } else if (d[t] + e[i].d == d[e[i].to] && c[t] + e[i].c < c[e[i].to]) {
                c[e[i].to] = c[t] + e[i].c;
                from[e[i].to] = t;
                if (!inq[e[i].to]) inq[e[i].to] = 1, q.push(e[i].to);
            }
        }
        inq[t] = 0;
    }
}

int ans[MAX_N], len = 0;

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    scanf("%d %d %d %d", &n, &m, &a, &b);
    memset(head, 0, sizeof(head));
    cnt = 1;
    int x, y, dd, cc;
    for (int i = 0; i < m; i++) {
        scanf("%d %d %d %d", &x, &y, &dd, &cc);
        ins(x, y, dd, cc);
    }
    spfa(a); len = 0; ans[len++] = b;
    int t = b;
    while (from[t] != -1) {
        ans[len++] = from[t];
        t = from[t];
    }
    reverse(ans, ans+len);
    for (int i = 0; i < len; i++) {
        printf("%d ", ans[i]);
    }
    printf("%d %d\n", d[b], c[b]);
    return 0;
}

dijkstra

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <climits>

using namespace std;

const int MAX_N = 510;

struct Data {
    int to, nxt, d, c;
}e[MAX_N * MAX_N];
int head[MAX_N], inq[MAX_N], d[MAX_N], c[MAX_N], from[MAX_N], cnt = 1;
int n, m, a, b;

void ins(int u, int v, int d, int c) {
    cnt++;
    e[cnt].to = v; e[cnt].d = d; e[cnt].c = c;
    e[cnt].nxt = head[u]; head[u] = cnt;
    cnt++;
    e[cnt].to = u; e[cnt].d = d; e[cnt].c = c;
    e[cnt].nxt = head[v]; head[v] = cnt;
}


struct Node {
    int to, d, c;
    Node() {}
    Node(int _to, int _d, int _c) : to(_to), d(_d), c(_c) {}
    bool operator < (const Node& node) const {
        return d < node.d || (d == node.d && c < node.c);
    }
    bool operator > (const Node& node) const {
        return d > node.d || (d == node.d && c > node.c);
    }
};
void dij(int x) {
    memset(from, -1, sizeof(from));
    fill(d, d + n, INT_MAX);
    fill(c, c + n, INT_MAX);
    priority_queue<Node, vector<Node>, greater<Node>> pq;
    pq.push(Node(x, 0, 0));
    d[x] = 0; c[x] = 0;
    while (!pq.empty()) {
        Node nod = pq.top(); pq.pop();
        for (int i = head[nod.to]; i; i = e[i].nxt) {
            if (d[nod.to] + e[i].d < d[e[i].to]) {
                d[e[i].to] = d[nod.to] + e[i].d;
                c[e[i].to] = c[nod.to] + e[i].c;
                from[e[i].to] = nod.to;
                pq.push(Node(e[i].to, d[e[i].to], c[e[i].to]));
            } else if (d[nod.to] + e[i].d == d[e[i].to] && c[nod.to] + e[i].c < c[e[i].to]) {
                c[e[i].to] = c[nod.to] + e[i].c;
                from[e[i].to] = nod.to;
                pq.push(Node(e[i].to, d[e[i].to], c[e[i].to]));
            }
        }
    }
}

int ans[MAX_N], len = 0;

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    scanf("%d %d %d %d", &n, &m, &a, &b);
    memset(head, 0, sizeof(head));
    cnt = 1;
    int x, y, dd, cc;
    for (int i = 0; i < m; i++) {
        scanf("%d %d %d %d", &x, &y, &dd, &cc);
        ins(x, y, dd, cc);
    }
    dij(a);
    len = 0; ans[len++] = b;
    int t = b;
    while (from[t] != -1) {
        ans[len++] = from[t];
        t = from[t];
    }
    reverse(ans, ans+len);
    for (int i = 0; i < len; i++) {
        printf("%d ", ans[i]);
    }
    printf("%d %d\n", d[b], c[b]);
    return 0;
}