Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18761 Accepted Submission(s): 6565
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
2 10 1 20 1 3 10 1 20 2 30 1 -1
Sample Output
20 10 40 40
Author
lcy
这个是母函数的问题,当然有的大神使用DP做的,我只会用母函数做喽。就是求出总价值量来,A所占的价值要大于B,要A最少的那种,所以用母函数的思想求出所有的设备能够拼成的数据,看哪个最符合要求就是了
我在做这个题目是,n==0 是要特别处理的地方,要直接continue ,错了10 边啊
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
struct node
{
int x;
int y;
int sum;
} unit[250000];
int c1[300000];
int c2[300400];
int main()
{
int i,j,k,n,s;
int va[100];
int nu[100];
while(scanf("%d",&n)!=EOF)
{
if(n<0)
break;
if(n==0)
{
//printf("0 0\n");
continue;
}
s=0;
memset(c1,0,sizeof(c1));
memset(c2,0,sizeof(c2));
for(i=1; i<=n; i++)
{
cin>>unit[i].x>>unit[i].y;
unit[i].sum=unit[i].x*unit[i].y;
s=s+unit[i].sum;
}
c1[0]=1;
for(i=unit[1].x; i<=unit[1].sum; i=i+unit[1].x)
c1[i]=1;
for(i=2; i<=n; i++)
{
for(j=0; j<=s; j++)
{
for(k=0; k<=unit[i].sum&&k+j<=s; k=k+unit[i].x)
{
c2[j+k]+=c1[j];
}
}
for(j=0; j<=s; j++)
{
c1[j]=c2[j];
c2[j]=0;
}
}
for(i=s/2; i>=0; i--)
{
if(c1[i]!=0)
{
cout<<s-i<<" "<<i<<endl;
break;
}
}
}
return 0;
}