E - Booster（数位dp，TSP旅行商问题）

最新推荐文章于 2024-07-25 21:13:04 发布

to cling

最新推荐文章于 2024-07-25 21:13:04 发布

阅读量392

点赞数 1

分类专栏： dp 文章标签： 1024程序员节算法动态规划

本文链接：https://blog.csdn.net/QQ2530063577/article/details/127489692

版权

dp 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

AtCoder Beginner Contest 274

Problem

在这里插入图片描述

Solution

Esay version
1. 可以先不考虑chest，仅仅考虑如何只经过N个town所用时间最短
2. 状态定义
  $d p [i] [S] = 最终到达第 i 个 t o w n ，经过的 t o w n 状态为 S 的最短时间$
3. 状态转移
  $dp[i][S] = min(dp[j][S - 2^i] + time(i, j)~), ~~S >> i ~\& ~ 1 = 1 ~and~S >> j ~\& ~ 1 = 1$
  $an s = min (d p [i] [S] + t im e (i, 0))$
4. 时间复杂度
  $O(2^nn^2)$
Hard version
可以把chest也看作town，最终可以不经过chest回到原点，但是town点必须全部经过。

Code

double dp[20][140000];
pii s[20];
 
int main()
{
	IOS;
	int n, m; cin >> n >> m;
	for (int i = 0; i < n + m; i++) cin >> s[i].ft >> s[i].sd;
 
	for (int i = 0; i < n + m; i++)
		for (int j = 0; j < 1 << n + m; j++)
			dp[i][j] = 1e18;
	for (int i = 0; i < n + m; i++)
		dp[i][1 << i] = hypot(s[i].ft, s[i].sd);
 
	for (int k = 1; k < 1 << n + m; k++)
	{
		int v = 1 << __builtin_popcount(k >> n);
		for (int i = 0; i < n + m; i++)
			if (k & 1 << i)
				for (int j = 0; j < n + m; j++)
					if (k & 1 << j)
					{
						double time = hypot(s[i].ft - s[j].ft, s[i].sd - s[j].sd) / v;
						if (i >= n) time *= 2;
						dp[i][k] = min(dp[i][k], dp[j][k - (1 << i)] + time);
					}
	}
 
	double ans = 1e18;
	for (int i = 0; i < n + m; i++)
		for (int j = (1 << n) - 1; j < 1 << n + m; j += 1 << n)
			if (j & 1 << i)
			{
				int v = 1 << __builtin_popcount(j >> n);
				double last_time = hypot(s[i].ft, s[i].sd) / v;
				ans = min(ans, dp[i][j] + last_time);
			}
	cout << fixed << setprecision(8) << ans << endl;
 
 
	return 0;
}

Easy version

题目链接

#define O2 #pragma GCC optimize(2)
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define pii pair<int, int>
const int inf = 0x3f3f3f3f;
int dp[20][140000];
struct node
{
	int x, y, z;
}s[20];
 
int d[20][20];
 
int main()
{
	IOS;
	int n; cin >> n;
	for (int i = 0; i < n; i++) cin >> s[i].x >> s[i].y >> s[i].z;
 
	mt(d, 0x3f);
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			d[i][j] = abs(s[i].x - s[j].x) + abs(s[i].y - s[j].y) + max(0, s[j].z - s[i].z);
	for (int k = 0; k < n; k++)
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
 
	mt(dp, 0x3f);
	dp[0][1] = 0;
	for (int k = 1; k < 1 << n; k++)
		for (int i = 0; i < n; i++)
			if (k & 1 << i)
				for (int j = 0; j < n; j++)
					if (k & 1 << j)
						dp[i][k] = min(dp[i][k], dp[j][k - (1 << i)] + d[j][i]);
 
	int ans = inf;
	for (int i = 0; i < n; i++)
		ans = min(ans, dp[i][(1 << n) - 1] + d[i][0]);
	cout << ans << endl;
 
 
	return 0;
}