D - Pick The Sticks 【01背包扩展】【扩容版】

D - Pick The Sticks vj链接

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 his cleverness 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 LL length segment. And the gold sticks as segments too. There were many gold sticks with different length a_{i}ai​ and value v_{i}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 sides of 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 could help 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 sticks Xiu 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(1≤T≤100). TT test cases follow. Each test case start with two integers, N(1≤N≤1000)N(1≤N≤1000) and L(1≤L≤2000)L(1≤L≤2000), represents the number of gold sticks and the length of the container stick. NN lines follow. Each line consist of two integers, a_{i}(1≤a_{i}≤2000)ai​(1≤ai​≤2000) and v_{i}(1≤v_{i}≤10^{9})vi​(1≤vi​≤109), represents the length and the value of the i_{th}ith​ gold stick.

Output

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

Sample

Inputcopy	Outputcopy
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.

状态表示f[j][k] : j表示当前背包容量，k表示两侧是否有露出的情况 显然是01背包1维优化后再用另一维表示两侧状态

状态计算：根据两侧露出情况进行状态转移。分两种，加入这一种导致露出数增加和加入露出数不增加。前一种由k-1进行转移，后一种就是当前的第k层。

直接看代码 注意若物品太大，即一半也比总容量大，这种情况只能放一种改物品，只需要比较一下最大价值取最大就ok了

#include <math.h>
#include<queue>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
#include <vector>
#define PI acos(-1)
#include <string.h>
using namespace std;
const int N = 4005, M = 1e5 + 5, inf = 0x3f3f3f3f, mod = 1e9 + 7;
const double esp = 1e-6;
typedef pair<int, int> PII;
int t;
int n,m;
long long ans;
long long v[N],w[N];
long long f[N][3];
int main() {
    cin>>t;
    for(int cases=1;cases<=t;cases++)
    {
        memset(f,0,sizeof f);
        scanf("%d%d",&n,&m);
        m*=2;
        long long maxx=-1;//标记最大且v比总容量2倍还多的价值
        for(int i=1;i<=n;i++)
        {
         scanf("%lld%lld",&v[i],&w[i]);
         v[i]*=2;
          if(v[i]>=2*m)
          {
            maxx=max(maxx,w[i]);
          }
        }
        for(int i=1;i<=n;i++)
        {
            // if(v[i]>2*m)continue;//可以加上可以不加
            for(int j=m;j>=0;j--)//背包容量
            {
                for(int k=0;k<3;k++)//露头情况
                {
                 if(j>=v[i])  //能完全存下
                 {
                    f[j][k]=max(f[j][k],f[j-v[i]][k]+w[i]);
                 }
                 if(k&&v[i]<=2*j)
                 {
                    f[j][k]=max(f[j][k],f[j-v[i]/2][k-1]+w[i]);
                 }
                }
            }
        }
        ans=max(f[m][0],f[m][1]);
        ans=max(ans,f[m][2]);
        printf("Case #%d: %lld\n",cases,max(ans,maxx));
    }
    return 0;
}