POJ 2923 Relocation(状态压缩+ 01背包)
来源:互联网 发布:linux 驱动 培训 编辑:程序博客网 时间:2024/04/18 08:05
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
<pre name="code" class="cpp">#include <iostream>#include <cstring>#include <cstdlib>#include <cstdio>#include <cstdlib>#include <algorithm>#include <cmath>#include <queue>#include <stack>#include <set>#include <map>#define LL long long using namespace std;const int MAXN = (1 << 11);const int inf = 0x3f3f3f3f;int vis[MAXN];int state[MAXN];int C1,C2,N;int A[MAXN];int dp[MAXN];bool check(int x){memset(vis, 0, sizeof(vis));vis[0] = 1;int sum = 0;for(int i=0;i<N;i++){if(x & (1<<i)){sum += A[i];for(int j=C1;j>=A[i];j--)if(vis[j-A[i]])vis[j] = 1;}}if(sum > C1 + C2) return false;for(int i=0;i<=C1;i++)if(vis[i] && sum - i <= C2)return true;return false;}int main(){int T, kcase = 1;scanf("%d", &T);while(T--){scanf("%d%d%d", &N, &C1, &C2);for(int i=0;i<N;i++) scanf("%d", &A[i]);int m = 0;for(int i=1;i<(1<<N);i++){if(check(i)){state[m++] = i;}}for(int i=0;i<(1<<N);i++) dp[i] = inf;dp[0] = 0;for(int i=0;i<m;i++){for(int j=(1<<N)-1;j>=0;j--){if(dp[j] == inf) continue;if((j & state[i])==0)dp[j|state[i]] = min(dp[j|state[i]], dp[j] + 1);}}printf("Scenario #%d:\n%d\n\n", kcase++, dp[(1<<N)-1]);}return 0;}
- poj 2923 Relocation(状态压缩+01背包)
- poj 2923 Relocation 状态压缩01背包
- poj 2923 Relocation 状态压缩+01背包
- POJ 2923 - Relocation(状态压缩+01背包)
- POJ 2923 Relocation(状态压缩+01背包)
- POJ 2923 Relocation(状态压缩+ 01背包)
- poj 2923 Relocation (枚举+背包 | 状态压缩+01背包)
- POJ 2923 Relocation (状态压缩+背包)
- POJ 2923 Relocation(状态压缩+背包思想)
- POJ Relocation 状态压缩 01背包
- poj 2923 Relocation(状态压缩+01背包)
- poj 2923 Relocation(DP+状态压缩+01背包)
- POJ 2923 Relocation(状态压缩DP+DP:01背包)
- poj 2923 Relocation(状态压缩+01背包)
- poj 2923 Relocation(状态压缩加上01背包)
- POJ 2923 Relocation(状态压缩+01背包)
- poj 2923 Relocation (01背包+状态压缩)
- POJ 2923 Relocation 状态DP+01背包
- 30岁学技术不晚,开博记录点点滴滴~~
- 深入理解C/C++混合编程(关于#ifdef __cplusplus extern "C" {...}的用法)
- js 清除html标签
- &的用法
- pthread_create()
- POJ 2923 Relocation(状态压缩+ 01背包)
- 【ShaderToy】基础篇之谈谈点、线的绘制
- 谷歌地址
- 加盟儿童产业前,必须进行市场调查
- JAR命令使用
- 从“中国需要早教吗?”带你看中国早教行业发展方向
- Matlab Intro - Image Filter Sobel
- swift常用的宏
- hdu5037(贪心)