Submission #1070596
Source Code Expand
#include <iostream> #include <fstream> #include <set> #include <map> #include <string> #include <vector> #include <bitset> #include <algorithm> #include <cstring> #include <cstdlib> #include <cmath> #include <cassert> #include <queue> #define mp make_pair #define pb push_back typedef long long ll; typedef long double ld; using namespace std; int n; ld x[20]; ld y[20]; ld a[20]; ld dp[1 << 16]; int p[20]; int sz[20]; int get(int a) { if (p[a] == a) return a; return p[a] = get(p[a]); } int un(int a, int b) { a = get(a); b = get(b); if (a == b) return 0; if (sz[a] < sz[b]) swap(a, b); p[b] = a; sz[a] += sz[b]; return 1; } int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> x[i] >> y[i] >> a[i]; dp[0] = 1e9 + 100; for (int i = 1; i < (1 << n); ++i) { vector<tuple<ld, int, int> > eds; for (int i = 0; i < n; ++i) p[i] = i, sz[i] = 1; for (int j = 0; j < n; ++j) { if ((i >> j) & 1) for (int k = j + 1; k < n; ++k) { if ((i >> k) & 1) eds.push_back(make_tuple(sqrt((x[j] - x[k]) * (x[j] - x[k]) + (y[j] - y[k]) * (y[j] - y[k])), j, k)); } } sort(eds.begin(), eds.end()); ld sum = 0; for (int j = 0; j < eds.size(); ++j) { ld x; int a, b; tie(x, a, b) = eds[j]; if (un(a, b)) sum += x; } sum = -sum; int cnt = 0; for (int j = 0; j < n; ++j) if ((i >> j) & 1) sum += a[j], ++cnt; dp[i] = max(dp[i], sum / cnt); for (int j = i; j > 0; j = (j - 1) & i) dp[i] = max(dp[i], min(dp[j], dp[i ^ j])); } cout.setf(ios::fixed); cout.precision(10); cout << dp[(1 << n) - 1] << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Water Distribution |
User | LHiC |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1697 Byte |
Status | AC |
Exec Time | 208 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 | 199 ms | 768 KB |
001.txt | AC | 197 ms | 768 KB |
002.txt | AC | 190 ms | 768 KB |
003.txt | AC | 196 ms | 768 KB |
004.txt | AC | 201 ms | 768 KB |
005.txt | AC | 193 ms | 768 KB |
006.txt | AC | 202 ms | 768 KB |
007.txt | AC | 193 ms | 768 KB |
008.txt | AC | 200 ms | 768 KB |
009.txt | AC | 200 ms | 768 KB |
010.txt | AC | 204 ms | 768 KB |
011.txt | AC | 202 ms | 768 KB |
012.txt | AC | 203 ms | 768 KB |
013.txt | AC | 194 ms | 768 KB |
014.txt | AC | 204 ms | 768 KB |
015.txt | AC | 208 ms | 768 KB |
016.txt | AC | 193 ms | 768 KB |
017.txt | AC | 203 ms | 768 KB |
018.txt | AC | 201 ms | 768 KB |
019.txt | AC | 195 ms | 768 KB |
020.txt | AC | 176 ms | 768 KB |
021.txt | AC | 190 ms | 768 KB |
022.txt | AC | 189 ms | 768 KB |
023.txt | AC | 179 ms | 768 KB |
024.txt | AC | 178 ms | 768 KB |
025.txt | AC | 174 ms | 768 KB |
026.txt | AC | 181 ms | 768 KB |
027.txt | AC | 176 ms | 768 KB |
028.txt | AC | 178 ms | 768 KB |
029.txt | AC | 177 ms | 768 KB |
030.txt | AC | 175 ms | 768 KB |
031.txt | AC | 178 ms | 768 KB |
032.txt | AC | 172 ms | 768 KB |
033.txt | AC | 174 ms | 768 KB |
034.txt | AC | 169 ms | 768 KB |
035.txt | AC | 170 ms | 768 KB |
036.txt | AC | 170 ms | 768 KB |
037.txt | AC | 170 ms | 768 KB |
038.txt | AC | 170 ms | 768 KB |
039.txt | AC | 171 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 | 184 ms | 768 KB |