Submission #1005311
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }
struct City {
int x, y, a;
};
int main() {
int N;
while(~scanf("%d", &N)) {
vector<City> cities(N);
rep(i, N) {
int x; int y; int a;
scanf("%d%d%d", &x, &y, &a);
cities[i] = { x, y, a };
}
vector<vector<double>> dist(N, vector<double>(N));
rep(i, N) rep(j, N)
dist[i][j] = hypot(cities[i].x - cities[j].x, cities[i].y - cities[j].y);
vector<double> mstCost(1 << N, 1e99);
rep(i, N) mstCost[1 << i] = 0;
reu(S, 1, (1 << N) - 1) {
double x = mstCost[S];
rep(i, N) if(S >> i & 1) rep(j, N) if(~S >> j & 1)
amin(mstCost[S | 1 << j], x + dist[i][j]);
}
vector<double> value(1 << N);
reu(S, 1, 1 << N) {
double A = 0;
int K = 0;
rep(i, N) if(S >> i & 1) {
A += cities[i].a;
++ K;
}
value[S] = max(0., A - mstCost[S]) / K;
}
vector<double> dp(1 << N);
dp[0] = 1e99;
reu(S, 1, 1 << N) {
double x = 0;
for(int T = S; T > 0; (-- T) &= S)
amax(x, min(value[T], dp[S - T]));
dp[S] = x;
}
double ans = dp.back();
printf("%.10f\n", ans);
}
return 0;
}
Submission Info
Submission Time
2016-12-02 14:26:47+0900
Task
E - Water Distribution
User
anta
Language
C++14 (GCC 5.4.1)
Score
1000
Code Size
1676 Byte
Status
AC
Exec Time
41 ms
Memory
1152 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:21:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &x, &y, &a);
^
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
41 ms
1024 KB
001.txt
AC
41 ms
1024 KB
002.txt
AC
41 ms
1024 KB
003.txt
AC
41 ms
1024 KB
004.txt
AC
41 ms
1024 KB
005.txt
AC
41 ms
1024 KB
006.txt
AC
41 ms
1024 KB
007.txt
AC
41 ms
1024 KB
008.txt
AC
41 ms
1024 KB
009.txt
AC
40 ms
1024 KB
010.txt
AC
41 ms
1024 KB
011.txt
AC
41 ms
1024 KB
012.txt
AC
41 ms
1024 KB
013.txt
AC
40 ms
1024 KB
014.txt
AC
41 ms
1024 KB
015.txt
AC
41 ms
1024 KB
016.txt
AC
41 ms
1024 KB
017.txt
AC
41 ms
1024 KB
018.txt
AC
41 ms
1024 KB
019.txt
AC
41 ms
1024 KB
020.txt
AC
41 ms
1024 KB
021.txt
AC
41 ms
1024 KB
022.txt
AC
41 ms
1024 KB
023.txt
AC
41 ms
1024 KB
024.txt
AC
41 ms
1024 KB
025.txt
AC
41 ms
1024 KB
026.txt
AC
41 ms
1024 KB
027.txt
AC
41 ms
1024 KB
028.txt
AC
41 ms
1024 KB
029.txt
AC
41 ms
1024 KB
030.txt
AC
40 ms
1152 KB
031.txt
AC
41 ms
1024 KB
032.txt
AC
41 ms
1024 KB
033.txt
AC
41 ms
1024 KB
034.txt
AC
41 ms
1024 KB
035.txt
AC
41 ms
1024 KB
036.txt
AC
41 ms
1024 KB
037.txt
AC
41 ms
1024 KB
038.txt
AC
41 ms
1024 KB
039.txt
AC
40 ms
1024 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
41 ms
1024 KB