HOJ Piggy-Bank为什么?????????

原创 2012年03月21日 23:59:14

Piggy-Bank

My Tags   (Edit)
  Source : ACM ICPC Central European Regional 1999
  Time limit : 5 sec   Memory limit : 32 M

Submitted : 1216, Accepted : 517

Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple. Whenever some ACM member has any small money, he takes all the coins and throws them into a piggy-bank. You know that this process is irreversible, the coins cannot be removed without breaking the pig. After a sufficiently long time, there should be enough cash in the piggy-bank to pay everything that needs to be paid.

But there is a big problem with piggy-banks. It is not possible to determine how much money is inside. So we might break the pig into pieces only to find out that there is not enough money. Clearly, we want to avoid this unpleasant situation. The only possibility is to weigh the piggy-bank and try to guess how many coins are inside. Assume that we are able to determine the weight of the pig exactly and that we know the weights of all coins of a given currency. Then there is some minimum amount of money in the piggy-bank that we can guarantee. Your task is to find out this worst case and determine the minimum amount of cash inside the piggy-bank. We need your help. No more prematurely broken pigs!

Input Specification

The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing two integers E and F. They indicate the weight of an empty pig and of the pig filled with coins. Both weights are given in grams. No pig will weigh more than 10 kg, that means 1 <= E <= F <= 10000. On the second line of each test case, there is an integer number N (1 <= N <= 500) that gives the number of various coins used in the given currency. Following this are exactly N lines, each specifying one coin type. These lines contain two integers each, Pand W (1 <= P <= 500001 <= W <=10000). P is the value of the coin in monetary units, W is it's weight in grams.

Output Specification

Print exactly one line of output for each test case. The line must contain the sentence "The minimum amount of money in the piggy-bank is X. where X is the minimum amount of money that can be achieved using coins with the given total weight. If the weight cannot be reached exactly, print a line "This is impossible..

Sample Input:
3
10 110
2
1 1
30 50
10 110
2
1 1
50 30
1 6
2
10 3
20 4
Sample Output:
The minimum amount of money in the piggy-bank is 60.
The minimum amount of money in the piggy-bank is 100.
This is impossible.

又回头看背包,想用二维的写一下,便于更进一步理解,可是无论怎么改,依旧是WA,请高手指点一下,一维的过了,二维的就是WA.

已经过的代码:

/* Th/is Code is Submitted by 陈玉标 for Problem 1031 at 2011-07-31 21:38:18 */

#include <iostream>
using namespace std;
const int MAX = 10001;
const int largest = 1000000;
int dp[MAX];
int w[501];
int p[501];
int N;


/*
 * 可以小试牛刀。终于没参考被人的代码写了个水题。
 */
void DP(int m) {
    for (int i = 1; i <= m; i++) {
        dp[i] = largest;
    }
    dp[0] = 0;
    for (int i = 1; i <= N; i++) {
        for (int j = w[i]; j <= m; j++) {
            if (dp[j - w[i]] + p[i] < dp[j]) {
                dp[j] = dp[j - w[i]] + p[i];
            }
        }
    }
}


int main(int argc, char** argv) {
    int T, E, F, W;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d%d", &E, &F, &N);
        for (int i = 1; i <= N; i++) {
            scanf("%d%d", &p[i], &w[i]);
        }
        W = F - E;
        DP(W);
        if (dp[W] == largest) {
            printf("This is impossible.\n");
        } else {
            printf("The minimum amount of money in the piggy-bank is %d.\n", dp[W]);
        }
    }
    return 0;
}

过不了的代码:
/*
 * File:   main.cpp
 * Author: Administrator
 *
 * Created on 2012年3月21日, 下午8:08
 */

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int INF = 1000000;
const int MAXW = 10010;
const int MAXN = 510;
int P[MAXN];
int W[MAXN];
int dp[MAXN][MAXW];
int E, F, N, V;

/*
 * 状态转移方程为:dp[i][v]=min{dp[i-1][v],dp[i-1][v-c[i]]+w[i]};
 * 对于不存在的状态,为了不影响min,都应该是INF,这个是可以状态压缩的
 * 为什么一维转化为二维就错了,谁能指点
 */


void DP() {
    
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= V; j++) {
            dp[i][j] = INF;
        }
    }
    for (int i = 0; i <= N; i++) {
        dp[i][0] = 0;
    }

    for (int i = 1; i <= N; i++) {
        for (int j = W[i]; j <= V; j++) {
            if (dp[i - 1][j] < (dp[i - 1][j - W[i]] + P[i])) {
                dp[i][j] = dp[i - 1][j];
            } else {
                dp[i - 1][j] = dp[i][j] = (dp[i - 1][j - W[i]] + P[i]);
            }
        }
    }

    if (dp[N][V] == INF) {
        printf("This is impossible.\n");
    } else {
        printf("The minimum amount of money in the piggy-bank is %d.\n", dp[N][V]);
    }
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d%d", &E, &F, &N);
        for (int i = 1; i <= N; i++) {
            scanf("%d%d", &P[i], &W[i]);
        }
        V = F - E;
        DP();
    }

F - Piggy-Bank——HOJ 一维DP 装载问题

F - Piggy-Bank Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Subm...
  • chudongfang2015
  • chudongfang2015
  • 2016年05月12日 19:15
  • 277

[POJ1741][JZOJ1166] 树中点对距离(点分治模板)

Summary给出一棵带边权的树,问有多少对点的距离
  • hzj1054689699
  • hzj1054689699
  • 2016年09月09日 20:33
  • 215

HOJ 1867 经理的烦恼

经理的烦恼 My Tags   (Edit)   Source : HCPC 2005 Spring   Time limit : 2 sec   Memor...
  • u014688855
  • u014688855
  • 2014年07月15日 10:47
  • 893

Hoj 2662 棋盘问题

状态压缩dp,经典题目,好学好用的方法,让你满意的解释
  • wangjianbing1998
  • wangjianbing1998
  • 2016年08月10日 14:38
  • 400

HDOJ1166(线段树,树状数组)

题目: Problem Description C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和...
  • LMFQYJ
  • LMFQYJ
  • 2016年06月28日 19:02
  • 379

Piggy-Bank(完全)

Piggy-Bank Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit S...
  • u014361775
  • u014361775
  • 2014年07月30日 16:29
  • 386

HOJ大神Edelweiss的HOJ题目分类

****************************************************************************** * 简单题(包括枚举,二分查找,(复杂)...
  • usher_ou
  • usher_ou
  • 2017年02月24日 20:53
  • 1655

hoj 2651 Pie(二分)hoj 2278 (二分)

题意:有f+1个人分n块披萨,每个人要求分得的面积一样,且披萨只能被切开而不能重新组合,求每个人能分到的最大面积v。 注意,主人本身有算进去。...
  • u013508213
  • u013508213
  • 2014年06月26日 14:06
  • 333

hoj 1408 欧几里得算法

hoj  1408 Pi My Tags   (Edit)   Source : ACM ICPC East Central North America 1995 ...
  • wangming520liwei
  • wangming520liwei
  • 2013年12月04日 11:26
  • 540

HOJ 2014年“新生杯”

A. 统计数字(数位DP) 暴力的从1到n每个数字处理一遍是非常慢的,通过规律来计算得解可以大大优化。 例如n = 465的情况: 首先不考虑去掉前导0,那么从00到99,0~9每个数字...
  • u013595779
  • u013595779
  • 2014年12月30日 16:36
  • 605
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HOJ Piggy-Bank为什么?????????
举报原因:
原因补充:

(最多只允许输入30个字)