SDUT 旅行规划

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define ss second
#define ff first
#define pb push_back
#define eps 1e-7
// #define ls u << 1
// #define rs u << 1 | 1
using namespace std;
typedef pair<int, int> pii;
const int N = 1e4 + 10;
struct node
{
    int to, w, nxt, len;
} e[N];
int tot = 0;
int h[N];
void add(int u, int v, int len, int w)
{
    e[tot].w = w;
    e[tot].to = v;
    e[tot].len = len;
    e[tot].nxt = h[u];
    h[u] = tot++;
}
int dist[N], cost[N];
struct edge
{
    int len, w, ver;
    edge(int a, int b, int c)
    {
        len = a;
        w = b;
        ver = c;
    }
};
struct cmp
{
    bool operator()(const edge &a, const edge &b)
    {
        if (a.len == b.len)
            return a.w > b.w;
        return a.len > b.len;
    }
};
bool vis[N];
void dij(int st)
{
    memset(dist, 0x3f, sizeof dist);
    memset(cost, 0x3f, sizeof cost);
    dist[st] = 0;
    cost[st] = 0;
    priority_queue<edge, vector<edge>, cmp> q;
    q.push({0, 0, st});
    while (q.size())
    {
        auto t = q.top();
        q.pop();
        int ver = t.ver;
        int dis = t.len;
        int west = t.w;
        if (vis[ver] == 1)
            continue;
        vis[ver] = 1;
        for (int i = h[ver]; ~i; i = e[i].nxt)
        {
            int j = e[i].to;
            if (dist[j] > dis + e[i].len)
            {
                dist[j] = dis + e[i].len;
                cost[j] = west + e[i].w;
                q.push({dist[j], cost[j], j});
            }
            else if (dist[j] == dis + e[i].len && cost[j] > west + e[i].w)
            {
                cost[j] = west + e[i].w;
                q.push({dist[j], cost[j], j});
            }
        }
    }
}
void solve()
{
    memset(h, -1, sizeof h);
    int n, m, s, d;
    cin >> n >> m >> s >> d;
    for (int i = 1; i <= m; i++)
    {
        int u, v, len, w;
        cin >> u >> v >> len >> w;
        add(u, v, len, w);
        add(v, u, len, w);
    }
    // for (int i = 0; i < tot; i++)
    // {
    //     cout << e[i].w << endl;
    // }
    dij(s);
    cout << dist[d] << ' ' << cost[d] << endl;
}
signed main()
{
    IOS;
    int T = 1;
    // cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}

维护一个优先队列，里面放结构体，跑一遍堆优化的迪杰斯特拉就行。