P3115 [USACO15JAN] Dijkstra

题意

传送门 P3115 [USACO15JAN] Cow Routing

题解

建图只对航线相邻路线连边，此时对于各城市有抵达该市的航线数种状态，将城市的各状态看做将其拆成数个节点，根据当前边的航线索引与前驱节点的状态更新花费与路线数。

松弛条件改为优先使路径花费最小，再使通过的路线数（所搭乘各航线的各段路线数量）最小，$Dijkstra$ 求最短路即可。

#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f3f3f3f3f
#define maxn 1005
typedef long long ll;
typedef pair<ll, ll> P;
struct node
{
    ll v, d, cnt, id;
    bool operator<(const node &b) const
    {
        if (d != b.d)
            return d > b.d;
        return cnt > b.cnt;
    }
};
struct edge
{
    ll to, id;
};
vector<edge> G[maxn];
ll A, B, N, cost[maxn], num[maxn], dis[maxn][maxn], cnt[maxn][maxn];
bool used[maxn][maxn];

P dijkstra(int s, int t)
{
    priority_queue<node> q;
    memset(dis, 0x3f, sizeof(dis));
    memset(cnt, 0x3f, sizeof(cnt));
    dis[s][N] = cnt[s][N] = 0;
    q.push(node{s, 0, 0, N + 1});
    while (!q.empty())
    {
        node p = q.top();
        q.pop();
        if (used[p.v][p.id])
            continue;
        used[p.v][p.id] = 1;
        for (int i = 0; i < G[p.v].size(); i++)
        {
            edge &e = G[p.v][i];
            ll d2 = p.d + (p.id == e.id ? 0 : cost[e.id]);
            ll cnt2 = p.cnt + 1;
            if (d2 < dis[e.to][e.id] || (d2 == dis[e.to][e.id] && cnt2 < cnt[e.to][e.id]))
            {
                dis[e.to][e.id] = d2, cnt[e.to][e.id] = cnt2;
                q.push(node{e.to, d2, cnt2, e.id});
            }
        }
    }
    ll rd = -1, rn = -1;
    for (int i = 0; i <= N; i++)
    {
        if (dis[t][i] != inf)
        {
            if (rd == -1 || rd > dis[t][i] || (rd == dis[t][i] && rn > cnt[t][i]))
            {
                rd = dis[t][i], rn = cnt[t][i];
            }
        }
    }
    return P(rd, rn);
}

int main()
{
    scanf("%lld%lld%lld", &A, &B, &N);
    for (int i = 0; i < N; i++)
    {
        scanf("%lld%lld", cost + i, num + i);
        int pre, v;
        scanf("%d", &pre);
        for (int j = 1; j < num[i]; j++)
        {
            scanf("%d", &v);
            G[pre].push_back(edge{v, i});
            pre = v;
        }
    }
    P p = dijkstra(A, B);
    printf("%lld %lld\n", p.first, p.second);
    return 0;
}