题目描述:
输入
输出 最小花费,保留两位小数
样例输入
2
2 1 1
0 0
4 4
3 100 1
0 0
1 1
500 500
样例输出
2.00
201.41
思路:暴力枚举。。。
由于n比较小,状压n(分tot个基站,n-tot个非基站),暴力dfs每一个非基站(遍历其向每一个基站靠拢后的最小结果);
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
const int MAXN = 10;
int a[MAXN], b[MAXN], R[MAXN];
int x[MAXN], y[MAXN];
double cs, cr, ans = 1000000000.0;
int tot, n, p;
inline int dis(int i, int j) {
return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
}
inline void dfs(int x) {
if(x == p + 1) {
double cnt = 0;
for(int i = 1; i <= tot; ++i) {
cnt = cnt + sqrt(double(R[i]));
}
ans = min(ans, cnt * cr + double(tot) * cs);
// printf("%.2lf %.2lf\n", ans, cnt);
return ;
}
for(int i = 1; i <= tot; ++i) {
int dist = dis(a[i], b[x]);
int temp = R[i];
R[i] = max(R[i], dist);
dfs(x + 1);
R[i] = temp;
}
}
int main() {
int T;
scanf("%d", &T);
while(T--) {
ans = 100000000.0;
scanf("%d %lf %lf", &n, &cs, &cr);
for(int i = 1; i <= n; ++i) {
scanf("%d %d", &x[i], &y[i]);
}
for(int i = 1; i < (1 << n); ++i) {
tot = 0, p = 0;
memset(R, 0, sizeof(R));
for(int j = 0; j < n; ++j) {
if(i & (1 << j)) a[++tot] = j + 1;
else b[++p] = j + 1;
}
dfs(1);
}
printf("%.2lf\n", ans);
}
return 0;
}