Piggy-Bank HDU - 1114

标签：max   注释   inpu   not   log   size   deb   nbsp   type   

InputThe 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 <= 50000, 1 <= W <=10000). P is the value of the coin in monetary units, W is it‘s weight in grams. 
OutputPrint 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.

完全背包经典题，算是模板吧。

TLE到崩溃。注释就是所有解决之前的代码。

// Asimple
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define mod 1000000007
#define debug(a) cout<<#a<<" = "<<a<<endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 10000+5;
int n, m, T, len, cnt, num, ans, Max;
int x, y;
int v[maxn], w[maxn];
int dp[maxn];

void input() {
    //cin >> T;
    scanf("%d", &T);
    while( T -- ) {
        //cin >> x >> y;
        scanf("%d%d", &x, &y);
        m = y - x;
        //memset(dp, INF, sizeof(dp));
        for(int i=0; i<=m; i++) dp[i] = INF;
        dp[0] = 0;
        //cin >> n;
        scanf("%d", &n);
        for(int i=1; i<=n; i++) //cin >> v[i] >> w[i];
            scanf("%d%d", &v[i], &w[i]);
        for(int i=1; i<=n; i++) {
            for(int j=w[i]; j<=m; j++) {
                dp[j] = min(dp[j], dp[j-w[i]]+v[i]);
            }
        }
        if( dp[m]==INF ) printf("This is impossible.\n");
        else printf("The minimum amount of money in the piggy-bank is %d.\n", dp[m]);
        //if( dp[m]==INF ) cout << "This is impossible." << endl;
        //else cout << "The minimum amount of money in the piggy-bank is " << dp[m] << "." << endl;
    } 
}

int main() {
    input();
    return 0;
} 

Piggy-Bank HDU - 1114

标签：max   注释   inpu   not   log   size   deb   nbsp   type   

原文地址：http://www.cnblogs.com/Asimple/p/7399313.html