poj2923 Relocation
来源:互联网 发布:angew在哪个数据库 编辑:程序博客网 时间:2024/06/16 09:45
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 capacitiesC1 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 capacityC, the sum of the weights of all the furniture it loads for one trip can be at mostC.
Input
The first line contains the number of scenarios. Each scenario consists of one line containing three numbersn, C1 and C2. C1 andC2 are the capacities of the cars (1 ≤ Ci ≤ 100) andn is the number of pieces of furniture (1 ≤ n ≤ 10). The following line will containn 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:”, wherei 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
状态dp,枚举满足条件的一趟车的组装方式,然后dp一遍就可以了。
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int a[15];int t1[(1<<10)+1];int t2[(1<<10)+1];int p[(1<<10)+1];int vis[(1<<10)+1];int dp[(1<<10)+1];int main(){ int c1,c2,T,i,j,n,up1,up2,up,cnt,t,tst=1; scanf("%d",&T); while(T--) { scanf("%d%d%d",&n,&c1,&c2); for (i=0;i<n;i++) { scanf("%d",&a[i]); } up1=up2=0; for (i=0;i<(1<<n);i++) { cnt=0; for (j=0;j<n;j++) { if ((i & (1<<j))!=0) cnt+=a[j]; } if (cnt<=c1) t1[up1++]=i; if (cnt<=c2) t2[up2++]=i; } up=0; memset(vis,0,sizeof(vis)); for (i=0;i<up1;i++) { for (j=0;j<up2;j++) { if ((t1[i] & t2[j])!=0) continue; vis[t1[i] | t2[j]]=1; } } for (i=0;i<(1<<n);i++) { if (vis[i]==1) p[up++]=i; } memset(dp,-1,sizeof(dp)); dp[0]=0; for (i=0;i<(1<<n);i++) { if (dp[i]==-1) continue; for (j=0;j<up;j++) { if ((i & p[j])!=0) continue; t=(i | p[j]); if (dp[t]==-1) dp[t]=dp[i]+1; else dp[t]=min(dp[t],dp[i]+1); } } printf("Scenario #%d:\n",tst++); printf("%d\n\n",dp[(1<<n)-1]); } return 0;}
- poj2923 Relocation
- poj2923 Relocation
- poj2923 Relocation
- 【POJ2923】Relocation
- poj2923 Relocation
- 【POJ2923】【Relocation】
- POJ2923 Relocation (DP)
- POJ2923:Relocation(状态压缩+01)
- poj2923 Relocation(枚举+01背包)
- poj2923 Relocation(压缩dp+01背包)
- poj2923 Relocation (01背包+状态压缩)
- poj2923 Relocation(状态压缩+背包)
- poj2923 Relocation(状态压缩+01背包)
- POJ2923:Relocation(状态压缩dp)
- Relocation
- 【DP】poj2923
- poj2923(状态压缩dp)
- relocation介绍
- 自考——信息系统开发管理
- TIPTOP——p_qry动态查询程序介绍
- Androd Home键进行屏蔽
- Think_in_CPP第十二章 操作符重载(2)
- TIPTOP——TIPTOP拆件式工单简介
- poj2923 Relocation
- UEFI Boot Flow 系列之概述
- 如何在WAMP的服务器设置多个虚拟主机
- [IOS5] Step into Calendar : Feature Specification
- 关于负数取模的问题
- struts2.3.16基本包
- UEFI Boot Flow 系列之SEC
- zoj2290 Game----博弈 打表找规律
- Android 图片裁剪功能实现详解(类似QQ自定义头像裁剪)