hdu - 4281 - Judges' response - dp / 01背包 / mTSP

题意：给n个点，每个的费用为c[i]，坐标为x[i], y[i]。背包容量为m。走在路上的速度为1.

1.求最少需要多少个背包。

2.设有无限个背包，求最小花费在路上的时间。

题解：

1.状压，先枚举所有子集，将总费用小于等于m的合法情况记录下来，作为物品。

2.先用TSP将所有合法情况（上一问中的物品）的权值计算出来（回到0点的最小距离）。

#include <bits/stdc++.h>
//#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

#define ll long long
#define SZ(x) ((int)(x).size()) 
#define ALL(v) (v).begin(), (v).end()
#define foreach(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)
#define reveach(i, v) for (__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++ i) 
#define REP(i,a,n) for ( int i=a; i<int(n); i++ )
#define FOR(i,a,n) for ( int i=n-1; i>= int(a);i-- )
#define lson rt<<1, L, m
#define rson rt<<1|1, m, R
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define fi first
#define se second
#define CLR(a, b) memset(a, b, sizeof(a))
#define Min(a, b) a = min(a, b)
#define Max(a, b) a = max(a, b)
const int maxn = 16;
const int maxm = 1e5 + 7;
const int maxv = 1e3 + 7;
const int INF = 0x3f3f3f3f;
int n, m;
struct Point{
    int x, y;
    Point(){}
    Point(int a, int b){x = a, y = b;}
}p[maxn];
int c[maxn];
int a[1 << maxn];
int cnt;
int dp[1 << maxn];
int solve1(){
    CLR(dp, INF);
    dp[0] = 0;
    cnt = 0;
    REP(s, 1, 1 << n){
        int t = 0;
        REP(i, 0, n){
            if((s >> i) & 1){
                t += c[i];
            }
        }
        if(t <= m) a[cnt ++] = s;
    }
    REP(i, 0, cnt){
        int S = (1 << n) - 1 - a[i];
        for(int s = S; s; s = (s - 1) & S){
            Min(dp[s+a[i]], dp[s] + 1);
        }
        Min(dp[a[i]], dp[0] + 1);
    }
    return dp[(1 << n) - 1];
}
int d[maxn][maxn];
int v[1 << maxn];
int tsp[1 << maxn][maxn];
int best[1 << maxn];
int solve2(){
    CLR(d, 0);
    REP(i, 0, n) REP(j, 0, n) if(i != j)
        d[i][j] = ceil(sqrt((p[i].x - p[j].x) * (p[i].x - p[j].x) + (p[i].y - p[j].y) * (p[i].y - p[j].y)));

    CLR(tsp, INF);
    CLR(best, INF);
    tsp[1][0] = 0;
    REP(s, 1, 1 << n){
        REP(u, 0, n){
            if((s >> u) & 1){
                Min(best[s], tsp[s][u] + d[u][0]);
                REP(v, 0, n){
                    if(!((s >> v) & 1)){
                        Min(tsp[s|(1<<v)][v], tsp[s][u] + d[u][v]);
                    }
                }
            }
        }
    }
    //REP(s, 0, 1 << n) printf("%d %d\n", s, best[s]);

    CLR(dp, INF);
    dp[0] = 0;
    REP(i, 0, cnt) v[i] = best[a[i]];
    //REP(i, 0, cnt) printf("%d %d\n", i, v[i]);
    REP(i, 0, cnt){
        if((a[i] & 1) == 0) continue;
        int S = (1 << n) - 1 - a[i];
        for(int s = S; s; s = (s - 1) & S){
            Min(dp[s+a[i]], dp[s|1] + v[i]);
        }
        Min(dp[a[i]], dp[0] + v[i]);
    }
    return dp[(1 << n) - 1];
}
int main(){
#ifdef ac
    freopen("in.txt","r",stdin);
#endif
    //freopen("out.txt","w",stdout);
    while(~scanf("%d%d", &n, &m)){
        REP(i, 0, n) scanf("%d%d", &p[i].x, &p[i].y);
        REP(i, 0, n) scanf("%d", &c[i]);
        int ans1 = solve1();
        if(ans1 == INF) printf("-1 -1\n");
        else printf("%d %d\n", ans1, solve2());
    }
    return 0;
}