Submission #1087438
Source Code Expand
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int n, C[15];
double w[15][15], MM[32768], D[32768];
struct point{
int x,y;
}P[15];
double Prim(int mask){
int i, j;
double DP[15], res = 0.0;
bool v[15];
for(i=0;i<n;i++)DP[i]=1e18,v[i]=false;
for(i=0;i<n;i++)if((1<<i)&mask)break;
DP[i]=0.0;
while(1){
double Mn = 1e18;
int pv = -1;
for(j=0;j<n;j++){
if(!((1<<j)&mask))continue;
if(Mn>DP[j] && !v[j])Mn=DP[j],pv=j;
}
if(pv==-1)break;
res += DP[pv];
v[pv] = true;
for(j=0;j<n;j++)DP[j] = min(DP[j],w[pv][j]);
}
return res;
}
void DFS(int m1, int m2, int cur, int pv){
if(pv==n){
D[m1|cur] = max(D[m1|cur], min(D[m1],MM[cur]));
return;
}
if((1<<pv)&m2) DFS(m1, m2, cur|(1<<pv), pv+1);
DFS(m1, m2, cur, pv+1);
}
int main(){
int i, j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d%d",&P[i].x,&P[i].y,&C[i]);
}
for(i=0;i<n;i++)for(j=0;j<n;j++)w[i][j]=sqrt(1.0*(P[i].x-P[j].x)*(P[i].x-P[j].x)+1.0*(P[i].y-P[j].y)*(P[i].y-P[j].y));
for(i=1;i<(1<<n);i++){
double e = -Prim(i);
int c = 0;
for(j=0;j<n;j++)if(i&(1<<j))e +=C[j], c++;
MM[i] = e/c;
}
D[0] = 1e18;
for(i=0;i<(1<<n);i++){
DFS(i, (1<<n)-1-i, 0, 0);
}
printf("%.11f\n",D[(1<<n)-1]);
}
Submission Info
Submission Time
2017-01-30 11:04:56+0900
Task
E - Water Distribution
User
ainta
Language
C++14 (GCC 5.4.1)
Score
1000
Code Size
1467 Byte
Status
AC
Exec Time
163 ms
Memory
640 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:41:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:43:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&P[i].x,&P[i].y,&C[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
161 ms
640 KB
001.txt
AC
161 ms
640 KB
002.txt
AC
162 ms
640 KB
003.txt
AC
163 ms
640 KB
004.txt
AC
161 ms
640 KB
005.txt
AC
160 ms
640 KB
006.txt
AC
161 ms
640 KB
007.txt
AC
160 ms
640 KB
008.txt
AC
161 ms
640 KB
009.txt
AC
160 ms
640 KB
010.txt
AC
161 ms
640 KB
011.txt
AC
161 ms
640 KB
012.txt
AC
160 ms
640 KB
013.txt
AC
159 ms
640 KB
014.txt
AC
160 ms
640 KB
015.txt
AC
160 ms
640 KB
016.txt
AC
159 ms
640 KB
017.txt
AC
162 ms
640 KB
018.txt
AC
162 ms
640 KB
019.txt
AC
160 ms
640 KB
020.txt
AC
159 ms
640 KB
021.txt
AC
161 ms
640 KB
022.txt
AC
162 ms
640 KB
023.txt
AC
158 ms
640 KB
024.txt
AC
161 ms
640 KB
025.txt
AC
159 ms
640 KB
026.txt
AC
159 ms
640 KB
027.txt
AC
158 ms
640 KB
028.txt
AC
156 ms
640 KB
029.txt
AC
156 ms
640 KB
030.txt
AC
156 ms
640 KB
031.txt
AC
159 ms
640 KB
032.txt
AC
156 ms
640 KB
033.txt
AC
156 ms
640 KB
034.txt
AC
155 ms
640 KB
035.txt
AC
157 ms
640 KB
036.txt
AC
155 ms
640 KB
037.txt
AC
156 ms
640 KB
038.txt
AC
155 ms
640 KB
039.txt
AC
155 ms
640 KB
040.txt
AC
1 ms
128 KB
041.txt
AC
2 ms
128 KB
042.txt
AC
2 ms
128 KB
043.txt
AC
2 ms
128 KB
example0.txt
AC
2 ms
128 KB
example1.txt
AC
160 ms
640 KB