CF163D Large Refrigerator

题目描述

Vasya wants to buy a new refrigerator. He believes that a refrigerator should be a rectangular parallelepiped with integer edge lengths. Vasya calculated that for daily use he will need a refrigerator with volume of at least $V$ . Moreover, Vasya is a minimalist by nature, so the volume should be no more than $V$ , either — why take up extra space in the apartment? Having made up his mind about the volume of the refrigerator, Vasya faced a new challenge — for a fixed volume of $V$ the refrigerator must have the minimum surface area so that it is easier to clean.

The volume and the surface area of a refrigerator with edges $a$ , $b$ , $c$ are equal to $V=abc$ and $S=2(ab+bc+ca)$ , correspondingly.

Given the volume $V$ , help Vasya find the integer lengths for the refrigerator's edges $a$ , $b$ , $c$ so that the refrigerator's volume equals $V$ and its surface area $S$ is minimized.

输入输出格式

输入格式：

The first line contains a single integer $t$ ( $1<=t<=500$ ) — the number of data sets.

The description of $t$ data sets follows. Each set consists of a single integer $V$ ( 2<=V<=1018 2<=V<=10^{18} 2<=V<=1018 ), given by its factorization as follows.

Let $V$ = p1a1p2a2... pkak p_{1}^{a_{1}}p_{2}^{a_{2}}...\ p_{k}^{a_{k}} p1a1​​p2a2​​... pkak​​ , where pi p_{i} pi​ are different prime numbers and ai a_{i} ai​ are positive integer powers.

Then the first line describing a data set contains a single positive integer $k$ — the number of different prime divisors of $V$ . Next $k$ lines contain prime numbers pi p_{i} pi​ and their powers ai a_{i} ai​ , separated by spaces. All pi p_{i} pi​ are different, all $ a_{i}&gt;0 $ .

输出格式：

Print $t$ lines, on the $i$ -th line print the answer to the $i$ -th data set as four space-separated integers: the minimum possible surface area $S$ and the corresponding edge lengths $a$ , $b$ , $c$ . If there are multiple variants of the lengths of edges that give the minimum area, you are allowed to print any of them. You can print the lengths of the fridge's edges in any order.

输入输出样例

输入样例#1： 复制

3
1
2 3
1
17 1
3
3 1
2 3
5 1

输出样例#1： 复制

24 2 2 2
70 1 1 17
148 4 6 5

说明

In the first data set of the sample the fridge's volume V=23=8 V=2^{3}=8 V=23=8 , and the minimum surface area will be produced by the edges of equal length.

In the second data set the volume $V=17$ , and it can be produced by only one set of integer lengths.

题解

设$a<=b<=c$
所以有$a<=\sqrt[3]{V}$
然后$bc=\frac{V}{a}$
由均值不等式 $b+c<=2\sqrt{\frac{V}{a}}$
所以$S_{min}=2(ab+bc+ac)=2(a(b+c)+bc)=2(a\ast 2\sqrt{\frac{V}{a}}+\frac{V}{a})=4a\sqrt{\frac{V}{a}}+2\frac{V}{a}$
由于$b$和$c$为整数，结果可能大于$S_{min}$，利用这个性质，可以进行剪枝。

具体实现：
我们枚举$a$，将现有最小值和期望最小值进行比较
若现有最小值$<=$期望最小值， 则可以剪枝。
再用一个$dfs$求出$b$和$c$即可。

这个精度比较坑人，需要$double$

#include <bits/stdc++.h>
#define MOD
#define MAXN 505
#define MAXM
#define LL long long
#define ll long long
#define mem(a) memset(a,0,sizeof(a))
#define memmax(a) memset(a,0x3f,sizeof(a))
#define int long long
using namespace std;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while (ch<'0'||ch>'9'){
		if (ch=='-') f=-1;
		ch=getchar();
	}
	while (ch>='0'&&ch<='9'){
		x=(x*10)+(ch-'0');
		ch=getchar();
	}
	return x*f;
}
int Pow[25][MAXN],n,V,ans,B;
int val[MAXN];
void dfs2(int i,int b,int a){//求maxb 
	if ((double)b*b>V/a){//保证b<=c 
		return ;
	}
	if (i>n){
		B=max(B,b);
		return ;
	}
	for (register int j=val[i];j>=0;--j){
		dfs2(i+1,b*Pow[i][j],a);
	}
}
int ansA,ansB,ansC;
void dfs1(int i,int a){//求a 
	if ((double)a*a*a>V){
		return ;
	}
	if (i>n){
		const int t=V/a;
		int Smax=4*a*sqrt(t)+2*t;//期望最大值 
		if (Smax>=ans) return ;//最优性剪枝
		B=0,dfs2(1,1,a);
		int c=V/a/B,Ans=(a*B+B*c+c*a)<<1;
		if (Ans<ans){
			ans=Ans;
			ansA=a,ansB=B,ansC=c;
		}
		return ;
	}
	for (register int j=val[i];j>=0;--j){
		val[i]-=j;
		dfs1(i+1,a*Pow[i][j]);
		val[i]+=j;
	}
}
#undef int
int main(){
#define int long long
    int T;
	cin>>T;
	while (T--){
		cin>>n;
		V=1;
		for (register int i=1;i<=n;++i){
		    int a,b;
			cin>>a>>b;
			val[i]=b;
			Pow[i][0]=1;
			for (register int j=1;j<=b;++j){
				Pow[i][j]=Pow[i][j-1]*a;
			}
			V*=Pow[i][b];
		}
		ans=1ll<<62;
		dfs1(1,1);
		cout<<ans<<" "<<ansA<<" "<<ansB<<" "<<ansC<<endl;
	}
}