EOJ 2026/POJ 3662/USACO 2008 Jan. Telephone Lines「spfa + 二分」

题目简介

---

求从点1到点n第(k+1)长的路径的最小值。

说明

---

二分第(k+1)长的路径的长度，小于这个长度的可以看作权值为0， 大于这个长度的可以看作权值为1。跑spfa作为二分的判断条件。

#include <bits/stdc++.h>
using namespace std;

const int INF = 0x3f3f3f3f;
const int maxn = 1005;
struct edge
{
    int nxt, from, to, w;
}g[maxn*20];
int n, m, k, cnt, dis[maxn], head[maxn], mp[maxn][maxn];
bool vis[maxn];

inline void add(int u, int v, int w)
{
    g[++cnt] = (edge){head[u], u, v, w};
    head[u] = cnt;
}

inline bool spfa(int length)
{
    for (int i = 1; i <= n; ++i)
    {
        dis[i] = INF;
        vis[i] = false;
    }
    for (int i = 1; i < maxn; ++i)
        for (int j = 1; j < maxn; ++j)
            mp[i][j] = -1;
    for (int i = 1; i <= cnt; ++i)
        if (g[i].w > length)
            mp[g[i].from][g[i].to] = mp[g[i].to][g[i].from] = 1;
        else
            mp[g[i].from][g[i].to] = mp[g[i].to][g[i].from] = 0;

    queue<int> q;
    dis[1] = 0; vis[1] = true;
    q.push(1);
    while (!q.empty())
    {
        int u = q.front(); q.pop();
        vis[u] = false;
        for (int i = 1; i <= n; ++i)
            if (~mp[u][i] && dis[i] > dis[u] + mp[u][i])
            {
                dis[i] = dis[u] + mp[u][i];
                if (!vis[i])
                {
                    vis[i] = true;
                    q.push(i);
                }
            }
    }
    return dis[n] <= k;
}

int main()
{
    int u, v, w, l = 0, r = 0, ans = -1;
    cin >> n >> m >> k;
    for (int i = 1; i <= m; ++i)
    {
        scanf("%d%d%d", &u, &v, &w);
        add(u, v, w);
        add(v, u, w);
        r = max(r, w);
    }
    while (l <= r)
    {
        int mid = (l+r) >> 1;
        if (spfa(mid))
        {
            r = mid-1;
            ans = mid;
        } else l = mid+1;
    }
    printf("%d\n", ans);
    return 0;
}