3312: [Usaco2013 Nov]No Change 状压DP

最新推荐文章于 2022-07-11 12:07:29 发布

Oakley_

最新推荐文章于 2022-07-11 12:07:29 发布

阅读量660

点赞数 2

文章标签： BZOJ DP 状压DP

本文链接：https://blog.csdn.net/Oakley_/article/details/52206392

版权

BZOJ 3312: [Usaco2013 Nov]No Change

Time Limit: 10 Sec Memory Limit: 128 MB

Submit: 162 Solved: 103

[ Submit][ Status][ Discuss]

Description

Farmer John is at the market to purchase supplies for his farm. He has in his pocket K coins (1 <= K <= 16), each with value in the range 1..100,000,000. FJ would like to make a sequence of N purchases (1 <= N <= 100,000), where the ith purchase costs c(i) units of money (1 <= c(i) <= 10,000). As he makes this sequence of purchases, he can periodically stop and pay, with a single coin, for all the purchases made since his last payment (of course, the single coin he uses must be large enough to pay for all of these). Unfortunately, the vendors at the market are completely out of change, so whenever FJ uses a coin that is larger than the amount of money he owes, he sadly receives no changes in return! Please compute the maximum amount of money FJ can end up with after making his N purchases in sequence. Output -1 if it is impossible for FJ to make all of his purchases.

K个硬币，要买N个物品。

给定买的顺序，即按顺序必须是一路买过去，当选定买的东西物品序列后，付出钱后，货主是不会找零钱的。现希望买完所需要的东西后，留下的钱越多越好，如果不能完成购买任务，输出-1

Input

Line 1: Two integers, K and N.

* Lines 2..1+K: Each line contains the amount of money of one of FJ's coins.

* Lines 2+K..1+N+K: These N lines contain the costs of FJ's intended purchases.

Output

* Line 1: The maximum amount of money FJ can end up with, or -1 if FJ cannot complete all of his purchases.

Sample Input

3 6
12
15
10
6
3
3
2
3
7

INPUT DETAILS: FJ has 3 coins of values 12, 15, and 10. He must make purchases in sequence of value 6, 3, 3, 2, 3, and 7.

Sample Output

12
OUTPUT DETAILS: FJ spends his 10-unit coin on the first two purchases, then the 15-unit coin on the remaining purchases. This leaves him with the 12-unit coin.

题解:
看到k<=16，状压dp不解释
需要预处理每个硬币从每个物品开始连续购买最多能购买到第几个。
(第一次写状压dp可能比较丑...)

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=100005;
const int K=20;
const int P=262144;
int v[K],c[N],k,n;
int f[K][N],dp[P],s[K],tot,ans;
bool flag;
int main()
{
	scanf("%d%d",&k,&n);
	for(int i=1;i<=k;i++)
	{
	    scanf("%d",&v[i]);
	    tot+=v[i];
	}
	for(int i=1;i<=n;i++) scanf("%d",&c[i]);
	s[1]=1;
    for(int i=2;i<=k;i++) s[i]=s[i-1]*2;
    for(int i=1;i<=k;i++)
    {
    	int t=0,sum=0;
		for(int j=1;j<=n;j++)
    	{
	    	while(sum+c[t+1]<=v[i]&&t<n) sum+=c[++t];
	    	f[i][j]=t;
	    	sum-=c[j];
	    }
    }
    int e=s[k]*2-1;
    for(int i=1;i<=e;i++)
    {
	    int sum=0,x=i; 
		for(int j=k;j>=1;j--)
		if(x>=s[j])
		{
			x-=s[j];
	    	sum+=v[j];
			dp[i]=max(dp[i],f[j][dp[i-s[j]]+1]);
 		}
 		if(dp[i]==n) ans=max(ans,tot-sum),flag=true;
	}
	if(!flag) printf("-1"); 
	else printf("%d",ans);
}