Submission #1004141
Source Code Expand
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) #define all(c) c.begin(),c.end() #define pb push_back #define fs first #define sc second #define show(x) cout << #x << " = " << x << endl #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) using namespace std; template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";} template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;} struct unionfind{ int par[16]; void init(int N){rep(i,N) par[i]=i;} int find(int x){ if(par[x]==x) return x; return par[x]=find(par[x]); } bool same(int x,int y){ return find(x)==find(y); } void unite(int x,int y){ x=find(x),y=find(y); if(x==y) return; par[y]=x; } }UF; typedef pair<int,int> P; typedef pair<double,P> edge; int N; double x[16],y[16],a[16]; double c[1<<16]; double dp[1<<16]; vector<edge> es; double inf=1e50; bool B(int x,int i){return (x>>i)&1;} int main(){ int N; cin>>N; rep(i,N) cin>>x[i]>>y[i]>>a[i]; rep(i,N) rep(j,i){ double dis=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])); es.pb(edge(dis,P(j,i))); } sort(all(es)); rep(b,1<<N){ if(b==0) continue; UF.init(N); double sum=0; rep(i,N) if(B(b,i)) sum+=a[i]; for(edge e:es){ double d=e.fs; int x=e.sc.fs,y=e.sc.sc; if(B(b,x)&&B(b,y)&&!UF.same(x,y)){ sum-=d; UF.unite(x,y); } } c[b]=max(0.0,sum/__builtin_popcount(b)); } dp[0]=inf; rep(b,1<<N){ int left=(1<<N)-1-b; int x=left; do{ chmax(dp[b|x],min(dp[b],c[x])); x=(x-1)&left; }while(x!=0); } printf("%.12f\n",dp[(1<<N)-1]); }
Submission Info
Submission Time | |
---|---|
Task | E - Water Distribution |
User | sigma425 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1817 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 896 KB |
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 | 46 ms | 768 KB |
001.txt | AC | 45 ms | 768 KB |
002.txt | AC | 46 ms | 768 KB |
003.txt | AC | 45 ms | 768 KB |
004.txt | AC | 45 ms | 768 KB |
005.txt | AC | 45 ms | 768 KB |
006.txt | AC | 45 ms | 768 KB |
007.txt | AC | 45 ms | 768 KB |
008.txt | AC | 45 ms | 768 KB |
009.txt | AC | 45 ms | 768 KB |
010.txt | AC | 46 ms | 768 KB |
011.txt | AC | 45 ms | 768 KB |
012.txt | AC | 46 ms | 768 KB |
013.txt | AC | 46 ms | 768 KB |
014.txt | AC | 45 ms | 768 KB |
015.txt | AC | 45 ms | 768 KB |
016.txt | AC | 45 ms | 768 KB |
017.txt | AC | 45 ms | 768 KB |
018.txt | AC | 45 ms | 768 KB |
019.txt | AC | 45 ms | 768 KB |
020.txt | AC | 45 ms | 768 KB |
021.txt | AC | 45 ms | 768 KB |
022.txt | AC | 45 ms | 768 KB |
023.txt | AC | 45 ms | 768 KB |
024.txt | AC | 45 ms | 768 KB |
025.txt | AC | 45 ms | 768 KB |
026.txt | AC | 46 ms | 768 KB |
027.txt | AC | 45 ms | 768 KB |
028.txt | AC | 45 ms | 768 KB |
029.txt | AC | 45 ms | 768 KB |
030.txt | AC | 45 ms | 768 KB |
031.txt | AC | 46 ms | 768 KB |
032.txt | AC | 45 ms | 768 KB |
033.txt | AC | 46 ms | 768 KB |
034.txt | AC | 44 ms | 768 KB |
035.txt | AC | 45 ms | 768 KB |
036.txt | AC | 45 ms | 768 KB |
037.txt | AC | 45 ms | 768 KB |
038.txt | AC | 46 ms | 896 KB |
039.txt | AC | 45 ms | 768 KB |
040.txt | AC | 3 ms | 256 KB |
041.txt | AC | 3 ms | 256 KB |
042.txt | AC | 3 ms | 256 KB |
043.txt | AC | 3 ms | 256 KB |
example0.txt | AC | 3 ms | 256 KB |
example1.txt | AC | 46 ms | 768 KB |