Tunnels HDU - 4856

题意：给你一张n*n的图，其中"."为可走，”#"为不可走，再给你m条通道的入口和出口（代表单向），通道直接穿过不需要时间，点可到相邻的点，话费1个单位时间，问你以任意个通道入口为起点，走完所有通道而且每个通道只走一次，最少需要多少时间。
分析: 这题相当于裸的旅行商问题，只需要bfs预处理每个通道的出口到其他通道的入口的最短距离，然后状压dp搞定。

#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
using namespace std;
const int N = 100007;
const int INF = 0x3f3f3f3f;
char g[33][33];
int n; 
int m;  
struct Node {
	int x, y;
}; 
struct NOde {
	Node st, en;
} node[N];  
int dis[20][20]; 
int tmp[20][20]; 
int dx[] = {0, 1, 0, -1}; 
int dy[] = {1, 0, -1, 0};
void bfs(int s) { 
	queue<Node> q;
	q.push(Node{node[s].en.x, node[s].en.y});
	memset(tmp, -1, sizeof(tmp));
	tmp[node[s].en.x][node[s].en.y] = 0; 
	while (!q.empty()) {
		Node now = q.front(); q.pop();
		for (int i = 0; i < 4; ++i) {
			int xx = now.x + dx[i];
			int yy = now.y + dy[i];
			if (xx < 1 || xx > n || yy < 1 || yy > n || g[xx][yy] == '#' || tmp[xx][yy] != -1) {
				continue;
			}
			tmp[xx][yy] = tmp[now.x][now.y] + 1;
			q.push(Node{xx, yy}); 
		}
	} 
}
int in[33];
int ans = INF;
int dp[1<<15][16]; 
int main() {
	while (~scanf ("%d %d", &n, &m)) {
		for (int i = 1; i <= n; ++i) {
			scanf ("%s", g[i]+1);
		}
		for (int i = 0; i < m; ++i) {
			scanf ("%d %d %d %d", &node[i].st.x, &node[i].st.y, &node[i].en.x, &node[i].en.y);
		}
		memset(dis, 0x3f, sizeof(dis));
		for (int i = 0; i < m; ++i) { 
			bfs(i);
			for (int j = 0; j < m; ++j) {
				if (i == j) {
					dis[i][j] = 0; 
					continue;
				}
				dis[i][j] = tmp[node[j].st.x][node[j].st.y]; 
				if (dis[i][j] == -1) dis[i][j] = INF; 
			}
		} 
	 
		memset(dp, 0x3f, sizeof(dp));
		for (int i = 0; i < m; ++i) dp[1<<i][i] = 0; 
		for (int i = 1, M = 1<<m; i < M; ++i) { 
			for (int j = 0; j < m; ++j) {
				if (!(i&(1<<j))) { 
					for (int k = 0; k < m; ++k) {
						if (i&(1<<k)) {
							dp[i|(1<<j)][j] = min(dp[i|(1<<j)][j], dp[i][k] + dis[k][j]);
						
						}
					}
				}
			}
		}
		ans = INF; 
		for (int i = 0; i < m; ++i) {
			ans = min(ans, dp[(1<<m)-1][i]);
		}
		if (ans == INF) {
			puts("-1");
		}  else {
			printf ("%d\n", ans);
		}
	}
	
	return 0;
}