| Big Event in HDU |
| Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
| Total Submission(s): 753 Accepted Submission(s): 321 |
| 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).
|
| 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
|
| Sample Output 20 10
|
来自 <http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=3§ionid=3&problemid=3>
题目：要将一个专业分成两个专业，那么设备的平均分配就成了问题，假设，每个设备有不同的价值v，每个设备有M个，给定设备种类，价值，个数，求怎么分配两者总价值差值最小。
天真算法：先排序，从后往前分配给A，B，先分配给A，再分配给B直到B大于A，再分配A直到大于B，最后比较A，B大小决定输出先后，事实证明我太天真了，如案例 ： 50 2 ， 33 3 就通不过
#include<iostream>
#include<algorithm>
using namespace std;
typedef class
{
public:
intvalue;
intmediaNumber;
}Media;
bool sortWay(Mediaa,Media b)
{
returna.value > b.value;
}
int main()
{
Mediamedia[55];
intcaseNumber,len;
while(cin>> caseNumber,caseNumber != -1)
{
inta = 0,b = 0;
memset(media,0,sizeof(media));
for(inti = 0; i < caseNumber; i++)
{
cin>> media[i].value >> media[i].mediaNumber;
}
sort(media,media+caseNumber,sortWay);
for(inti = 0; i < caseNumber; i++)
{
for(intmediaNumber = 1;mediaNumber <= media[i].mediaNumber;mediaNumber++)
{
if(a> b) b += media[i].value;
elsea += media[i].value;
}
}
cout<< (a > b ? a : b) << " " << (a < b ? a : b)<< endl;
}
return0;
}
dp解法:
先算出所有设备的总价值（max）有多少，然后用dp法求出所有设备时背包容量为max/2的最大价值。答案即为所求B的价值。A = max - B；
以下化用基本背包，耗时1031s。
#include<iostream>
#include<algorithm>
using namespace std;
typedef class
{
public:
int value;
int mediaNumber;
}Media;
int dpMax[130000];
int main()
{
Media media[55];
int caseNumber,len;
while(cin >>caseNumber,caseNumber >-1)
{
int Max = 0;
memset(dpMax,0,sizeof(dpMax));
for(int i = 0; i <caseNumber; i++)
{
cin >> media[i].value >>media[i].mediaNumber;
Max += media[i].value*media[i].mediaNumber;
}
for(int i = 0; i <caseNumber; i++)
{
for(int j = 0; j <media[i].mediaNumber; j++)
{
for(int dpLen = Max/2; dpLen >= media[i].value; dpLen--)
{
dpMax[dpLen] = max(dpMax[dpLen],dpMax[dpLen-media[i].value] + media[i].value);
}
}
}
cout << Max - dpMax[Max/2] << " " << dpMax[Max/2] << endl;
}
return 0;
}
多重背包解法：耗时703ms
#include<iostream>
#include<algorithm>
usingnamespace std;
typedef class
{
public:
int value;
int mediaNumber;
}Media;
int dpMax[130000];
void baseBag(int bagVolume,int value,int volume) //基本背包
{
for(int i= bagVolume; i >=value; i--)
{
dpMax[i] = max(dpMax[i],dpMax[i-volume]+value);
}
}
void completeBag(int bagVolume,int value,int volume)//完全背包
{
for(int i = value; i <=bagVolume; i++)
{
dpMax[i] = max(dpMax[i],dpMax[i-volume]+value);
}
}
void multipleBag(int bagVolume,int value,int volume,int howMuch)//多重背包
{
if(value*howMuch >= bagVolume) completeBag(bagVolume,value,volume);
else
{
for(int i = 0; i <howMuch; i++)
{
baseBag(bagVolume,value,volume);
}
}
}
int main()
{
Media media[55];
int caseNumber,len;
while(cin >> caseNumber,caseNumber > -1)
{
int Max = 0;
memset(dpMax,0,sizeof(dpMax));
for(int i = 0; i <caseNumber; i++)
{
cin >> media[i].value >> media[i].mediaNumber;
Max += media[i].value*media[i].mediaNumber;
}
for(int i = 0; i <caseNumber; i++)
{
multipleBag(Max/2,media[i].value,media[i].value,media[i].mediaNumber);
}
cout << Max - dpMax[Max/2] << " " << dpMax[Max/2] << endl;
}
return 0;
}
母函数解法：假设有n个设备，每个设备有k(n)个,价值为v(n)，则每个设备由母函数表示为(1+x^1*v(n)+x^2*v(n)。。。+x^k(n)*v(n))
再由每个设备相乘得到想<=x^max/2的倒数第一项即可
以下代码耗时875ms
#include<iostream>
#include<algorithm>
using namespace std;
typedef class
{
public:
int value;
int mediaNumber;
}Media;
int matherMax [2][130000];
int main()
{
Media media[55];
int caseNumber;
while(cin >>caseNumber,caseNumber> -1)
{
int Max = 0,len = 0,*perMatherMax = matherMax[0],*theMatherMax =matherMax[1];
memset(matherMax,0,sizeof(matherMax));
for(int i = 0; i <caseNumber; i++)
{
cin >>media[i].value>> media[i].mediaNumber;
Max +=media[i].value*media[i].mediaNumber;
}
for(int i = 0; i <caseNumber; i++)
{
for(int j = 1; j <=media[i].mediaNumber; j++)
{
if(j*media[i].value >Max/2) break;
theMatherMax[j*media[i].value] = 1;
len = max(len,j*media[i].value);
for(int l = 1; l <len; l++)
{
if(l+j*media[i].value >Max/2) break;
if(!perMatherMax[l]) continue;
theMatherMax[l+j*media[i].value] = 1;
len = max(len,l+j*media[i].value);
}
}
int *temp =perMatherMax;
perMatherMax =theMatherMax;
theMatherMax = temp;
}
cout <<Max - len<< " " <<len << endl;
}
return 0;
}
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
