Submission #2072929
Source Code Expand
#include<stdio.h> #include<vector> #include<algorithm> #include<math.h> #include<stdlib.h> using namespace std; #define SIZE 20 class unionfind { public: int par[SIZE]; int ran[SIZE]; int ren[SIZE]; void init() { for (int i = 0; i<SIZE; i++) { par[i] = i; ran[i] = 0; ren[i] = 1; } } int find(int a) { if (a == par[a])return a; else return par[a] = find(par[a]); } void unite(int a, int b) { a = find(a); b = find(b); if (a == b)return; if (ran[a]>ran[b]) { par[b] = a; ren[a] += ren[b]; } else { par[a] = b; ren[b] += ren[a]; } if (ran[a] == ran[b])ran[b]++; } }; unionfind uf[1 << 15]; double cst[1 << 15]; double x[15], y[15], a[15]; double dp[1 << 15]; typedef pair<int, int>pii; typedef pair<double, pii>pdi; int main() { int num; scanf("%d", &num); for (int i = 0; i < num; i++)scanf("%lf%lf%lf", &x[i], &y[i], &a[i]); vector<pdi>v; for (int i = 0; i < num; i++)for (int j = i + 1; j < num; j++)v.push_back(make_pair(sqrt((x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j])), make_pair(i, j))); sort(v.begin(), v.end()); for (int i = 0; i < (1 << num); i++)uf[i].init(); for (int i = 0; i < v.size(); i++) { int s = v[i].second.first, t = v[i].second.second; double d = v[i].first; for (int p = 0; p < (1 << num); p++) { if ((p&(1 << s)) != 0 && (p&(1 << t)) != 0) { if (uf[p].find(s) != uf[p].find(t)) { cst[p] -= d; uf[p].unite(s, t); } } } } for (int p = 1; p < (1 << num); p++) { int cnt = 0; for (int i = 0; i < num; i++)if (p&(1 << i))cst[p] += a[i], cnt++; cst[p] /= cnt; } dp[0] = 1000000000000000000.0; for (int p = 0; p < (1 << num); p++) { int mask = (1 << num) - 1 - p; int now = mask; for (;;) { if (now == 0)break; dp[p + now] = max(dp[p + now], min(dp[p], cst[now])); now--; now &= mask; } } printf("%.20lf\n", dp[(1 << num) - 1]); }
Submission Info
Submission Time | |
---|---|
Task | E - Water Distribution |
User | DEGwer |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 2006 Byte |
Status | AC |
Exec Time | 70 ms |
Memory | 8448 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:55:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &num); ^ ./Main.cpp:56:70: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 0; i < num; i++)scanf("%lf%lf%lf", &x[i], &y[i], &a[i]); ^
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 | 66 ms | 8448 KB |
001.txt | AC | 68 ms | 8448 KB |
002.txt | AC | 68 ms | 8448 KB |
003.txt | AC | 68 ms | 8448 KB |
004.txt | AC | 70 ms | 8448 KB |
005.txt | AC | 64 ms | 8448 KB |
006.txt | AC | 69 ms | 8448 KB |
007.txt | AC | 66 ms | 8448 KB |
008.txt | AC | 67 ms | 8448 KB |
009.txt | AC | 67 ms | 8448 KB |
010.txt | AC | 67 ms | 8448 KB |
011.txt | AC | 68 ms | 8448 KB |
012.txt | AC | 67 ms | 8448 KB |
013.txt | AC | 64 ms | 8448 KB |
014.txt | AC | 67 ms | 8448 KB |
015.txt | AC | 69 ms | 8448 KB |
016.txt | AC | 65 ms | 8448 KB |
017.txt | AC | 67 ms | 8448 KB |
018.txt | AC | 66 ms | 8448 KB |
019.txt | AC | 65 ms | 8448 KB |
020.txt | AC | 65 ms | 8448 KB |
021.txt | AC | 70 ms | 8448 KB |
022.txt | AC | 70 ms | 8448 KB |
023.txt | AC | 65 ms | 8448 KB |
024.txt | AC | 69 ms | 8448 KB |
025.txt | AC | 65 ms | 8448 KB |
026.txt | AC | 67 ms | 8448 KB |
027.txt | AC | 63 ms | 8448 KB |
028.txt | AC | 60 ms | 8448 KB |
029.txt | AC | 60 ms | 8448 KB |
030.txt | AC | 58 ms | 8448 KB |
031.txt | AC | 63 ms | 8448 KB |
032.txt | AC | 59 ms | 8448 KB |
033.txt | AC | 58 ms | 8448 KB |
034.txt | AC | 57 ms | 8448 KB |
035.txt | AC | 58 ms | 8448 KB |
036.txt | AC | 57 ms | 8448 KB |
037.txt | AC | 57 ms | 8448 KB |
038.txt | AC | 56 ms | 8448 KB |
039.txt | AC | 58 ms | 8448 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 | 66 ms | 8448 KB |