Big Event in HDU
来源:互联网 发布:mac重新安装系统好慢 编辑:程序博客网 时间:2024/05/22 17:09
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18297 Accepted Submission(s): 6408
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 40230ms代码#include<iostream>#include<algorithm>using namespace std;int v[55],m[55];int dp[500005];int max(int a,int b){return a>b?a:b;}int main(){int n;int i,j,k;int sum,ans; while(scanf("%d",&n)&&n>=0){sum=0; for(i=1;i<=n;i++){scanf("%d%d",&v[i],&m[i]);sum+=v[i]*m[i];}memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++){for(j=1;j<=m[i];j++){for(k=sum/2;k>=v[i];k-=v[i]){dp[k]=max(dp[k-v[i]]+v[i],dp[k]);}}} ans=sum-dp[sum/2];if(ans>dp[sum/2]){int temp=ans;ans=dp[sum/2];dp[sum/2]=temp;}printf("%d %d\n",dp[sum/2],ans);}return 0;}
1600ms代码#include<iostream>#include<algorithm>using namespace std;int v[55],m[55];int dp[500005];int max(int a,int b){return a>b?a:b;}int main(){int n;int i,j,k;int sum,ans; while(scanf("%d",&n)&&n>=0){sum=0; for(i=1;i<=n;i++){scanf("%d%d",&v[i],&m[i]);sum+=v[i]*m[i];}memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++){for(j=1;j<=m[i];j++){for(k=sum/2;k>=v[i];k--){dp[k]=max(dp[k-v[i]]+v[i],dp[k]);}}} ans=sum-dp[sum/2];if(ans>dp[sum/2]){int temp=ans;ans=dp[sum/2];dp[sum/2]=temp;}printf("%d %d\n",dp[sum/2],ans);}return 0;}
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU *
- VS快捷键
- iOS JSON解析框架性能比较
- C和C++的简单介绍,标准制定历程
- SVN源码服务器搭建
- 二维数组的动态分配及参数传递
- Big Event in HDU
- sql server中将一个表中的部分数据插入到另一个表中
- uva 10692 - Huge Mods 指数循环节
- 淘汰RM与RMVB的原因
- 分布式服务框架 Zookeeper -- 管理分布式环境中的数据
- 亲和数
- strstr函数
- 卸载mysql
- php中$_server的详细参数和说明