Big Event in HDU
2013-07-31 11:19
197 查看
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
[align=left]Problem Description[/align]
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).
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2
10 1
20 1
3
10 1
20 2
30 1
-1
[align=left]Sample Output[/align]
20 10
40 40
230ms代码
#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; }
相关文章推荐
- HDU-1171-Big Event in HDU(01背包的简单变形)
- HDU 1171 Big Event in HDU
- Big Event in HDU (多重背包)
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU 多重背包
- Big Event in HDU
- hdu 1171 Big Event in HDU(母函数)
- HDOJ--1171--Big Event in HDU
- hdu 1171 Big Event in HDU(01背包)
- HDU1171 Big Event in HDU
- HDU - 1171 Big Event in HDU(多重背包或BFS)
- HDU 1171 Big Event in HDU (多重背包)
- HDU Big Event in HDU
- HDU ACM 2 1171 Big Event in HDU
- HDU 1171 Big Event in HDU
- hdu1171 Big Event in HDU(多重背包)
- Big Event in HDU
- hdoj1171 Big Event in HDU(01背包 || 多重背包)
- 【HDU】 1171 Big Event in HDU