【DP】 ZOJ 3812 We Need Medicine

朴素的DP是dp[i][j][k]代表用掉前i个药，达到j的重量，k的药效。。。。然后用状压压缩最后一维，用滚动数组优化掉第一维。。。。然后就可以了。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 400005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
//typedef vector<int>::iterator IT;
typedef long long LL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

LL dp[maxn];
int ans[maxn][60];
int a[405], b[405];
map<LL, int> mpp;
int n, m;
void work(void)
{
	memset(dp, 0, sizeof dp);
	memset(ans, 0, sizeof ans);
	dp[0] = 1;
	for(int i = 1; i <= n; i++) {
		scanf("%d%d", &a[i], &b[i]);
		for(int j = 200000; j >= b[i]; j--) {
			LL t = dp[j];
			dp[j] |= (dp[j - b[i]] << a[i]) & ((1ll << 51) - 1);
			t ^= dp[j];
			while(t) {
				LL low = lowbit(t);
				ans[j][mpp[low]] = i;
				t ^= low;
			}
		}
	}
	int aa, bb;
	while(m--) {
		scanf("%d%d", &aa, &bb);
		if(!ans[bb][aa]) printf("No solution!\n");
		else {
			printf("%d", ans[bb][aa]);
			int t = ans[bb][aa];
			aa -= a[t], bb -= b[t];
			while(ans[bb][aa]) {
				printf(" %d", ans[bb][aa]);
				t = ans[bb][aa];
				aa -= a[t], bb -= b[t];
			}
			printf("\n");
		}
	}
}
int main(void)
{
	int _;
	for(int i = 0; i <= 52; i++) mpp[1ll << i] = i;
	while(scanf("%d", &_)!=EOF) {
		while(_--) {
			scanf("%d%d", &n, &m);
			work();
		}
	}
	return 0;
}