A - Telephone Lines POJ - 3662 第k+1条边尽量小

最新推荐文章于 2022-07-28 20:23:32 发布

淡蓝色的狼

最新推荐文章于 2022-07-28 20:23:32 发布

阅读量173

点赞数

分类专栏：最短路径算法文章标签： poj

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.csdn.net/qq_36616023/article/details/78716687

版权

最短路径算法专栏收录该内容

12 篇文章 0 订阅

订阅专栏

题意是：装电话线，从1到n，而且报销k根电线，且只花费报销完的那些电线的最贵的那根，问需要花费多少钱》？

思路：二分枚举第k+1条边的长度，最短路径时当现在的这条边的长度>k+1边的长度时，置一，否则置0.具体看代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 20000;
int head[maxn], dis[maxn], cnt, n, m;
bool vis[maxn];
int k;
struct edge
{
    int v, w, next;
}Edge[maxn];
struct node
{
    int point, distance;
    node(){}
    node(int _point, int _distance) {point = _point; distance = _distance;}
    bool operator < (const node &other)const
    {
        return distance > other.distance;
    }
};
void add_Edge(int u, int v, int w)
{
    Edge[cnt].v = v;
    Edge[cnt].w = w;
    Edge[cnt].next = head[u];
    head[u] = cnt++;
}
void Dijkstra(int s,int mid)
{
    for(int i = 0; i <= n; i++)
        dis[i] = INF;
    memset(vis, false, sizeof(vis));
    dis[s] = 0;
    priority_queue<node> q;
    q.push(node(s, dis[s]));
    while(!q.empty())
    {
        node now = q.top();
        q.pop();
        if(vis[now.point])
            continue;
        vis[now.point] = true;
        for(int i = head[now.point]; i != -1; i = Edge[i].next)
        {
            int to = Edge[i].v;
            int tt=0;//做的小操作，注意，此题精髓
            if(Edge[i].w >= mid)
            {
                tt = 1;
            }
            if(dis[to] > dis[now.point] + tt)
            {
                dis[to] = dis[now.point] + tt;
                q.push(node(to, dis[to]));
            }
        }
    }
}

int solve(int mid)
{
     Dijkstra(1,mid);
     //printf("dis[n]:%d %d\n",mid,dis[n]);
     if(dis[n]>k)
     {
        return 1;
     }
     else
     {

        return 0;
     }
}
int main()
{
    int u, v, w;
    while(scanf("%d%d%d", &n, &m, &k) != EOF)
    {
        if(n == 0 && m == 0)
            break;
        cnt = 0;
        memset(head, -1, sizeof(head));
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d%d", &u, &v, &w);
            add_Edge(u, v, w);
            add_Edge(v, u, w);
        }
        Dijkstra(1,INF);
        if(dis[n]>=INF)
        {
            printf("-1\n");
            continue;
        }
        int l=0,r=INF;
        int ans=0;
        while(l<=r)//经典二分
        {
            int mid=(r-l)/2+l;
            if(solve(mid))
            {
                l=mid+1;
                ans=mid;
            }
            else
            {
                r=mid-1;
            }
        }
        cout << ans << endl;
    }
    return 0;
}