Big Event in HDU

提供多重背包的一些思路

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

网上的代码:

#include
#include
#include
using namespace std;
int dp[100000],sum,ans;
struct st
{
	int v;
	int m;
}data[100000];
void full(int x)
{
	for(int i=data[x].v;i<=ans;i++)
	dp[i]=max(dp[i],dp[i-data[x].v]+data[x].v);
}
void one(int x)
{
	for(int j=1;j<=data[x].m;j++)
	     for(int i=ans;i>=data[x].v;i--)
	         dp[i]=max(dp[i],dp[i-data[x].v]+data[x].v);
}
int main()
{
	int i,j,n;
	while(scanf("%d",&n)&&(n>0))
	{
		memset(dp,0,sizeof(dp));
		sum=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d%d",&data[i].v,&data[i].m);
			sum+=data[i].v*data[i].m;
		}
		ans=sum/2;
		for(i=1;i<=n;i++)
		{
			if(data[i].v*data[i].m>=ans)
			full(i);
			else
			one(i);
		}
		printf("%d %d\n",sum-dp[ans],dp[ans]);
	}
	return 0;
}
//母函数方法:
/*注意将数组a,s清零,WA了好几次,测试数据都过。。无语。
*/
#include
#include
int a[250010],s[250010];
int v[55],m[55];
int main()
{
	int n,i,j,k,sum,ans;
	while(scanf("%d",&n)&&n>0)
	{
		sum=0;
		memset(s,0,sizeof(s));
		memset(a,0,sizeof(a));
		for(i=1;i<=n;i++)
		{
			scanf("%d%d",&v[i],&m[i]);
			sum+=v[i]*m[i];
		}
		for(i=0;i<=v[1]*m[1];i+=v[1])//注意变化。
		{
			s[i]=1;
		}
		for(i=2;i<=n;i++)
		{
			for(j=0;j<=sum;j++)
			{
		      	for(k=0;k+j<=sum&&k<=v[i]*m[i];k+=v[i])
				{
				   a[k+j]+=s[j];
			    }
			}
			for(k=0;k<=sum;k++)
			{
				s[k]=a[k];
				a[k]=0;
			}
		}
		for(i=sum/2;i>=0;i--)
		{
			if(s[i])
			{
			    printf("%d %d\n",sum-i,i);
			    break;
			}
		}
	}
	return 0;
} 

我的代码:

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
using namespace std;
//typedef long long ll;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
int val[60];
int num[60];
int n;
int dp[270000];
int main()
{
int i,j,k;
while(scanf("%d",&n)==1&&n>0)
{
int cnt=0;
for(i=1;i<=n;i++)
{
scanf("%d%d",&val[i],&num[i]);
cnt+=num[i]*val[i];
}
int sum=cnt/2;
memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++)
{
for(j=1;j<=num[i];j++)
{

for(k=sum;k>=val[i];k--)
{
dp[k]=max(dp[k],dp[k-val[i]]+val[i]);
}
}
}
printf("%d %d\n",cnt-dp[sum],dp[sum]);

}

return 0;
}

时间: 2024-10-07 22:51:05

Big Event in HDU的相关文章

HDU-1171 Big Event in HDU (多重背包)

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

HDU1171--Big Event in HDU(多重背包)

Big Event in HDU   Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1139 Accepted Submission(s): 444 Problem Description Nowadays, we all know that Computer College is the biggest department in HD

HDU 1171 Big Event in HDU (多重背包变形)

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27961    Accepted Submission(s): 9847 Problem Description Nowadays, we all know that Computer College is the biggest department

hdu 1171 Big Event in HDU(母函数|多重背包)

http://acm.hdu.edu.cn/showproblem.php?pid=1171 题意:有n种物品,给出每种物品的价值和数目,要将这些物品尽可能的分成相等的两份A和B且A>=B ,输出A,B. 母函数可以过,但感觉最直接的方法应该是多重背包. 母函数的话,也是按总价值的一半求,从一半到小枚举,直到找到系数不为0的就是B. #include <stdio.h> #include <iostream> #include <map> #include <

hdu 1171 Big Event in HDU

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22611    Accepted Submission(s): 7942 Problem Description Nowadays, we all know that Computer College is the biggest department

HDU 1171 Big Event in HDU --暴力+生成函数

题意:给n种房子,每种房子有一个值val和个数cnt,现在要把这些房子分成两部分,争取两部分总值相等,如果不能相等,让A>B,且A-B最小. 解法:先跑一次生成函数,c[n]表示组成总值为n的方法种数,然后从Total/2~0枚举B的总值,如果c[i]不为0,说明可以达到 i 这个状态,说明这就是B的最接近A的值(因为最接近Total/2).算法复杂度较高.跑了1600多ms,不知道还有没有更优的算法. 代码: #include <iostream> #include <cstdi

HDU 1171 Big Event in HDU(母函数或01背包)

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44151    Accepted Submission(s): 15191 Problem Description Nowadays, we all know that Computer College is the biggest department

HDU 1171 Big Event in HDU(01背包)

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 31928    Accepted Submission(s): 11169 Problem Description Nowadays, we all know that Computer College is the biggest departmen

组合数学 - 母函数的变形 --- hdu 1171:Big Event in HDU

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24002    Accepted Submission(s): 8458 Problem Description Nowadays, we all know that Computer College is the biggest department