Submission #1003236
Source Code Expand
#include <bits/stdc++.h> using namespace std; struct unionfind { vector<int> par; void init(int n) { par.resize(n); for (int i = 0; i < n; ++i) { par[i] = i; } } int find(int x) { if (par[x] == x) return x; else return par[x] = find(par[x]); } void unite(int x, int y) { x = find(x); y = find(y); par[y] = x; } } uf; int N; int x[16], y[16]; double a[16]; double d[16][16]; double af[1<<15]; double dp[1<<15]; int main() { cin >> N; for (int i = 0; i < N; ++i) { cin >> x[i] >> y[i] >> a[i]; } for (int i = 0; i < N; ++i) { for (int j = 0; j < i; ++j) { double t = (double)(x[i]-x[j]) * (x[i]-x[j]) + (double)(y[i]-y[j]) * (y[i]-y[j]); t = sqrt(t); d[i][j] = d[j][i] = t; } } for (int i = 1; i < (1 << N); ++i) { vector<pair<double, pair<int, int> > >vec; double sm = 0.0; int num = 0; for (int j = 0; j < N; ++j) if ((i >> j) & 1) { sm += a[j]; ++num; for (int k = 0; k < j; ++k) if ((i >> k) & 1) { vec.push_back(make_pair(d[j][k], make_pair(j, k))); } } sort(vec.begin(), vec.end()); uf.init(N); double c = 0.0; for (auto e : vec) { int x = uf.find(e.second.first); int y = uf.find(e.second.second); if (x == y) continue; uf.unite(x, y); c += e.first; } af[i] = max(0.0, (sm-c) / num); } dp[0] = 1e12; for (int i = 1; i < (1<<N); ++i) { for (int j = i; j > 0; --j &= i) { dp[i]=max(dp[i],min(dp[i^j],af[j])); } } printf("%.10f\n", dp[(1<<N)-1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Water Distribution |
User | satashun |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1592 Byte |
Status | AC |
Exec Time | 121 ms |
Memory | 768 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 | 118 ms | 768 KB |
001.txt | AC | 119 ms | 768 KB |
002.txt | AC | 117 ms | 768 KB |
003.txt | AC | 118 ms | 768 KB |
004.txt | AC | 121 ms | 768 KB |
005.txt | AC | 116 ms | 768 KB |
006.txt | AC | 119 ms | 768 KB |
007.txt | AC | 117 ms | 768 KB |
008.txt | AC | 118 ms | 768 KB |
009.txt | AC | 118 ms | 768 KB |
010.txt | AC | 118 ms | 768 KB |
011.txt | AC | 119 ms | 768 KB |
012.txt | AC | 118 ms | 768 KB |
013.txt | AC | 115 ms | 768 KB |
014.txt | AC | 118 ms | 768 KB |
015.txt | AC | 120 ms | 768 KB |
016.txt | AC | 116 ms | 768 KB |
017.txt | AC | 118 ms | 768 KB |
018.txt | AC | 117 ms | 768 KB |
019.txt | AC | 116 ms | 768 KB |
020.txt | AC | 115 ms | 768 KB |
021.txt | AC | 119 ms | 768 KB |
022.txt | AC | 118 ms | 768 KB |
023.txt | AC | 114 ms | 768 KB |
024.txt | AC | 117 ms | 768 KB |
025.txt | AC | 112 ms | 768 KB |
026.txt | AC | 114 ms | 768 KB |
027.txt | AC | 113 ms | 768 KB |
028.txt | AC | 111 ms | 768 KB |
029.txt | AC | 112 ms | 768 KB |
030.txt | AC | 111 ms | 768 KB |
031.txt | AC | 113 ms | 768 KB |
032.txt | AC | 111 ms | 768 KB |
033.txt | AC | 111 ms | 768 KB |
034.txt | AC | 108 ms | 768 KB |
035.txt | AC | 111 ms | 768 KB |
036.txt | AC | 111 ms | 768 KB |
037.txt | AC | 109 ms | 768 KB |
038.txt | AC | 114 ms | 768 KB |
039.txt | AC | 110 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 | 118 ms | 768 KB |