Submission #3571216


Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))

typedef struct weightEdge{
  double w;
  int a,b;
} node;

int cmp(const void *a,const void *b){
  double p=((node *)a)->w;
  double q=((node *)b)->w;
  return p==q?0:p<q?-1:1;
}

int root(int *u,int x){
  if(u[x]==x) return x;
  return u[x]=root(u,u[x]);
}

int same(int *u,int x,int y){
  return root(u,x)==root(u,y);
}

void unite(int *u,int x,int y){
  x=root(u,x);
  y=root(u,y);
  if(x==y) return;
  u[y]=x;
}

void run(void){
  int n;
  scanf("%d",&n);
  int x[15],y[15],a[15];
  int i,j,k;
  for(i=0;i<n;i++) scanf("%d%d%d",x+i,y+i,a+i);
  double d[15*15];
  for(i=0;i<n;i++){
    for(j=0;j<n;j++){
      int dx=x[i]-x[j];
      int dy=y[i]-y[j];
      d[i*n+j]=sqrt((double)dx*dx+(double)dy*dy);
    }
  }
  double *dp=(double *)calloc(1<<n,sizeof(double));
  for(i=1;i<(1<<n);i++){
    double sum=0;
    int c[15];
    int len=0;
    for(j=0;j<n;j++){
      if((i>>j)&1){
	c[len++]=j;
	sum+=a[j];
      }
    }
    if(len==1){
      dp[i]=sum;
      continue;
    }
    node t[15*15];
    int lent=0;
    for(j=0;j<len;j++) for(k=j+1;k<len;k++) t[lent++]=(node){d[c[j]*n+c[k]],c[j],c[k]};
    qsort(t,lent,sizeof(node),cmp);
    int u[15];
    for(j=0;j<n;j++) u[j]=j;
    double weight=0;
    int cnt=0;
    for(j=0;cnt<len-1;j++){
      if(same(u,t[j].a,t[j].b)) continue;
      unite(u,t[j].a,t[j].b);
      weight+=t[j].w;
      cnt++;
    }
    double local=MAX(0,(sum-weight)/len);
    for(j=1;j<(1<<len)-1;j++){
      int bit=0;
      for(k=0;k<len;k++) if((j>>k)&1) bit|=1<<c[k];
      local=MAX(local,MIN(dp[bit],dp[i^bit]));
    }
    dp[i]=local;
  }
  printf("%.9lf\n",dp[(1<<n)-1]);
}

int main(void){
  run();
  return 0;
}

Submission Info

Submission Time
Task E - Water Distribution
User sansen
Language C (GCC 5.4.1)
Score 1000
Code Size 1866 Byte
Status AC
Exec Time 614 ms
Memory 508 KB

Compile Error

./Main.c: In function ‘run’:
./Main.c:37:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ^
./Main.c:40:20: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   for(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
AC × 2
AC × 46
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 609 ms 384 KB
001.txt AC 609 ms 384 KB
002.txt AC 608 ms 508 KB
003.txt AC 608 ms 384 KB
004.txt AC 608 ms 384 KB
005.txt AC 609 ms 508 KB
006.txt AC 608 ms 384 KB
007.txt AC 607 ms 508 KB
008.txt AC 610 ms 384 KB
009.txt AC 609 ms 384 KB
010.txt AC 609 ms 384 KB
011.txt AC 609 ms 384 KB
012.txt AC 609 ms 384 KB
013.txt AC 611 ms 508 KB
014.txt AC 609 ms 384 KB
015.txt AC 609 ms 384 KB
016.txt AC 607 ms 384 KB
017.txt AC 609 ms 384 KB
018.txt AC 614 ms 384 KB
019.txt AC 609 ms 508 KB
020.txt AC 609 ms 508 KB
021.txt AC 610 ms 508 KB
022.txt AC 608 ms 384 KB
023.txt AC 609 ms 384 KB
024.txt AC 610 ms 508 KB
025.txt AC 609 ms 384 KB
026.txt AC 608 ms 384 KB
027.txt AC 610 ms 508 KB
028.txt AC 609 ms 384 KB
029.txt AC 608 ms 508 KB
030.txt AC 608 ms 384 KB
031.txt AC 609 ms 508 KB
032.txt AC 609 ms 384 KB
033.txt AC 611 ms 384 KB
034.txt AC 608 ms 384 KB
035.txt AC 608 ms 384 KB
036.txt AC 607 ms 384 KB
037.txt AC 609 ms 384 KB
038.txt AC 609 ms 508 KB
039.txt AC 608 ms 508 KB
040.txt AC 1 ms 128 KB
041.txt AC 1 ms 128 KB
042.txt AC 1 ms 128 KB
043.txt AC 1 ms 128 KB
example0.txt AC 1 ms 128 KB
example1.txt AC 608 ms 384 KB