D - Pick The Sticks

Time Limit: 1 Sec

Memory Limit: 256 MB

## Description

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 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 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 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 Yang could have taken.

## Sample Input

```4

3 74 12 18 1

3 74 22 18 4

3 54 12 28 9

1 110 3```

Sample Output

`Case #1: 2Case #2: 6Case #3: 11Case #4: 3`

## HINT

```#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
using namespace std;

long long dp[][][];
struct node
{
int x;
long long y;
};
node p[];
int main()
{
int t;scanf("%d",&t);
for(int cas =  ; cas <= t; cas++)
{
memset(dp,,sizeof(dp));
memset(p,,sizeof(p));
int n,l;scanf("%d%d",&n,&l);
long long ans = ;
for(int i=;i<=n;i++)
{
scanf("%d%lld",&p[i].x,&p[i].y);
p[i].x*=;
ans = max(ans,p[i].y);
}
l *= ;
int now = ;
for(int i=;i<=n;i++)
{
now = -now;
for(int j=;j<=l;j++)
for(int k=;k<;k++)
dp[now][j][k]=dp[-now][j][k];
for(int j=l;j>=p[i].x/;j--)
{
for(int k=;k<;k++)
{
if(j>=p[i].x)dp[now][j][k]=max(dp[now][j][k],dp[-now][j-p[i].x][k]+p[i].y);
if(k)dp[now][j][k]=max(dp[now][j][k],dp[-now][j-p[i].x/][k-]+p[i].y);
}
}
}
for(int t=;t<;t++)
for(int i=;i<=l;i++)
for(int k=;k<;k++)
ans = max(dp[t][i][k],ans);
printf("Case #%d: %lld\n",cas,ans);
}
}```

## 2015南阳CCPC D - Pick The Sticks dp的更多相关文章

1. 2015南阳CCPC D - Pick The Sticks 背包DP.

D - Pick The Sticks Description The story happened long long ago. One day, Cao Cao made a special or ...

2. 2015南阳CCPC C - The Battle of Chibi DP

C - The Battle of Chibi Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 无 Description Cao Cao made up a ...

3. 2015南阳CCPC C - The Battle of Chibi DP树状数组优化

C - The Battle of Chibi Description Cao Cao made up a big army and was going to invade the whole Sou ...

4. 2015 南阳ccpc The Battle of Chibi (uestc 1217)

题意:给定一个序列,找出长度为m的严格递增序列的个数. 思路:用dp[i][j]表示长度为i的序列以下标j结尾的总个数.三层for循环肯定超时,首先离散化,离散化之后就可以用树状数组来优化,快速查找下 ...

5. 2015南阳CCPC E - Ba Gua Zhen 高斯消元 xor最大

Ba Gua Zhen Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 无 Description During the Three-Kingdom perio ...

6. 2015南阳CCPC F - The Battle of Guandu 多源多汇最短路

The Battle of Guandu Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 无 Description In the year of 200, t ...

7. 2015南阳CCPC L - Huatuo&#39;s Medicine 水题

L - Huatuo's Medicine Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 无 Description Huatuo was a famous ...

8. 2015南阳CCPC H - Sudoku 暴力

H - Sudoku Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 无 Description Yi Sima was one of the best cou ...

9. 2015南阳CCPC G - Ancient Go 暴力

G - Ancient Go Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 无 Description Yu Zhou likes to play Go wi ...

## 随机推荐

1. 入门级 mongodb

2. JDK、JRE、JVM三者间的关系

JDK(Java Development Kit)是针对Java开发员的产品,是整个Java的核心,包括了Java运行环境JRE.Java工具和Java基础类库.Java Runtime Enviro ...

3. SuSE Linux 开启VNC服务

一.启动VNC服务输入命令 vncserver  二.编辑启动脚步vi /root/.vnc/xstartup 把twm &注释改为#twm & 然后再最下面增加2行startgnom ...

4. javascript中===与==

== equality 等同,=== identity 恒等. ==, 两边值类型不同的时候,要先进行类型转换,再比较. ===,不做类型转换,类型不同的一定不等. 类型转换规则:Boolean> ...

可以和C,JAVA,PYTHON作任意的比较,感觉越来越晰一些计算机语言里深层的东东... doubleMe x = x + x doubleUs x y = x * + y * doubleSmal ...

6. Go指针

Go 语言指针 Go 语言中指针是很容易学习的,Go 语言中使用指针可以更简单的执行一些任务. 接下来让我们来一步步学习 Go 语言指针. 我们都知道,变量是一种使用方便的占位符,用于引用计算机内存地 ...

7. Python爬取豆瓣指定书籍的短评

Python爬取豆瓣指定书籍的短评 #!/usr/bin/python # coding=utf-8 import re import sys import time import random im ...

8. linux内核分析ELF文件分析实践报告

9. Greenplum5.16.0 安装教程

Greenplum5.16.0 安装教程 一.环境说明 1.1官方网站 Greenplum官方安装说明:https://gpdb.docs.pivotal.io/5160/install_guide/ ...

10. JS数组sort比较函数

转载:http://www.cnblogs.com/ljchow/archive/2010/06/30/1768683.html 我们知道,数组的sort方法可以对数组元素进行排序,默认是按ASCII ...