HDU:1171 Big Event in HDU(经典01背包+转化)
来源:互联网 发布:阿里云主机试用 编辑:程序博客网 时间:2024/05/22 02:36
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36183 Accepted Submission(s): 12561
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).
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.
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
210 120 1310 1 20 230 1-1
Sample Output
20 1040 40
Author
lcy
Recommend
We have carefully selected several similar problems for you: 1203 2159 2955 2844 2191
题目大意:计算机学院要分成计算机学院和计算机软件学院两部分了,于是要分家,给了你一堆仪器的价值和数量,问如何才能做到均分,如果不能均分的话就让计算机学院稍多一点。
解题思路:比如一个仪器数量有n个,那么转化成n个价值一样的仪器,如此转化成01背包来做,由于计算机学院要多于等于软件学院的资源,那么先背包sum/2软件学院(sum是所有资源的总价值),然后剩余的就归计算机学院了。(先输出计算机学院获取的最终价值,再输出软件学院的)。
代码如下:
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int dp[501000];int a[5010];int main(){int n;while(scanf("%d",&n)!=EOF){if(n<0)break;int sum=0;//机器总价值 int num=0;//机器总数 for(int i=0;i<n;i++){int val,geshu;scanf("%d%d",&val,&geshu);sum=sum+geshu*val;while(geshu--){a[num++]=val;}}memset(dp,0,sizeof(dp));for(int i=0;i<num;i++){for(int j=sum/2;j>=a[i];j--){dp[j]=max(dp[j],dp[j-a[i]]+a[i]);}}printf("%d %d\n",sum-dp[sum/2],dp[sum/2]);}return 0;}
0 0
- HDU:1171 Big Event in HDU(经典01背包+转化)
- Big Event in HDU(多重背包转化为01背包)
- HDU 1171 Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU(01背包)
- HDU 1171 Big Event in HDU(01背包问题)
- HDU 1171 Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU (01背包)
- HDU 1171 Big Event in HDU(01背包)
- HDU 1171 Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU(01背包变形)
- HDU 1171 Big Event in HDU (DP--01背包)
- HDU 1171 Big Event in HDU(01背包)
- hdu-1171 Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU(多重背包转化为01背包)
- hdu 1171 Big Event in HDU(01背包&多重背包)
- HDOJ 1171 Big Event in HDU(多重背包转化01背包 or 母函数)
- [HDU 1171 Big Event in HDU]背包
- HDOJ 1171 Big Event in HDU(01背包)
- 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活 hd 2191 (多重背包问题)
- poj 1850 Code
- Java bean 概念
- uC/OS-III 函数整理
- 监听自身APP被卸载
- HDU:1171 Big Event in HDU(经典01背包+转化)
- 经典的博客学习,安卓html+js+ios
- jzoj 2043. 【2016.5.21普及组模拟】约数国王(A king)
- USB端点
- ACM计算几何模板
- 2011年长沙市小学生信息学奥林匹克竞赛决赛 长跑接力
- BZOJ 2669 cqoi2012 局部极小值 状压DP+容斥原理
- 系统Service的启动流程
- Java 语言中 Enum 类型的使用介绍