zoukankan      html  css  js  c++  java
  • HDU 1171(01背包)

    Big Event in HDU

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 29234    Accepted Submission(s): 10275


    Problem Description
    Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002.
    The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
     
    Input
    Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different.
    A test case starting with a negative integer terminates input and this test case is not to be processed.
     
    Output
    For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.
     
    Sample Input
    2 10 1 20 1 3 10 1 20 2 30 1 -1
     
    Sample Output
    20 10 40 40
     
    Author
    lcy
                                                                              
    可坑死我了,一直tle,我还以为算法错了呢,原来是输入要求N>0,否则停止,我还以为等于-1停止呢。。
    #include <cstdio>
    #include <iostream>
    #include <sstream>
    #include <cmath>
    #include <cstring>
    #include <cstdlib>
    #include <string>
    #include <vector>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <algorithm>
    using namespace std;
    #define ll long long
    #define _cle(m, a) memset(m, a, sizeof(m))
    #define repu(i, a, b) for(int i = a; i < b; i++)
    #define repd(i, a, b) for(int i = b; i >= a; i--)
    #define sfi(n) scanf("%d", &n)
    #define sfl(n) scanf("%I64d", &n)
    #define pfi(n) printf("%d
    ", n)
    #define pfl(n) printf("%I64d
    ", n)
    #define MAXN 5000005
    int dp[255555];
    int v[5005];
    int main()
    {
        int n;
        while(sfi(n), n > 0)
        {
            int sum = 0;
            _cle(dp, 0);
            int tot = 0;
            int x, y;
            repu(i, 0, n)
            {
                sfi(x), sfi(y);
                repu(j, 0, y)
                v[tot++] = x;
                sum += x * y;
            }
            int m = sum / 2;
    
            repu(i, 0, tot)
                for(int k = m; k >= v[i]; k--)
                {
                    dp[k] = max(dp[k], dp[k - v[i]] + v[i]);
                }
            printf("%d %d
    ", sum - dp[m], dp[m]);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    AngularJS启动过程分析
    mongodb 基本用法大全
    bitbucket工程改名导致 repository does not exist. fatal: Could not read from remote repository.
    分散的配置文件VS集中的注册表
    让browserify接收命令行参数,在打包时parse yml配置文件
    vscode下ts-node传入cli参数
    d3 .each()
    d3选择全部子节点,不知道class和id
    d3 parse字符串形式的xml svg and append to element
    在浏览器端用es6,babel+browserify打包
  • 原文地址:https://www.cnblogs.com/sunus/p/4726807.html
Copyright © 2011-2022 走看看