Submission #1632837

---

Source Code Expand

#include <bits/stdc++.h>
#define mset(a,b) memset(a,b,sizeof a)
#define mcpy(a,b) memcpy(a,b,sizeof b)
#define lb(x) ((x)&(-(x)))
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define pii pair<int,int> 
#define dalao 1000000007
#define inf 0x3f3f3f3f
#define N 15
using namespace std;
typedef long long ll;
struct edge{int a,b;double v;bool operator <(const edge& x)const{return v<x.v;};}e[N*N];
int n,a[N],x[N],y[N],fa[N],cnt;
double A,B,dis[N][N],val[1<<N|1],f[1<<N|1];
inline int find(int x){while(fa[x]^x)x=fa[x]=fa[fa[x]];return x;}
inline double min(double a,double b){return a<b?a:b;}
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++)scanf("%d%d%d",&x[i],&y[i],&a[i]);
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)dis[i][j]=sqrt(1ll*(x[i]-x[j])*(x[i]-x[j])+1ll*(y[i]-y[j])*(y[i]-y[j]));
	for(int i=0;i<(1<<n);i++){
		cnt=A=B=0;
		for(int j=0;j<n;j++){
			fa[j]=j;
			if(i>>j&1)A+=a[j];
		}
		for(int j=0;j<n;j++)if(i>>j&1)for(int k=j+1;k<n;k++)if(i>>k&1)
			e[++cnt]=(edge){j,k,dis[j][k]};
		sort(e+1,e+1+cnt);
		for(int j=1;j<=cnt;j++){
			e[j].a=find(e[j].a),e[j].b=find(e[j].b);
			if(e[j].a^e[j].b)fa[e[j].a]=e[j].b,B+=e[j].v;
		}
		val[i]=max(.0,(A-B)/__builtin_popcount(i));
	}
	for(int i=1;i<(1<<n);i++){
		f[i]=val[i];
		for(int j=(i-1)&i;j;j=(j-1)&i)
			f[i]<min(f[j],val[i-j])?f[i]=min(f[j],val[i-j]):0;
	}
	printf("%.12lf",f[(1<<n)-1]);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:22:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<n;i++)scanf("%d%d%d",&x[i],&y[i],&a[i]);
                                                       ^

Judge Result