LuoguP3092 No Change——状压DP

题目描述

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(1 <= K <= 16)个硬币，面值的范围是1..100,000,000。

约翰想按顺序买 N个物品(1 <= N <= 100,000)，第i个物品需要花费c(i)块钱，(1 <= c(i) <= 10,000)。

在依次进行的购买N个物品的过程中，约翰可以随时停下来付款，每次付款只用一个硬币，支付购买的内容是从上一次支付后开始到现在的这些所有物品（前提是该硬币足以支付这些物品的费用）。不幸的是，商场的收银机坏了，如果约翰支付的硬币面值大于所需的费用，他不会得到任何找零。

请计算出在购买完N个物品后，约翰最多剩下多少钱。如果无法完成购买，输出-1
输入输出格式
输入格式：

• 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.

输出格式：

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

输入输出样例
输入样例#1：
3 6
12
15
10
6
3
3
2
3
7

输出样例#1：

12

说明

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.

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.

---

因为硬币只有16个，所以我们可以用壮压DP来做。
我们用$i$枚举选择硬币的每一种情况（1表示选了硬币，0表示不选）。那么$f[i]$表示$i$情况时所能按顺序买到的最多的商品数。那么$f[i]$肯定是从$f[j]$（$j$是$i$在二进制下某位从1变成0后的数，比如$i$是$111$,那么$j$可以是$110、101、011$）推来了。$f[i]$也就是$f[j]$情况下的数加上再用选的硬币能买到的数。所以有以下方程：

f[i]=max(f[i],find(sum[f[i^(1<<(j-1))]]+a[j]));

其中$find(x)$就表示话费$x$元钱，可以买到的商品的位置。显然我们只要求出商品的前缀和，$find$函数就可以二分解决了。最后统计答案的时候就是对于每一个$f[i]>=n$，求出它们没选的硬币的总价值，然后取$max$即可。

#include<bits/stdc++.h>
using namespace std;
int read(){
    char c;int x;while(c=getchar(),c<'0'||c>'9');x=c-'0';
    while(c=getchar(),c>='0'&&c<='9') x=x*10+c-'0';return x;
}
int n,m,a[20],b[100005],sum[100005],f[100005],ans,flag;
int find(int x){
    int l=0,r=m,mid,ans;
    while(l<=r){
        mid=(l+r)>>1;
        if(x>=sum[mid]) l=mid+1,ans=mid;
        else r=mid-1;
    }
    return ans;
}
int calc(int x){
    int res=0;
    for(int i=1;i<=n;i++)
     if((x&(1<<(i-1)))==0) res+=a[i];
    return res;
}
int main()
{
    n=read();m=read();
    for(int i=1;i<=n;i++) a[i]=read();
    for(int i=1;i<=m;i++) b[i]=read(),sum[i]=sum[i-1]+b[i];
    for(int i=0;i<(1<<n);i++)
     for(int j=1;j<=n;j++){
        if((i&(1<<(j-1)))==0) continue;
        f[i]=max(f[i],find(sum[f[i^(1<<(j-1))]]+a[j]));
     }
    for(int i=0;i<(1<<n);i++)
     if(f[i]==m) flag=1,ans=max(ans,calc(i));
    if(flag) printf("%d",ans);
    else puts("-1");
    return 0;
}