zoukankan      html  css  js  c++  java
  • poj 1837 -- Balance

    Balance
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 10660   Accepted: 6612

    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

    题目链接:Balance

    思路:给出天平的挂钩与砝码,问使用全部砝码能让天平有多少种平衡的方法.dp来做.
      dp[i][j]表示挂i个砝码平衡状态为j时的种数.
      我们定义
      loc[]表示挂钩的位置.w[]表示砝码的重量.
      dp[i][j + w[i]*loc[k]] = ∑(dp[i-1][j])
      dp[0][7500] = 1;
      由于会出现负数,所以这里整体平移.

     1 /*======================================================================
     2  *           Author :   kevin
     3  *         Filename :   Balance.cpp
     4  *       Creat time :   2014-08-17 18:24
     5  *      Description :
     6  ========================================================================*/
     7 #include <iostream>
     8 #include <algorithm>
     9 #include <cstdio>
    10 #include <cstring>
    11 #include <queue>
    12 #include <cmath>
    13 #define clr(a,b) memset(a,b,sizeof(a))
    14 #define M 15005
    15 using namespace std;
    16 int dp[30][M+5];
    17 int w[30];
    18 int loc[30];
    19 int main(int argc,char *argv[])
    20 {
    21     int c,g;
    22     while(scanf("%d%d",&c,&g) != EOF){
    23         clr(dp,0);
    24         for(int i = 1; i <= c; i++){
    25             scanf("%d",&loc[i]);
    26         }
    27         for(int i = 1; i <= g; i++){
    28             scanf("%d",&w[i]);
    29         }
    30         dp[0][7500] = 1;
    31         for(int i = 1; i <= g; i++){
    32             for(int j = 1; j < M; j++){
    33                 if(dp[i-1][j]){
    34                     for(int k = 1; k <= c; k++){
    35                         dp[i][j + w[i] * loc[k]] += dp[i-1][j];
    36                     }
    37                 }
    38             }
    39         }
    40         printf("%d
    ",dp[g][7500]);
    41     }
    42     return 0;
    43 }
    View Code
  • 相关阅读:
    Trie树详解及其应用
    最长回文字符串_Manacher算法_(O(n))
    设置VisualStudio以管理员身份运行
    wcf使用JetEntityFrameworkProvider.dll写access数据库时,报"操作必须使用一个可更新的查询"错误的解决办法
    data:image字符转byte[]
    ID为XXXX的进程当前未运行
    在Windows2003 server 64位系统上使用ArcEngine开发的WCF服务
    关于position的relative和absolute分别是相对于谁进行定位的
    sql语句进行写数据库时,字符串含有'的处理方式
    EF中关于日期字值的处理
  • 原文地址:https://www.cnblogs.com/ubuntu-kevin/p/3956642.html
Copyright © 2011-2022 走看看