UVA 1354 - Mobile Computing(暴力枚举子集)_here is a mysterious planet called yaen, whose spa-CSDN博客

本文链接：https://blog.csdn.net/u014569598/article/details/38361731

G - Mobile Computing

Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu

Submit Status

Description

There is a mysterious planet called Yaen, whose space is 2-dimensional. There are many beautiful stones on the planet, and the Yaen people love to collect them. They bring the stones back home and make nice mobile arts of them to decorate their 2-dimensional living rooms.

In their 2-dimensional world, a mobile is defined recursively as follows:

a stone hung by a string, or
a rod of length 1 with two sub-mobiles at both ends; the rod is hung by a string at the center of gravity of sub-mobiles. When the weights of the sub-mobiles are n and m , and their distances from the center of gravity are a and b respectively, the equation n x a =m x b holds.

$\epsfbox{p3403a.eps}$

For example, if you got three stones with weights 1, 1, and 2, here are some possible mobiles and their widths:

$\epsfbox{p3403b.eps}$

Given the weights of stones and the width of the room, your task is to design the widest possible mobile satisfying both of the following conditions.

It uses all the stones.
Its width is less than the width of the room.

You should ignore the widths of stones. In some cases two sub-mobiles hung from both ends of a rod might overlap (see the figure on the right). Such mobiles are acceptable. The width of the example is (1/3) + 1 + (1/4) .

$\epsfbox{p3403c.eps}$

Input

The first line of the input gives the number of datasets. Then the specified number of datasets follow. A dataset has the following format.

w₁

$\vdots$

w_s

r is a decimal fraction representing the width of the room, which satisfies 0 < r < 10 . s is the number of the stones. You may assume 1 $\le$ s $\le$ 6 . w_i is the weight of the i -th stone, which is an integer. You may assume 1 $\le$ w_i $\le$ 1000 .

You can assume that no mobiles whose widths are between r - 0.00001 and r + 0.00001 can be made of given stones.

Output

For each dataset in the input, one line containing a decimal fraction should be output. The decimal fraction should give the width of the widest possible mobile as defined above. An output line should not contain extra characters such as spaces.

In case there is no mobile which satisfies the requirement, answer `-1' instead.

The answer should not have an error greater than 0.00000001. You may output any numb er of digits after the decimal point, provided that the ab ove accuracy condition is satisfied.

Sample Input

Sample Output

-1 
1.3333333333333335 
1.6666666666666667 
1.5833333333333335 
1.7142857142857142

暴力枚举子集合，再求解；（暴力子集合小白上有篇幅详细介绍）

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
using namespace std;
const int MAXN=7;
const int MAXM=1<<MAXN;
double w[MAXN],sum[MAXM],r;
bool done[MAXM];
int n;

struct node
{
	double l,r;
	node(double ll=0,double rr=0)
	{
		l=ll;r=rr;
	}
};
vector<node>p[MAXM];
double min(double a,double b){return a>b?b:a;}
double max(double a,double b){return a<b?b:a;}
int bitcnt(int x)
{
	if(x==0)return 0;
	return bitcnt(x/2)+(x&1);
}
void dfs(int s)
{
	if(done[s])return ;
	done[s]=1;
	if(bitcnt(s)==1)
	{
		p[s].push_back(node(0,0));
		return ;
	}
	int l,i,j,k;
	for(l=(s-1)&s;l>0;l=(l-1)&s)
	{
		int r=s^l;
		dfs(l);dfs(r);
		for(i=0;i<p[l].size();i++)
			for(j=0;j<p[r].size();j++)
			{
				double xl=sum[r]/(sum[l]+sum[r]);
				double xr=sum[l]/(sum[l]+sum[r]);
				double ll=min(-xl+p[l][i].l,xr+p[r][j].l);
				double rr=max(-xl+p[l][i].r,xr+p[r][j].r);
				p[s].push_back(node(ll,rr));
			}
	}
}
void solve()
{
	int s=(1<<n)-1;
	dfs(s);
	int i;double dist,ans=-1;
	for(i=0;i<p[s].size();i++)
		if((dist=p[s][i].r-p[s][i].l)<r&&dist>ans)ans=dist;
	if(ans!=-1)printf("%.10lf\n",ans);
	else printf("-1\n");

}
int main()
{
	int N,i,j;
	cin>>N;
	while(N--)
	{
		scanf("%lf%d",&r,&n);
		for(i=0;i<n;i++)
			scanf("%lf",&w[i]);
		for(i=0;i<(1<<n);i++)
		{
			sum[i]=0;
			for(j=0;j<n;j++)
				if(i&(1<<j))sum[i]+=w[j];
		}
		memset(done,0,sizeof done);
		for(i=1;i<(1<<n);i++)
			p[i].clear();
		solve();
	}
	return 0;
}