Submission #2165397
Source Code Expand
// #include {{{ #include <iostream> #include <cassert> #include <cstring> #include <cstdlib> #include <cstdio> #include <cctype> #include <cmath> #include <ctime> #include <queue> #include <set> #include <map> #include <stack> #include <string> #include <bitset> #include <vector> #include <complex> #include <algorithm> using namespace std; // }}} // #define {{{ typedef long long ll; typedef double db; typedef pair<int,int> pii; typedef vector<int> vi; #define de(x) cout << #x << "=" << x << endl #define rep(i,a,b) for(int i=a;i<(b);++i) #define per(i,a,b) for(int i=(b)-1;i>=(a);--i) #define all(x) (x).begin(),(x).end() #define sz(x) (int)(x).size() #define mp make_pair #define pb push_back #define fi first #define se second // }}} const int N = 15; int n , x[N] , y[N] , a[N] , fa[N]; db f[1 << N] , dis[N][N]; inline int F(int x) {return fa[x] == x ? x : fa[x] = F(fa[x]);} int main(){ cin >> n; rep(i,0,n) cin >> x[i] >> y[i] >> a[i]; rep(i,0,n) rep(j,0,n) { db dx = x[i] - x[j]; db dy = y[i] - y[j]; dis[i][j] = sqrt(dx*dx+dy*dy); } rep(i,0,1<<n) { if(i == 0) continue; vi pts; rep(j,0,n) if(i >> j & 1) pts.pb(j); vector<pair<db,pii> > edges; rep(i,0,sz(pts)) rep(j,0,i) { edges.pb(mp(dis[pts[i]][pts[j]] , mp(pts[i] , pts[j]))); } sort(all(edges)); for(int p : pts) fa[p] = p; db cost = 0.; for(auto e : edges) { int u = F(e.se.fi); int v = F(e.se.se); if(u != v) { fa[v] = u; cost += e.fi; } } db sum = 0; for(int p : pts) sum += a[p]; f[i] = (sum - cost) / sz(pts); } rep(i,1,1<<n) { for(int j=i;j;j=(j-1)&i) { f[i] = max(f[i] , min(f[j] , f[i ^ j])); } } printf("%.12f\n",f[(1<<n)-1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Water Distribution |
User | Y_UME |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1846 Byte |
Status | AC |
Exec Time | 117 ms |
Memory | 512 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 | 114 ms | 512 KB |
001.txt | AC | 113 ms | 512 KB |
002.txt | AC | 112 ms | 512 KB |
003.txt | AC | 113 ms | 512 KB |
004.txt | AC | 115 ms | 512 KB |
005.txt | AC | 112 ms | 512 KB |
006.txt | AC | 115 ms | 512 KB |
007.txt | AC | 113 ms | 512 KB |
008.txt | AC | 114 ms | 512 KB |
009.txt | AC | 115 ms | 512 KB |
010.txt | AC | 115 ms | 512 KB |
011.txt | AC | 116 ms | 512 KB |
012.txt | AC | 115 ms | 512 KB |
013.txt | AC | 112 ms | 512 KB |
014.txt | AC | 116 ms | 512 KB |
015.txt | AC | 117 ms | 512 KB |
016.txt | AC | 113 ms | 512 KB |
017.txt | AC | 116 ms | 512 KB |
018.txt | AC | 114 ms | 512 KB |
019.txt | AC | 113 ms | 512 KB |
020.txt | AC | 110 ms | 512 KB |
021.txt | AC | 112 ms | 512 KB |
022.txt | AC | 110 ms | 512 KB |
023.txt | AC | 109 ms | 512 KB |
024.txt | AC | 109 ms | 512 KB |
025.txt | AC | 107 ms | 512 KB |
026.txt | AC | 110 ms | 512 KB |
027.txt | AC | 109 ms | 512 KB |
028.txt | AC | 109 ms | 512 KB |
029.txt | AC | 109 ms | 512 KB |
030.txt | AC | 109 ms | 512 KB |
031.txt | AC | 109 ms | 512 KB |
032.txt | AC | 109 ms | 512 KB |
033.txt | AC | 109 ms | 512 KB |
034.txt | AC | 106 ms | 512 KB |
035.txt | AC | 110 ms | 512 KB |
036.txt | AC | 109 ms | 512 KB |
037.txt | AC | 107 ms | 512 KB |
038.txt | AC | 108 ms | 512 KB |
039.txt | AC | 108 ms | 512 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 | 111 ms | 512 KB |