POJ1837 Balance[分组背包]

Balance

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 13717		Accepted: 8616

Description

Gigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance. 
It orders two arms of negligible weight and each arm's length is 15. Some hooks are attached to these arms and Gigel wants to hang up some weights from his collection of G weights (1 <= G <= 20) knowing that these weights have distinct values in the range 1..25. Gigel may droop any weight of any hook but he is forced to use all the weights. 
Finally, Gigel managed to balance the device using the experience he gained at the National Olympiad in Informatics. Now he would like to know in how many ways the device can be balanced.

Knowing the repartition of the hooks and the set of the weights write a program that calculates the number of possibilities to balance the device. 
It is guaranteed that will exist at least one solution for each test case at the evaluation. 

Input

The input has the following structure: 
• the first line contains the number C (2 <= C <= 20) and the number G (2 <= G <= 20); 
• the next line contains C integer numbers (these numbers are also distinct and sorted in ascending order) in the range -15..15 representing the repartition of the hooks; each number represents the position relative to the center of the balance on the X axis (when no weights are attached the device is balanced and lined up to the X axis; the absolute value of the distances represents the distance between the hook and the balance center and the sign of the numbers determines the arm of the balance to which the hook is attached: '-' for the left arm and '+' for the right arm); 
• on the next line there are G natural, distinct and sorted in ascending order numbers in the range 1..25 representing the weights' values. 

Output

The output contains the number M representing the number of possibilities to poise the balance. 

Sample Input

2 4
-2 3
3 4 5 8

Sample Output

2

Source

Romania OI 2002

---

题意：c个挂钩n个砝码，全用上，平衡多少种方案

---

f[i][j]前i个挂钩平衡点为j的方案数，j<0左,j>0右，注意j可能为负，所以定义shift＝15*20*20 = 7500

分组背包，一个砝码的所有位置是一个组

 

滚动不方便，因为有正负

用这种更新的写法比较好，可以优化

//
//  main.cpp
//  poj1837
//
//  Created by Candy on 9/22/16.
//  Copyright © 2016 Candy. All rights reserved.
//

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=,sh=;
int read(){
    char c=getchar();int x=,f=;
    while(c<''||c>''){if(c=='-')f=-; c=getchar();}
    while(c>=''&&c<=''){x=x*+c-''; c=getchar();}
    return x*f;
}
int c,n;
int pos[N],w[N],f[N][(sh<<)+];
void dp(){
    f[][sh]=;
    for(int i=;i<=n;i++)
        for(int j=sh<<;j>=;j--)
            if(f[j]){
                for(int k=;k<=c;k++) f[i][j+pos[k]*w[i]]+=f[i-][j];
            }

}
int main(int argc, const char * argv[]) {
    c=read();n=read();
    for(int i=;i<=c;i++) pos[i]=read();
    for(int i=;i<=n;i++) w[i]=read();
    dp();
    printf("%d",f[n][sh]);
    return ;
}