2017 华东师范大学网赛 G. 铁路修复计划(二分+最小生成树)

思路：直接二分答案，然后求一下最小生成树看看花费是否满足M。注意M读入的时候不要读成int.

代码:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1e5+5;
struct node
{
    int u, v, t;
    double s;
    bool operator < (const node &a) const
    {
        return s < a.s;
    }
}e[maxn], tmp[maxn];
int n, m, pre[maxn];
double M;

int Find(int x)
{
    int r = x;
    while(pre[r] != r) r = pre[r];
    int i = x, j;
    while(i != r)
    {
        j = pre[i];
        pre[i] = r;
        i = j;
    }
    return r;
}

bool join(int x, int y)
{
    int a = Find(x);
    int b = Find(y);
    if(a != b)
    {
        pre[b] = a;
        return 1;
    }
    return 0;
}

bool judge(double x)
{
    for(int i = 1; i <= n; i++)
        pre[i] = i;
    for(int i = 1; i <= m; i++)
    {
        tmp[i].u = e[i].u;
        tmp[i].v = e[i].v;
        tmp[i].t = e[i].t;
        if(e[i].t == 1) tmp[i].s = e[i].s*x;
        else tmp[i].s = e[i].s;
    }
    double need = 0.0;
    sort(tmp+1, tmp+1+m);
    int cnt = 0;
    for(int i = 1; i <= m; i++)
    {
        if(join(tmp[i].u, tmp[i].v))
        {
            need += tmp[i].s;
            if(need > M*1.0) return 0;
            cnt++;
        }
        if(cnt == n-1) break;
    }
    return need <= M*1.0;
}

int main(void)
{
    while(cin >> n >> m >> M)
    {
        for(int i = 1; i <= m; i++)
            scanf("%d%d%lf%d", &e[i].u, &e[i].v, &e[i].s, &e[i].t);
        double l = 1.0, r = 1e15, ans = 1.0;
        while(r-l > 1e-6)
        {
            double mid = (l+r)/2.0;
            if(judge(mid)) ans = mid, l = mid;
            else r = mid;
        }
        printf("%.6f\n", ans);
    }
    return 0;
}