hdu1171--C - Big Event in HDU（多重背包+二进制优化）

时间：2014-08-28 09:44:29 阅读：217 评论：0 收藏：0 [点我收藏+]

标签：des style color os io strong for ar art

C - Big Event in HDU

Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status

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

Sample Output

 20 10
40 40

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct node{
    int v , m ;
} q[100];
int dp[260000] ;
int main()
{
    int n , ans , i , j , k , sum , s , l;
    while(scanf("%d", &n) && n > 0)
    {
        ans = 0 ;
        for(i = 0 ; i < n ; i++)
        {
            scanf("%d %d", &q[i].v, &q[i].m);
            ans += q[i].v*q[i].m ;
        }

        sum = ans ;
        ans = ans / 2 ;
        memset(dp,0,sizeof(dp));
        dp[0] = 1 ;
        for(i = 0 ; i < n ; i++)
        {
            k = -1 ;
            while( (1<<(k+1)) -1 < q[i].m )
                k++ ;
            for(j = 0 ; j <= k ; j++)
            {
                if(j == k) s = q[i].m - (1<<j) + 1 ;
                else s = 1<<j ;
                for(l = ans ; l >= s*q[i].v ; l--)
                    if( !dp[l] && dp[ l-s*q[i].v ] )
                        dp[l] = 1 ;
            }
        }
        for(i = ans ; i >= 0 ; i--)
        {
            if( dp[i] )
            {
                printf("%d %d\n", sum-i, i);
                break;
            }
        }
    }
    return 0;
}

hdu1171--C - Big Event in HDU（多重背包+二进制优化）

标签：des style color os io strong for ar art

原文地址：http://blog.csdn.net/winddreams/article/details/38892991

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行