poj 2923 Relocation(状压dp)
来源:互联网 发布:淘宝网店运营培训 编辑:程序博客网 时间:2024/05/16 14:42
Description
Emma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping them relocate. To move the furniture, they only have two compact cars, which complicates everything a bit. Since the furniture does not fit into the cars, Eric wants to put them on top of the cars. However, both cars only support a certain weight on their roof, so they will have to do several trips to transport everything. The schedule for the move is planed like this:
- At their old place, they will put furniture on both cars.
- Then, they will drive to their new place with the two cars and carry the furniture upstairs.
- Finally, everybody will return to their old place and the process continues until everything is moved to the new place.
Note, that the group is always staying together so that they can have more fun and nobody feels lonely. Since the distance between the houses is quite large, Eric wants to make as few trips as possible.
Given the weights wi of each individual piece of furniture and the capacities C1 and C2 of the two cars, how many trips to the new house does the party have to make to move all the furniture? If a car has capacity C, the sum of the weights of all the furniture it loads for one trip can be at most C.
Input
The first line contains the number of scenarios. Each scenario consists of one line containing three numbers n, C1 and C2. C1 and C2 are the capacities of the cars (1 ≤ Ci ≤ 100) and n is the number of pieces of furniture (1 ≤ n ≤ 10). The following line will contain n integers w1, …, wn, the weights of the furniture (1 ≤ wi ≤ 100). It is guaranteed that each piece of furniture can be loaded by at least one of the two cars.
Output
The output for every scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. Then print a single line with the number of trips to the new house they have to make to move all the furniture. Terminate each scenario with a blank line.
Sample Input
26 12 133 9 13 3 10 117 1 1001 2 33 50 50 67 98
Sample Output
Scenario #1:2Scenario #2:3
Source
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<stack>#include<vector>#include<set>#include<map>#define L(x) (x<<1)#define R(x) (x<<1|1)#define MID(x,y) ((x+y)>>1)#define eps 1e-8typedef __int64 ll;#define fre(i,a,b) for(i = a; i <b; i++)#define free(i,b,a) for(i = b; i >= a;i--)#define mem(t, v) memset ((t) , v, sizeof(t))#define ssf(n) scanf("%s", n)#define sf(n) scanf("%d", &n)#define sff(a,b) scanf("%d %d", &a, &b)#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)#define pf printf#define bug pf("Hi\n")using namespace std;#define INF 0x3f3f3f3f#define N 1<<11int dp[N],w[N],n,type[N],cnt,c1,c2;bool judge(int x){ int i,j; int d[105]; mem(d,0); int temp=0; for(i=0;i<n;i++){if(!(x&(1<<i))) continue;temp+=w[i];for(int va=c1;va>=w[i];va--) d[va]=max(d[va],d[va-w[i]]+w[i]);} return d[c1]+c2>=temp;}int main(){int i,j,ca=0;int t;sf(t);while(t--){ scanf("%d%d%d",&n,&c1,&c2); for(i=0;i<n;i++)scanf("%d",&w[i]); cnt=0; int len=1<<n; for(i=0;i<len;i++)if(judge(i)) type[cnt++]=i; mem(dp,INF); dp[0]=0; for(j=0;j<len;j++)fre(i,0,cnt){if(type[i]&j) continue;dp[type[i]|j]=min(dp[j]+1,dp[type[i]|j]);}pf("Scenario #%d:\n%d\n\n",++ca,dp[len-1]);} return 0;}
- poj 2923 Relocation(状压dp)
- poj 2923 Relocation(状压dp)
- POJ--2923--Relocation--状压DP
- poj 2923 Relocation 状压DP
- POJ 2923 Relocation(状压DP+01背包问题)
- POJ 2923 Relocation (状压DP+背包)
- poj 2923 Relocation(状压dp,好题)
- POJ 2923 Relocation(状压DP+01背包)
- poj 2923 Relocation(DP+状态压缩+01背包)
- poj 2923 Relocation(状态压缩dp+背包)
- POJ 2923 Relocation(状压+背包)
- poj 2923 Relocation(0-1 + 状压)
- POJ 2923 Relocation 状态DP+01背包
- POJ 2923 Relocation / 状态压缩DP
- POJ 2923-Relocation-状态压缩+DP
- POJ 2923 Relocation(状态压缩DP+DP:01背包)
- POJ 2923 Relocation 状态压缩DP + 0-1背包
- POJ2923 Relocation (DP)
- Activity的四种加载模式
- 如何在mac本上安装android sdk
- vmware 安装CentOS7无法执行64位操作
- Mac appStore下载目录/路径
- IDF-CTF-牛刀小试-摩斯密码
- poj 2923 Relocation(状压dp)
- [个人笔记]listView属性、背景和适配器
- Java基础之异常处理总结
- socket的底层创建与关闭
- Eclipse编写Hadoop程序,无法查看源码,提示Source not found的解决
- 大臣的旅费
- java教程
- 用background-attachment:fixed做动画效果
- 取消事件冒泡-select模拟(多选)