BZOJ1196(HNOI2006)[公路修建问题]--二分

【链接】
bzoj1196

【解题报告】

求最大值的最小值。

典型的二分题。

#include<cstdio>
using namespace std;
const int maxn=10005,maxm=20005;
int n,K,L,R,m,fa[maxn];
struct Edge
{
    int x,y,c1,c2;
}a[maxm];
inline char nc()
{
    static char buf[100000],*l,*r;
    if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
    if (l==r) return EOF; return *l++;
}
inline int Read()
{
    int res=0,f=1; char ch=nc(),cc=ch;
    while (ch<'0'||ch>'9') cc=ch,ch=nc();
    if (cc=='-') f=-1;
    while (ch>='0'&&ch<='9') res=res*10+ch-48,ch=nc();
    return res*f;
}
int Getfa(int x)
{
    if (x==fa[x]) return x;
    fa[x]=Getfa(fa[x]);
    return fa[x];
}
bool Check(int x)
{
    for (int i=1; i<=n; i++) fa[i]=i;
    int now=0;
    for (int i=1; i<m; i++)
    {
        if (a[i].c1>x) continue;
        int x=Getfa(a[i].x),y=Getfa(a[i].y);
        if (x!=y) fa[x]=y,now++;
        if (now==K) break;
    }
    if (now<K) return 0;
    for (int i=1; i<m; i++)
    {
        if (a[i].c2>x) continue;
        int x=Getfa(a[i].x),y=Getfa(a[i].y);
        if (x!=y) fa[x]=y,now++;
        if (now==n-1) break;
    }
    if (now<n-1) return 0;
    return 1;
}
int main()
{
    freopen("1196.in","r",stdin);
    freopen("1196.out","w",stdout);
    n=Read(); K=Read(); m=Read();
    for (int i=1; i<m; i++) a[i]=(Edge){Read(),Read(),Read(),Read()};
    L=0; R=30000;
    while (L<=R)
    {
        int mid=(R-L>>1)+L;
        if (Check(mid)) R=mid-1; else L=mid+1;
    }
    printf("%d",L);
    return 0;
}