Codeforces Round #214 (Div. 2) C. Dima and Salad （背包变形）

C. Dima and Salad
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Dima, Inna and Seryozha have gathered in a room. That's right, someone's got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something.

Dima and Seryozha have n fruits in the fridge. Each fruit has two parameters: the taste and the number of calories. Inna decided to make a fruit salad, so she wants to take some fruits from the fridge for it. Inna follows a certain principle as she chooses the fruits: the total taste to the total calories ratio of the chosen fruits must equal k. In other words,  , where aj is the taste of the j-th chosen fruit and bj is its calories.

Inna hasn't chosen the fruits yet, she is thinking: what is the maximum taste of the chosen fruits if she strictly follows her principle? Help Inna solve this culinary problem — now the happiness of a young couple is in your hands!

Inna loves Dima very much so she wants to make the salad from at least one fruit.

Input

The first line of the input contains two integers n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10). The second line of the input contains n integersa1, a2, ..., an (1 ≤ ai ≤ 100) — the fruits' tastes. The third line of the input contains n integers b1, b2, ..., bn (1 ≤ bi ≤ 100) — the fruits' calories. Fruit number i has taste ai and calories bi.

Output

If there is no way Inna can choose the fruits for the salad, print in the single line number -1. Otherwise, print a single integer — the maximum possible sum of the taste values of the chosen fruits.

Sample test(s)
input
3 2
10 8 1
2 7 1
output
18
input
5 3
4 4 4 4 4
2 2 2 2 2
output
-1
Note

In the first test sample we can get the total taste of the fruits equal to 18 if we choose fruit number 1 and fruit number 2, then the total calories will equal 9. The condition  fulfills, that's exactly what Inna wants.

In the second test sample we cannot choose the fruits so as to follow Inna's principle.


题意：

给两个数组：a，b。然后让你从a数组中选取任意的几个数字，得到的和为sum1，然后除以相应b数组和sum2，要求sum1/sum2==k，求出满足要求的a数组中sum1最大的为多少，不存在输出-1。


思路：

其实这题就是背包变形，将 ai-k*bi 看做重量，将 ai 看做价值，总容量为 0 ，进行背包，最后满足条件的情况为背包恰好装满的情况，答案即为dp[0]。

因为 ai-k*bi 可以为负数，所以要将原点平移，可以预算一下， 原点到10000就够了，剩下的就是01背包的问题了，还需注意一点的是 重量为正和负的要分开考虑，WA了我好久才想明白。


代码：

 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#pragma comment (linker,"/STACK:102400000,102400000")
#define maxn 1005
#define MAXN 300005
#define mod 1000000007
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-6
typedef long long ll;
using namespace std;

int n,m,ans,k,flag,cnt;
int a[maxn],b[maxn];
int w[maxn];
int dp[MAXN];

bool solve()
{
    int i,j;
    memset(dp,-INF,sizeof(dp));
    dp[10000]=0;
    for(i=1; i<=n; i++)
    {
        if(w[i]>=0)
        {
            for(j=20000; j>=w[i]; j--)
            {
                if(dp[j-w[i]]!=-INF) dp[j]=max(dp[j],dp[j-w[i]]+a[i]);
            }
        }
        else
        {
            for(j=0;j<20000;j++)
            {
                if(dp[j-w[i]]!=-INF) dp[j]=max(dp[j],dp[j-w[i]]+a[i]);
            }
        }
    }
    ans=dp[10000];
    if(ans==0) return false ;
    return true ;
}
int main()
{
    int i,j;
    while(~scanf("%d%d",&n,&k))
    {
        for(i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=1; i<=n; i++)
        {
            scanf("%d",&b[i]);
        }
        for(i=1; i<=n; i++)
        {
            w[i]=a[i]-k*b[i];
        }
        if(solve()) printf("%d\n",ans);
        else printf("-1\n");
    }
    return 0;
}


 





posted on 2013-12-11 12:31  love so much  阅读(356)  评论(0)  编辑  收藏  举报

导航