POJ-1170 Shopping Offers 状态压缩加背包

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#define inf 1000000005
#define mem(a) memset(a, 0, sizeof(a))
using namespace std;

int shu[1005], dp[8000], vt[105], v[1005], statu[105];
int n, nt;

int huanliu(int nn)
{
	int liu[6] = {0}, w = 1, sum = 0;
    while((nn / 6) != 0)
    {
    	sum += (nn % 6) * v[w];
    	nn /= 6;
    	w++;
    }
    if(nn != 0)
    sum += (nn * v[w]);
    return sum;
}

int main(int argc, char *argv[])
{
	int i, j, num, status = 0, sumv = 0, geshu, nums;
	mem(vt);
	mem(shu);
	mem(statu);
	mem(v);
	memset(dp, inf, sizeof(dp));
	scanf("%d",&n);
	for(i = 1;i <= n;i++)
	{
		scanf("%d",&num);
		shu[num] = i;
		scanf("%d%d",&geshu, &v[i]);
		sumv += (geshu * v[i]);
		status += (geshu * (int)(pow(6.0, (double)(i - 1))));
	}
	dp[status] = sumv;
	scanf("%d",&nt);
	for(i = 1;i <= nt;i++)
	{
		scanf("%d",&num);
		for(j = 1;j <= num;j++)
		{
			scanf("%d", &nums);
			scanf("%d", &geshu);
			statu[i] += (geshu * (int)(pow(6.0, (double)(shu[nums] - 1))));
		}
		scanf("%d",&vt[i]);
	}
	dp[0] = 0;
	for(i = 1;i <= nt;i++)
	{
		for(j = 0;j <= status;j++)
		{
			if((j - statu[i]) >= 0)
			{
				dp[j] = min(dp[j], dp[j - statu[i]] + vt[i]);
			}
		}
	}
	for(i = 0;i <= status;i++)
	{
		dp[status] = min(dp[status], dp[i] + huanliu(status - i));
	}
	printf("%d\n", dp[status]);
	return 0;
}