记录编号	571721	评测结果	AAATTTTTTT
题目名称	3674.[CF8C]Looking for Order	最终得分	30
用户昵称	HXF	是否通过	未通过
代码语言	C++	运行时间	35.102 s
提交时间	2022-06-15 22:05:32	内存使用	69.74 MiB

#include<bits/stdc++.h>
using namespace std;
int n,x[25],y[25],f[1<<24],fz[25];
int solve(int a1,int a2){return (x[a1]-x[a2])*(x[a1]-x[a2])+(y[a1]-y[a2])*(y[a1]-y[a2]);}
int main(){
	freopen("lenepack.in","r",stdin);
	freopen("lenepack.out","w",stdout);
    scanf("%d%d",&x[0],&y[0]);
    scanf("%d",&n);
    fz[0]=1;
    for(int i=1;i<=n;i++)fz[i]=fz[i-1]*2;
    memset(f,0x3f,sizeof(f));
    f[0]=0;
    for(int i=1;i<=n;i++)scanf("%d%d",&x[i],&y[i]);
    for(int i=0;i<fz[n];i++){
    	for(int j=1;j<=n;j++){
    		if((i>>j-1)&1)continue;
    		f[i+fz[j-1]]=min(f[i+fz[j-1]],f[i]+solve(0,j)*2);
    		if(j!=n)for(int k=j+1;k<=n;k++){
    			if((i>>k-1)&1)continue;
    			f[i+fz[j-1]+fz[k-1]]=min(f[i+fz[j-1]+fz[k-1]],f[i]+solve(0,j)+solve(j,k)+solve(k,0));
			}
		}	
	}
    printf("%d\n",f[fz[n]-1]);
    return 0;
}