状压dp/bfs建图(HDU 4856 Tunnels)

题目链接
不难的一道题。就是把状压dp和bfs结合一下。。。先每个隧道的终点搜一遍全图存入eg。然后状压dp模板。
下面是ac代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#define ll long long
using namespace std;
const int inf = 0x3f3f3f3f;
const int dir[2][4] = {{1,0,-1,0},{0,1,0,-1}};
int eg[20][20][20];
int dp[1<<16][20];
char mp[20][20];
int n, m;
map<pair<int, int>, int> ind;
queue<pair<int, int> > q;
struct Node
{
    int sx, sy, ex, ey;
}su[20];
void init()
{
    memset(eg, inf, sizeof(eg));
    memset(dp, inf, sizeof(dp));
}
void bfs(int st)
{
    int _x = su[st].ex;
    int _y = su[st].ey;
    eg[st][_x][_y] = 0;
    q.push(make_pair(_x, _y));
    while(q.size())
    {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        for (int i = 0; i < 4; i++)
        {
            int _x = x + dir[0][i];
            int _y = y + dir[1][i];
            if (_x <= 0 || _x > n || _y <= 0 || _y > n) continue;
            if (eg[st][_x][_y] <= eg[st][x][y] + 1 || mp[_x][_y]=='#') continue;
            eg[st][_x][_y] = eg[st][x][y] + 1;
            q.push(make_pair(_x, _y));
        }
    }
}
int main()
{

    while(scanf("%d%d", &n, &m) != EOF)
    {
        init();
        for (int i = 1; i <= n; i++)
            scanf("%s", mp[i] + 1);
        for (int i = 0; i < m; i++)
        {
            scanf("%d%d%d%d", &su[i].sx, &su[i].sy, &su[i].ex, &su[i].ey);
            bfs(i);

        }
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < m; j++)
            {
                if (i == j) continue;
                ind[make_pair(i, j)] = eg[i][su[j].sx][su[j].sy];
            }
        }
        int mx = (1<<m)-1;
        int ans = inf;
        for (int i = 0; i < m; i++)
            dp[(1<<i)][i] = 0;
        for (int sta = 0; sta <= mx; sta++)
        {
            for (int i = 0; i < m; i++)
            {
                for (int k = 0; k < m; k++)
                {
                    if (i==k) continue;
                    if (sta&(1<<i)) continue;
                    if (!(sta&(1<<k))) continue;
                    if (dp[sta][k] == inf) continue;
                    dp[sta|(1<<i)][i] = min(dp[sta|(1<<i)][i], dp[sta][k] + ind[make_pair(k, i)]);
                }

            }
        }
        for (int i = 0; i < m; i++)
            ans = min(ans, dp[mx][i]);
        if (ans == inf) puts("-1");
        else printf("%d\n", ans);
    }
}