POJ 1837 Balance DP
来源:互联网 发布:自动阅读软件 编辑:程序博客网 时间:2024/06/05 18:10
Balance
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10299 Accepted: 6372
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.
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
#include<iostream>#include<cstring>using namespace std;int d[22][15005];int main(){int n,m;cin>>n>>m;int a[24],b[24];int i,j;for(i=1;i<=n;i++)cin>>a[i];for(j=1;j<=m;j++)cin>>b[j];memset(d,0,sizeof(d));d[0][7500]=1;for(i=1;i<=m;i++)for(j=0;j<=15000;j++)if(d[i-1][j])for(int k=1;k<=n;k++)d[i][j+b[i]*a[k]] += d[i-1][j];cout<<d[m][7500]<<endl;return 0;}
0 0
- POJ 1837 Balance DP
- POJ--1837--Balance--DP
- POJ 1837 Balance (DP)
- POJ 1837 Balance DP
- POJ 1837 Balance (DP)
- poj 1837 Balance (DP)
- POJ 1837 Balance DP
- POJ 1837 Balance (DP)
- POJ 1837 Balance (DP)
- poj 1837 Balance -DP
- POJ 1837 Balance(DP)
- POJ-1837-Balance-DP
- poj-1837 Balance【dp】
- Poj 1837 Balance【DP】
- POJ-1837-Balance(dp)
- POJ 1837 Balance(DP)
- POJ 1837 - Balance (dp)
- poj 1837 Balance (暴力dp)
- [Leetcode]Pascal's Triangle
- poj1125 Stockbroker Grapevine 图论,任意两点间最短路径,floyd
- Vim切换文件
- POJ 1287:Networking(最小生成树Kruskal)
- TeamViewer经验介绍
- POJ 1837 Balance DP
- OpenEIM模式中的里氏代换原则【策略模代】
- Codeforces Round #1C Ancient Berland Circus
- 区间Dp 暴力枚举+动态规划 Hdu1081
- 2014-07-19java小成绩
- Corporative Network +uvalive+并查集
- 广义霍夫变换GHT
- CF 256# D. Multiplication Table 二分
- C++ Primer Plus第六版 第七章 编程练习答案