Balance
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 |
题目大意:有一个天平,同时它本身有C个挂钩,并且有G个砝码,第二行给的是挂钩的位置,小于0为挂钩在左边,大于0为挂钩在右边,要求把所有的砝码都用上的情况下,一共有多少种方法可以使其平衡
解题思路:这道题其实是我早于刚刚发的那两个动态规划01背包早写的,这道题其实不是特别会,目前我是分不清何时使用二维背包何时使用一维的,所以这个会在以后写出来,就目前来看,这道题是用二维的dp[i][j]表示的是放上第i个砝码后偏移j单位的次数,由于考虑到左边偏移的话,j为小于零,所以整体平移往右,然后意味着7500位置是平衡点(根据他给的范围求出)
#include<iostream>
#include<cstdio>
#include<stdio.h>
#include<cstring>
#include<cstdio>
#include<climits>
#include<cmath>
#include<vector>
#include <bitset>
#include<algorithm>
#include <queue>
#include<map>
using namespace std;
long long int a[25], b[25], dp[25][15005];
int n, m, i, j, k;
int main()
{
cin >> n >> m;
for (i = 1; i <= n; i++)
{
cin >> a[i];
}
for (j = 1; j <= m; j++)
{
cin >> b[j];
}
memset(dp, 0, sizeof(dp));
dp[0][7500] = 1;
for (i = 1; i <= m; i++)
{
for (j = 0; j <= 15000; j++)
{
if (dp[i - 1][j])
{
for (k = 1; k <= n; k++)
{
dp[i][j +a[k]*b[i]] += dp[i - 1][j];
}
}
}
}
cout << dp[m][7500] << endl;
}