https://vjudge.net/problem/POJ-1742
多重部分和,常规dp超时
超时思路 : 枚举每一种硬币,如果合理则bool数组为1
超时代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
bool dp[105][100005];
int main()
{
int n, m;
int val[105], num[105];
while(scanf("%d%d", &n, &m) != EOF && (n + m))
{
for(int i = 1; i <= n; i ++)
scanf("%d", &val[i]);
for(int i = 1; i <= n; i ++)
scanf("%d", &num[i]);
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for(int i = 1; i <= n; i ++)
for(int j = 0; j <= m; j ++)
for(int k = 0; k <= num[i] && k * val[i] <= j; k ++)
dp[i][j] |= dp[i-1][j-k*val[i]];
int ans = 0;
for(int i = 1; i <= m; i ++)
if(dp[n][i]) ans ++;
printf("%d\n", ans);
}
return 0;
}
尝试使用了一维滚动数组进行空间优化
但是发无论怎样结果都等于m,究其原因是因为未对硬币数目进行有效的控制,导致同一种硬币无限枚举
wa代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
bool dp[100005];
int main()
{
int n, m;
int val[105], num[105];
while(scanf("%d%d", &n, &m) != EOF && (n + m))
{
for(int i = 1; i <= n; i ++)
scanf("%d", &val[i]);
for(int i = 1; i <= n; i ++)
scanf("%d", &num[i]);
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for(int i = 1; i <= n; i ++)
for(int j = 0; j <= m; j ++)
for(int k = 0; k <= num[i] && k * val[i] <= j; k ++)
dp[j] |= dp[j-k*val[i]];
int ans = 0;
for(int i = 1; i <= m; i ++)
if(dp[i]) ans ++;
printf("%d\n", ans);
}
return 0;
}
参阅白书,看到了另一种优化,同样化为一维数组,但是不是bool数组,用int数组保存当前硬币剩余数目,这样同时实现了空间和时间的优化(把第三维的枚举优化到了int数组的数值中),原来一开始就被误导用了bool数组啊。。
排除一切不合理,剩下的就是合理啦
AC代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
int dp[100005];
int main()
{
int n, m;
int val[105], num[105];
while(scanf("%d%d", &n, &m) != EOF && (n + m))
{
for(int i = 1; i <= n; i ++)
scanf("%d", &val[i]);
for(int i = 1; i <= n; i ++)
scanf("%d", &num[i]);
memset(dp, -1, sizeof(dp));
dp[0] = 0;
for(int i = 1; i <= n; i ++)
for(int j = 0; j <= m; j ++)
{
if(dp[j] >= 0) dp[j] = num[i]; //从当前数值开始限制硬币数目
else if(j < val[i] || dp[j - val[i]] <= 0) dp[j] = -1;//排除不合理的情况
else dp[j] = dp[j - val[i]] - 1;
}
int ans = 0;
for(int i = 1; i <= m; i ++)
if(dp[i] >= 0) ans ++;
printf("%d\n", ans);
}
return 0;
}