poj 3662 Telephone Lines（最短路+二分）

Telephone Lines

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6973		Accepted: 2554

Description

Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables required to connect his farm to the phone system.

There are N (1 ≤ N ≤ 1,000) forlorn telephone poles conveniently numbered 1..N that are scattered around Farmer John's property; no cables connect any them. A total of P (1 ≤ P ≤ 10,000) pairs of poles can be connected by a cable; the rest are too far apart.

The i-th cable can connect the two distinct poles A_i and B_i, with length L_i (1 ≤ L_i ≤ 1,000,000) units if used. The input data set never names any {A_i, B_i} pair more than once. Pole 1 is already connected to the phone system, and pole N is at the farm. Poles 1 and N need to be connected by a path of cables; the rest of the poles might be used or might not be used.

As it turns out, the phone company is willing to provide Farmer John with K (0 ≤ K < N) lengths of cable for free. Beyond that he will have to pay a price equal to the length of the longest remaining cable he requires (each pair of poles is connected with a separate cable), or 0 if he does not need any additional cables.

Determine the minimum amount that Farmer John must pay.

Input

* Line 1: Three space-separated integers: N, P, and K
* Lines 2..P+1: Line i+1 contains the three space-separated integers: A_i, B_i, and L_i

Output

*
Line 1: A single integer, the minimum amount Farmer John can pay. If it
is impossible to connect the farm to the phone company, print -1.

Sample Input

5 7 1
1 2 5
3 1 4
2 4 8
3 2 3
5 2 9
3 4 7
4 5 6

Sample Output

4

Source

USACO 2008 January Silver

这题意有毒  题意是

n个农场  每个农场通电话需要w[i]长度的电话线  其中k根电话线免费 

费用是这样定义的  除去这k根免费的电话线 剩下的最长的电话线作为花费的费用 问求最少花费的费用是多少 就是求第k+1大线的最小

我们二分答案  x；

用dijkstra算法  假如 边值>x  边值=1  否则等于0

所以我们只有统计这这条路径大于x的个数  如果大于k个 证明x还可以变大

否则x变小

 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cctype>
 #include<cmath>
 #include<queue>
 #include<cstring>
 #include<map>
 #include<stack>
 #include<set>
 #include<vector>
 #include<algorithm>
 #include<string.h>
 typedef long long ll;
 typedef unsigned long long LL;
 using namespace std;
 const int INF=0x3f3f3f3f;
 const double eps=0.0000000001;
 const int N=+;
 struct node{
     int to,next,w;
     bool operator<(const node &a)const{
         return w>a.w;
     }
 }edge[N*];
 int t;
 int head[N];
 int vis[N],dis[N];
 int n;
 void init(){
     memset(vis,,sizeof(vis));
     memset(head,-,sizeof(head));
     t=;
     for(int i=;i<N;i++)dis[i]=INF;
 }
 void add(int u,int v,int w){
     edge[t].to=v;
     edge[t].w=w;
     edge[t].next=head[u];
     head[u]=t++;
 }
 int Dijkstra(int x,int y){
     memset(dis,INF,sizeof(dis));
     dis[x]=;
     node t1,t2;
     t1.to=x;
     priority_queue<node>q;
     q.push(t1);
     memset(vis,,sizeof(vis));
     while(!q.empty()){
         //cout<<2<<endl;
         t1=q.top();
         q.pop();
         int u=t1.to;
         if(vis[u]==)continue;
         vis[u]=;
         for(int i=head[u];i!=-;i=edge[i].next){
             int v=edge[i].to;
             int tt=;
             if(edge[i].w>=y)tt=;
             if(vis[v]==&&dis[v]>dis[u]+tt){
                 dis[v]=dis[u]+tt;
                 t2.to=v;
                 t2.w=dis[v];
                 q.push(t2);
             }
         }
     }
     return dis[n];
 }
 int main(){
     int k,p;
     while(scanf("%d%d%d",&n,&p,&k)!=EOF){
         init();
         int maxx=;
         for(int i=;i<p;i++){
             int u,v,w;
             scanf("%d%d%d",&u,&v,&w);
             add(u,v,w);
             add(v,u,w);
             maxx=max(maxx,w);
         }
         int low=;
         int high=maxx;
         int ans=;
         while(low<=high){
             int mid=(low+high)>>;
             //cout<<Dijkstra(1,mid)<<endl;
             if(Dijkstra(,mid)<=k){
                 high=mid-;
             }
             else{
                 ans=mid;
                 low=mid+;
             }

         }
         if(low>maxx){cout<<-<<endl;continue;}
         cout<<ans<<endl;
         //for(int i=1;i<=n;i++)cout<<dis[i]<<endl;
     }
 }