【JSOI2016】【BZOJ4753】最佳团体

【题目链接】

• BZOJ4753

【前置技能】

• 二分答案
• 树上背包

【题解】

• 先二分一下答案（据说这个二分答案的过程也可以叫做0/1分数规划），假设现在二分的答案为$mid$，检查是否存在符合条件的$\frac{\sum P_i}{\sum S_i}\ge mid$，移项整理，得到$\sum P_i-mid\ast \sum S_i\ge 0$，交换求和顺序即$\sum (P_i-mid\ast S_i)\ge 0$。
• 二分答案后将每个点的权值定为$P_i-mid\ast S_i$，然后做树上背包，取根的答案进行判断。
• 时间复杂度$O(logPRECISION\ast N^2)$

【代码】

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define LL  long long
#define MAXN    2510
using namespace std;
int n, k, s[MAXN], p[MAXN], size[MAXN];
double w[MAXN], f[MAXN][MAXN];
vector <int> a[MAXN];
 
template <typename T> void chkmin(T &x, T y){x = min(x, y);}
template <typename T> void chkmax(T &x, T y){x = max(x, y);}
template <typename T> void read(T &x){
    x = 0; int f = 1; char ch = getchar();
    while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
    while (isdigit(ch)) {x = x * 10 + ch - '0'; ch = getchar();}
    x *= f;
}
 
void dfs(int pos, int dad){
    size[pos] = 1;
    f[pos][0] = 0;
    for (unsigned i = 0, si = a[pos].size(); i < si; ++i){
        int son = a[pos][i];
        if (son != dad){
            dfs(son, pos);
            size[pos] += size[son];
            for (int j = min(size[pos], k); j >= 0; --j){
                for (int t = max(0, j - size[pos] + size[son]); t <= min(size[son], j); ++t){
                    if (f[pos][j - t] == -INF || f[son][t] == -INF) continue;
                    chkmax(f[pos][j], f[pos][j - t] + f[son][t]);
                }
            }
        }
    }
    for (int i = k; i >= 1; --i)
        f[pos][i] = f[pos][i - 1] + w[pos];
}
 
int main(){
    read(k), read(n);
    double l = INF, r = -INF;
    for (int i = 2; i <= n + 1; ++i){
        int u; read(s[i]), read(p[i]), read(u);
        chkmax(r, 1.0 * p[i] / s[i]);
        chkmin(l, 1.0 * p[i] / s[i]);
        ++u;
        a[u].push_back(i);
        a[i].push_back(u);
    }
    ++n, ++k;
    while (l + 0.0001 < r){
        double mid = (l + r) / 2;
        for (int i = 1; i <= n; ++i)
            w[i] = 1.0 * p[i] - mid * s[i];
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                f[i][j] = -INF;
        dfs(1, 0);
        if (f[1][k] >= 0) l = mid;
        else r = mid;
    }
    dfs(1, 0);
    printf("%.3lf\n", l);
    return 0;
}