Balance POJ - 1837 地推
2024-09-08 07:09:52
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.
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.
• 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 递推,注意到砝码一边的最大重量不超过7500,讲7500设为新的0点,枚举所有物品选择和节点选择,注意剪枝。。
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<memory>
#include<bitset>
#include<string>
#include<functional>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int MAXN = * ; #define INF 0x3f3f3f3f //0 1 背包
/*
dp[i][MAXN]
*/
int dp[][MAXN];
int x[], w[];
int solve(int c, int g)
{
for (int i = ; i <= g; i++)
{
for (int v = ; v < MAXN; v++)
{
if (dp[i - ][v])
{
for (int j = ; j <= c; j++)
{
dp[i][v + w[i] * x[j]] += dp[i - ][v];
}
}
}
}
return dp[g][];
}
int main()
{
int c, g;
scanf("%d%d", &c, &g);
memset(dp, , sizeof(dp));
for (int i = ; i <= c; i++)
scanf("%d", &x[i]);
for (int j = ; j <= g; j++)
scanf("%d", &w[j]);
/*for (int i = 0; i < c; i++)
{
for (int j = 0; j < g; j++)
{
dp[0][x[i] * w[j] + 7500]++;
}
}*/
dp[][] = ;
printf("%d\n", solve(c, g));
return ;
}
最新文章
- 如何使用本地账户";完整";安装 SharePoint Server 2010+解决“New-SPConfigurationDatabase : 无法连接到 SharePoint_Config 的 SQL Server 的数据 库 master。此数据库可能不存在,或当前用户没有连接权限。”
- Java基础知识回顾
- 【CoreData】多个数据库使用
- vim复制多行<;转>;
- 《FPGA零基础入门到精通视频教程》-第001b讲软件的破解
- java的Comparator和Comparable
- hex格式介绍及转bin格式的源程序
- iOS 10 的一些变化
- RDLC报表系列(二) 行分组
- 从头来之【图解针对虚拟机iOS开发环境搭建】 (转)
- Restful WebApi开发实践
- Linux - 函数的栈帧
- 【CJOJ1494】【洛谷2756】飞行员配对方案问题
- 从锅炉工到AI专家(6)
- LeetCode 145. Binary Tree Postorder Traversal 二叉树的后序遍历 C++
- APP开发,微信第三方登录的介绍
- 宝岛探险,DFS&;BFS
- NVIDIA 驱动安装(超详细)
- shell日志分析进阶篇
- C++ Tips