P1433吃奶酪

状态压缩 + dfs

// Problem: P1433 吃奶酪
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P1433
// Memory Limit: 128 MB
// Time Limit: 1000 ms
// Date: 2024-03-27 20:06:38
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define endl '\n'
#define int int64_t
#define ld long double
using namespace std;
int dx[] = { -1,0,1,0 };
int dy[] = { 0,1,0,-1 };
const int NC = 2e3 + 10;
char ches[NC][NC];
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
int a[N], b[N], n, m, k;
ld ans = INT_MAX;
struct Node {
	ld x, y;
}nd[N];
ld vis[20];
ld f[20][33000];
ld cal(Node& a, Node& b) {
	return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
void dfs(int u, int lastid, Node last, int status, ld dis) {
	if (dis >= ans)
		return;
	if (u == n + 1) {
		ans = min(ans, dis);
		return;
	}
	for (int i = 1; i <= n; ++i) {
		if (!vis[i]) {
			int newStatus = status + (1 << (i - 1));
			if (f[i][newStatus] && f[i][newStatus] <= f[lastid][status] + cal(last, nd[i]))
				continue;
			f[i][newStatus] = f[lastid][status] + cal(last, nd[i]);
			vis[i] = 1;
			dfs(u + 1, i, nd[i], newStatus, dis + cal(last, nd[i]));
			vis[i] = 0;
		}
	}
}
void solve() {
	cin >> n;
	nd[0] = { 0,0 };
	for (int i = 1; i <= n; ++i) {
		cin >> nd[i].x >> nd[i].y;
	}
	dfs(1, 0, nd[0], 0, 0);
	cout << fixed << setprecision(2) << ans << endl;
}
signed main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}