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
Submission Time
2017-09-28 20:57:53+0900
Task
E - Water Distribution
User
cdsfcesf
Language
C++14 (GCC 5.4.1)
Score
1000
Code Size
1440 Byte
Status
AC
Exec Time
87 ms
Memory
768 KB
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
Set Name
Sample
All
Score / Max Score
0 / 0
1000 / 1000
Status
Set Name
Test Cases
Sample
example0.txt, example1.txt
All
000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, example0.txt, example1.txt
Case Name
Status
Exec Time
Memory
000.txt
AC
82 ms
768 KB
001.txt
AC
85 ms
768 KB
002.txt
AC
81 ms
768 KB
003.txt
AC
83 ms
768 KB
004.txt
AC
87 ms
768 KB
005.txt
AC
79 ms
768 KB
006.txt
AC
86 ms
768 KB
007.txt
AC
80 ms
768 KB
008.txt
AC
84 ms
768 KB
009.txt
AC
83 ms
768 KB
010.txt
AC
84 ms
768 KB
011.txt
AC
85 ms
768 KB
012.txt
AC
84 ms
768 KB
013.txt
AC
79 ms
768 KB
014.txt
AC
84 ms
768 KB
015.txt
AC
87 ms
768 KB
016.txt
AC
77 ms
768 KB
017.txt
AC
84 ms
768 KB
018.txt
AC
82 ms
768 KB
019.txt
AC
79 ms
768 KB
020.txt
AC
76 ms
768 KB
021.txt
AC
82 ms
768 KB
022.txt
AC
82 ms
768 KB
023.txt
AC
72 ms
768 KB
024.txt
AC
80 ms
768 KB
025.txt
AC
69 ms
768 KB
026.txt
AC
74 ms
768 KB
027.txt
AC
68 ms
768 KB
028.txt
AC
64 ms
768 KB
029.txt
AC
64 ms
768 KB
030.txt
AC
62 ms
768 KB
031.txt
AC
68 ms
768 KB
032.txt
AC
61 ms
768 KB
033.txt
AC
62 ms
768 KB
034.txt
AC
59 ms
768 KB
035.txt
AC
60 ms
768 KB
036.txt
AC
61 ms
768 KB
037.txt
AC
60 ms
768 KB
038.txt
AC
60 ms
768 KB
039.txt
AC
61 ms
768 KB
040.txt
AC
1 ms
256 KB
041.txt
AC
1 ms
256 KB
042.txt
AC
1 ms
256 KB
043.txt
AC
1 ms
256 KB
example0.txt
AC
1 ms
256 KB
example1.txt
AC
79 ms
768 KB