【集训DAY6】出租车【DFS】

思路：

我们dfs(i,now,x,y,z)表示当前i要上车，车在now位置，车上人的目的地分别是x，y，z
多枚举几种情况dfs就行了
加上记忆化就能跑过

$code$

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>

using namespace std;

const int MAXN = 2010;

int n, k, u[MAXN], v[MAXN], f[MAXN][11][11][11][11];

int dis(int x, int y) { return abs(x - y); }

int dfs(int i, int cur, int a, int b, int c) {
	if(f[i][cur][a][b][c] != -1) return f[i][cur][a][b][c];
	int ans = 1e9;
	if(a) ans = min(ans, dfs(i, a, 0, b, c) + dis(a, cur) + 1);
	if(b) ans = min(ans, dfs(i, b, a, 0, c) + dis(b, cur) + 1);
	if(c) ans = min(ans, dfs(i, c, a, b, 0) + dis(c, cur) + 1);
	if(i > n) {
		if(a == 0 && b == 0 && c == 0) return 0;
		f[i][cur][a][b][c] = ans;
		return ans;
	}
	if(a && b && c) {
		ans = min(ans, dfs(i + 1, v[i], a, b, c) + dis(cur, u[i]) + dis(u[i], v[i]) + 2);
		ans = min(ans, dfs(i + 1, a, v[i], b, c) + dis(cur, u[i]) + dis(u[i], a) + 2);
		ans = min(ans, dfs(i + 1, b, a, v[i], c) + dis(cur, u[i]) + dis(u[i], b) + 2);
		ans = min(ans, dfs(i + 1, c, a, b, v[i]) + dis(cur, u[i]) + dis(u[i], c) + 2);
	}
	else {
		if(!a) ans = min(ans, dfs(i + 1, u[i], v[i], b, c) + dis(cur, u[i]) + 1);
		if(!b) ans = min(ans, dfs(i + 1, u[i], a, v[i], c) + dis(cur, u[i]) + 1);
		if(!c) ans = min(ans, dfs(i + 1, u[i], a, b, v[i]) + dis(cur, u[i]) + 1);
	}
	f[i][cur][a][b][c] = ans;
	return ans;
}

int main() {
	memset(f, -1, sizeof(f));
	scanf("%d%d", &n, &k);
	for(int i = 1; i <= n; i ++)
		scanf("%d%d", &u[i], &v[i]);
	printf("%d", dfs(1, 1, 0, 0, 0));
	return 0;
}