HDU6000 Wash 二分+贪心

简略题意：L件衣服，n个洗衣机，m个甩干机，问最短多少时间可以洗完所有衣服并甩干。

首先二分时间，得到每个洗衣机能最多在这段时间洗多少衣服，从而得到洗完每个衣服的时间是多少。
同理二分时间，得到每个甩干机能最多在这段时间甩干多少衣服，从而得到甩干每个衣服的时间是多少。

那么我们只要贪心的把最早洗完的衣服最晚甩干，从而使得全局时间花费最小即可。

#define others
#ifdef poj
#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#endif // poj
#ifdef others
#include <bits/stdc++.h>
#endif // others
//#define file
#define all(x) x.begin(), x.end()
using namespace std;
const double eps = 1e-8;
int dcmp(double x) { if(fabs(x)<=eps) return 0; return (x>0)?1:-1;};
typedef long long LL;

namespace solver {
    int t;
    LL L;
    LL n, m;
    int w[110000], d[110000];

    bool check1(LL x) {
        LL sum = 0;
        for(int i = 1; i <= n; i++) {
            sum += x/w[i];
            if(sum >= L) return 1;
        }
        return sum >= L;
    }
    bool check2(LL x) {
        LL sum = 0;
        for(int i = 1; i <= m; i++) {
            sum += x/d[i];
            if(sum >= L) return 1;
        }
        return sum >= L;
    }
    int f = 0;
    void solve() {
        scanf("%d", &t);
        while(t--) {vector<LL> v1, v2;
            scanf("%lld%lld%lld", &L, &n, &m);
            for(int i = 1; i <= n; i++) scanf("%d", &w[i]);
            for(int i = 1; i <= m; i++) scanf("%d", &d[i]);
            LL ans = 0;
            LL l = 0, r = 1e18, M;
            while(l < r) {
                M = l + r >> 1;
                if(check1(M)) r = M;
                else l = M + 1;
            }
            LL ans1 = l;
            l = 0, r = 1e18, M;
            while(l < r) {
                M = l + r >> 1;
                if(check2(M)) r = M;
                else l = M + 1;
            }
            LL ans2 = l;
            for(int i = 1; i <= n; i++) {
                LL v = ans1/w[i];
                for(int j = 0; j < v; j++)
                    v1.push_back((1LL*(j+1)*w[i]));
            }
            for(int i = 1; i <= m; i++) {
                LL v = ans2/d[i];
                for(int j = 0; j < v; j++)
                    v2.push_back((1LL*(j+1)*d[i]));
            }
            sort(all(v1));
            sort(all(v2));
            for(int i = 0; i < L; i++)
                ans = max(ans, 1LL*v1[i]+v2[L-1-i]);
            printf("Case #%d: %lld\n", ++f, ans);
        }
    }
}

int main() {
    #ifdef file
    freopen("gangsters.in", "r", stdin);
    freopen("gangsters.out", "w", stdout);
    #endif // file
    solver::solve();
    return 0;
}