牛客假日团队赛8 Telephone Lines

 

 

题目的大意就是从1到n的路选择k条将权值设置为0，然后找出最大的权值为花费的价值

二分枚举+ 最短路

ac代码如下

#include <bits/stdc++.h>
 
typedef long long ll;
typedef long long ld;
 
using namespace std;
 
const ll maxn = 1e5 + 7;

ll n,m,k;
struct node
{
	ll x,step;
	node(ll xx,ll ste)
	{
		x = xx;
		step = ste;
	}
};

bool operator < (const node a,const node b)
{
	return a.step > b.step; 
}

struct nod
{
	ll x,y,z;
	nod(ll xx,ll yy,ll zz)
	{
		x = xx;
		y = yy;
		z = zz;
	}
};
vector<nod> mp[maxn];
ll dis[maxn];

void check(ll mid)
{
	for(int i = 1; i <= n; i ++)
	{
		for(int j = 0; j < mp[i].size(); j ++)
		{
			ll val = mp[i][j].y;
			if(mp[i][j].y <= mid)
			{
				mp[i][j].z = 0;
			}
			else
			{
				mp[i][j].z = 1;
			}
		}
	}
}
void dij()
{
	priority_queue<node> q;
	q.push(node(1,0));
	memset(dis,0x3f,sizeof(dis));
	dis[1] = 0;
	bool flag[maxn] = {0};
	while(!q.empty())
	{
		node w = q.top();
		q.pop();
		if(flag[w.x])continue;
		flag[w.x] = 1;
		for(int i = 0; i < mp[w.x].size(); i ++)
		{
			ll to = mp[w.x][i].x;
			ll val = mp[w.x][i].z;
			if(dis[to] > w.step + val && !flag[to])
			{
				dis[to] = w.step + val;
				q.push(node(to,dis[to]));
			} 
		}
	}
	
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	
	cin >> n >> m >> k;
	ll ma = 0;
	for(int i = 1; i <= m; i ++)
	{
		ll x,y,z;
		cin >> x >> y >> z;
		mp[x].push_back(nod(y,z,0));
		mp[y].push_back(nod(x,z,0));
		ma = max(ma,z);
	}
	
	if(m <= k)
	{
		cout << 0 << endl;
		return 0;
	}
	
	ll l = 0,r = 10000000000,p = -1;
	
	while(l <= r)
	{
		ll mid = (l + r) / 2;
		check(mid);
		dij();
		if(dis[n] <= k)
		{
			r = mid - 1;
			p = mid;
		} 
		else
		{
			l = mid + 1;
		}
	}
	
	cout << p << endl;
	
	return 0;
}