2015 CCPC D题

Pick The Sticks

Time Limit: 15000/10000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)

The story happened long long ago. One day, Cao Cao made a special order called "Chicken Rib" to his army. No one got his point and all became very panic.However, Cao Cao himself felt very proud of his interesting idea and enjoyed it.

Xiu Yang, one of the cleverest counselors of Cao Cao, understood the command Rather than keep it to himself, he told the point to the whole army. Cao Cao got very angry at hiscleverness and would like to punish Xiu Yang. But how can you punish someone because he's clever? By looking at the chicken rib, he finally got a new idea to punish Xiu Yang.

He told Xiu Yang that as his reward of encrypting the special order, he could take as many gold sticks as possible from his desk. But he could only use one stick as the container.

Formally, we can treat the container stick as an L length segment. And the gold sticks as segments too. There were many gold sticks with different length ai and value vi .Xiu Yang needed to put these gold segments onto the container segment. No gold segment was allowed to be overlapped. Luckily, Xiu Yang came up with a good idea. On the two sidesof the container, he could make part of the gold sticks outside the container as long as the center of the gravity of each gold stick was still within the container. This couldhelp him get more valuable gold sticks.

As a result, Xiu Yang took too many gold sticks which made Cao Cao much more angry. Cao Cao killed Xiu Yang before he made himself home. So no one knows how many gold sticksXiu Yang made it in the container.

Can you help solve the mystery by finding out what's the maximum value of the gold sticks Xiu Yang could have taken?

Input

The first line of the input gives the number of test cases, T ( 1≤T≤100 ). T test cases follow.Each test case start with two integers, N ( 1≤N≤1000 ) and L ( 1≤L≤2000 ), represents the number of gold sticks and the length of the container stick. N lines follow.Each line consist of two integers, ai ( 1≤ai≤2000 ) and vi ( 1≤vi≤109 ), represents the length and the value of the ith gold stick.

Output

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1 ) and y is the maximum value of the gold sticks Xiu Yangcould have taken.

Sample input and output

Sample Input	Sample Output
4 3 7 4 1 2 1 8 1 3 7 4 2 2 1 8 4 3 5 4 1 2 2 8 9 1 1 10 3	Case #1: 2 Case #2: 6 Case #3: 11 Case #4: 3

Hint

In the third case, assume the container is lay on x -axis from 0 to 5 . Xiu Yang could put the second gold stick center at 0 and put the third gold stick center at 5 ,so none of them will drop and he can get total 2+9=11 value. In the fourth case, Xiu Yang could just put the only gold stick center on any position of [0,1] ,and he can get the value of 3 .

Source

The 2015 China Collegiate Programming Contest

题目大意：给你两个数n, l，紧接着n行，每行两个数字a，v；其中，l代表底层stick长度为l； a，v分别代表长度为a，价值为v的stick，求stick放在底层上面的最大价值（只能放一层）；
题解：零壹背包变形；
定义dp[i][k]表示长度为i，放置了k边的stick能放的最大价值，也就是说k最大为2，就两边！
代码如下：

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
using namespace std;

int n,l,w[1005];
long long dp[4005][3];
long long ans, v[1005];

void test_case()
{
    scanf("%d%d",&n,&l);
    l *= 2;
    ans = 0;
    for(int i=1; i<=n; i++)
    {
        scanf("%d %lld",&w[i],&v[i]);
        w[i] *= 2;//将长度放大一倍，这样在往放边上的时候就不会有小数；
        ans = max(ans, v[i]);
    }
    memset(dp,0,sizeof(dp));
    for(int i=1; i<=n; i++)
        for(int j=l; j>=w[i]/2; j--)
            for(int k=0; k<3; k++)
            {
                if(j >= w[i])
                    dp[j][k] = max (dp[j][k], dp[j-w[i]][k] + v[i]);//零壹背包，，，，
                if(k)
                    dp[j][k] = max (dp[j][k], dp[j-w[i]/2][k-1] + v[i]);//k表示放置了多少条边；
            }
    ans = max(ans, dp[l][2]);//之所以不直接输出dp[l][2]，是为了避免这种情况：
                            //物品的长度大于底边stick长度的二倍，此时dp[l][2]不能够选取这件物品，然而实际上是可选取的（一旦选取，就只能放这一件物品）
    printf("%lld\n",ans);
}
int main()
{
    int t;
    scanf("%d",&t);
    for(int i=1; i<=t; i++)
    {
        printf("Case #%d: ",i);
        test_case();
    }
    return 0;
}