POJ 2923 状压好题

Relocation

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2631		Accepted: 1075

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:

1. At their old place, they will put furniture on both cars.
2. Then, they will drive to their new place with the two cars and carry the furniture upstairs.
3. 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 w_i of each individual piece of furniture and the capacities C₁ and C₂ 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, C₁ and C₂. C₁ and C₂ are the capacities of the cars (1 ≤ C_i ≤ 100) and n is the number of pieces of furniture (1 ≤ n ≤ 10). The following line will contain n integers w₁, …, w_n, the weights of the furniture (1 ≤ w_i ≤ 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

2
6 12 13
3 9 13 3 10 11
7 1 100
1 2 33 50 50 67 98

Sample Output

Scenario #1:
2
 
Scenario #2:
3

Source

TUD Programming Contest 2006, Darmstadt, Germany

 

题目意思：

有两辆容量分别为c1和c2的车，有n个体积为v[i]的物品，现用车拉物品，最少用多少次把所有物品拉完。

 

思路：

状压物品，记录所有可以一次性拉的物品组合二进制状态，那么答案肯定是由这些记录过的状态组合而成的，dp即可。

 

代码：

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <iostream>
 #include <vector>
 #include <queue>
 #include <cmath>
 #include <set>
 using namespace std;
 
 #define N 100005
 #define inf 999999999
 
 int n, c1, c2;
 int w[];
 int num[];
 
 bool solve(int nn){
     int i, j, k;
     int sum=;
     bool visited[];
     memset(visited,false,sizeof(visited));
     visited[]=true;
     for(i=;i<n;i++){
         if((<<i)&nn){
             sum+=w[i];
             for(j=c1-w[i];j>=;j--){//DP
                 if(visited[j])
                     visited[j+w[i]]=true;
             }
         }
     }
     for(i=;i<=c1;i++){
         if(visited[i]&&sum-i<=c2)
             return true;
     }
     return false;
 }
 
 main()
 {
     int t, i, j, k;
     int kase=;
     cin>>t;
     while(t--){
         scanf("%d %d %d",&n,&c1,&c2);
         for(i=;i<n;i++) scanf("%d",&w[i]);
         int len=;
         int cnt=(<<n)-;
         for(i=;i<=cnt;i++){
             if(solve(i))
                 num[len++]=i;
         }
         int dp[];
         for(i=;i<=cnt;i++) dp[i]=inf;
         dp[]=;
         for(i=;i<len;i++){//DP
             for(j=cnt;j>=;j--){
                 if(!(j&num[i])){
                     dp[j|num[i]]=min(dp[j|num[i]],dp[j]+);
                 }
             }
         }
         printf("Scenario #%d:\n%d\n\n",kase++,dp[cnt]);
     }
 }