hdu 3433(dp+二分) A Task Process

题意：

有n个人，每个人完成一件A任务需要a[i]时间，完成一件B任务需要b[i]时间，问要完成x件A任务y件B任务所需的最短时间是多少?

思路

二分+DP。
二分时间t,dp[i][j]表示在时间t内前i个人完成j件A任务所能完成的B任务的最大数量。如果dp[i][x]>=y
就是可以的。然后不断迭代得到ans。

复杂度:

0(n*x^2*log(t)) t范围是40w

参考code:

/*
 #pragma warning (disable: 4786)
 #pragma comment (linker, "/STACK:0x800000")
 */
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <iterator>
#include <utility>
using namespace std;

template< class T > T _abs(T n) { return (n < 0 ? -n : n); }
template< class T > T _max(T a, T b) { return (!(a < b) ? a : b); }
template< class T > T _min(T a, T b) { return (a < b ? a : b); }
template< class T > T sq(T x) { return x * x; }
template< class T > T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a%b) : a); }
template< class T > T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); }
template< class T > bool inside(T a, T b, T c) { return a<=b && b<=c; }


#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define F(i, n) for(int (i)=0;(i)<(n);++(i))
#define rep(i, s, t) for(int (i)=(s);(i)<=(t);++(i))
#define urep(i, s, t) for(int (i)=(s);(i)>=(t);--(i))
#define repok(i, s, t, o) for(int (i)=(s);(i)<=(t) && (o);++(i))            
#define MEM0(addr) memset((addr), 0, sizeof((addr)))
#define MP(x, y) make_pair(x, y)
#define REV(s, e) reverse(s, e)
#define SET(p) memset(pair, -1, sizeof(p))
#define CLR(p) memset(p, 0, sizeof(p))
#define MEM(p, v) memset(p, v, sizeof(p))
#define CPY(d, s) memcpy(d, s, sizeof(s))
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define SZ(c) (int)c.size()
#define PB(x) push_back(x)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pii pair< int, int >
#define psi pair< string, int >
#define ls u << 1
#define rs u << 1 | 1
#define lson l, mid, u << 1
#define rson mid, r, u << 1 | 1

const int maxn = 300010;
const ll INF = 0x3f3f3f3f3f3fLL;

int dp[55][205];
int a[205],b[205];
int n,x,y;
int check(int t){
    MEM(dp,-1);
    dp[0][0] = 0;

    rep(i,1,n){
        if(dp[i][x] >= y) return 1;
        rep(j,0,x){
            if(dp[i-1][j] != -1){
                int tmp = min(t/a[i],x-j);
                rep(k,0,tmp){
                    int t1 = (t - a[i] * k) / b[i];
                    dp[i][j+k] = MAX(dp[i][j+k],dp[i-1][j]+t1);
                }
            }
        }
    }
    if(dp[n][x] >= y) return 1;
    else return 0;
}
int main(){
    //READ("in.txt");
    int t,kase = 1;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d%d",&n,&x,&y);
        rep(i,1,n) cin >> a[i] >> b[i];

        int l = 0;
        int r = a[1] * x + b[1] * y;
        int ans;
        while(l <= r){
            int mid = (l + r) >> 1;
            if(check(mid)){
                ans = mid;
                r = mid - 1;
            }else{
                l = mid + 1;
            }
        }
        printf("Case %d: %d\n",kase++,ans);
    }
    return 0;
}