poj3026

prim。

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int inf = 1e9;
int N;
int x, y;
string a[55];
int b[55][55];
int cnt;
struct Node
{
    int x, y, step;

    Node(){}

    Node(int x, int y, int step)
    {
        this->x = x;
        this->y = y;
        this->step = step;
    }
}u[205];
int c[55][55];
int e[205][205];
bool vis[55][55];
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int d[205];
bool vis2[205];
void bfs(int num)
{
    memset(vis, false, sizeof(vis));
    queue<Node> q;
    q.push(u[num]);
    vis[u[num].x][u[num].y] = true;
    Node v;
    int nxt_x, nxt_y;
    while(q.size())
    {
        v = q.front();
        q.pop();
        for(int i = 0; i < 4; i ++)
        {
            nxt_x = v.x + dx[i];
            nxt_y = v.y + dy[i];
            if(nxt_x < 0 || nxt_x >= y || nxt_y < 0 || nxt_y >= x || b[nxt_x][nxt_y] || vis[nxt_x][nxt_y])
                continue;
            q.push(Node(nxt_x, nxt_y, v.step + 1));
            vis[nxt_x][nxt_y] = 1;
            if(c[nxt_x][nxt_y] != -1)
                e[num][c[nxt_x][nxt_y]] = v.step + 1;
        }
    }
}

int prim()
{
    memset(vis2, false, sizeof(vis2));
    int res = 0;
    for(int i = 0; i < cnt; i ++)
        d[i] = e[0][i];
    vis2[0] = true;
    int tmp, tmp2;
    for(int i = 0; i < cnt - 1; i ++)
    {
        tmp = inf;
        for(int j = 0; j < cnt; j ++)
            if(!vis2[j] && tmp > d[j])
            {
                tmp = d[j];
                tmp2 = j;
            }
        vis2[tmp2] = true;
        res += tmp;
        for(int j = 0; j < cnt; j ++)
            if(d[j] > e[tmp2][j])
                d[j] = e[tmp2][j];
    }
    return res;
}

int main()
{
    cin >> N;
    while(N --)
    {
        memset(b, 0, sizeof(b));
        cnt = 0;
        fill(c[0], c[0] + 55 * 55, -1);
        memset(e, 0, sizeof(e));
        cin >> x >> y;
        char tmp = ' ';
        while(tmp != '\n')
            tmp = getchar();
        for(int i = 0; i < y; i ++)
            getline(cin, a[i]);
        for(int i = 0; i < y; i ++)
            for(int j = 0; j < x; j ++)
                if(a[i][j] == '#')
                    b[i][j] = 1;
                else if(a[i][j] == 'S' || a[i][j] == 'A')
                {
                    u[cnt] = Node(i, j, 0);
                    c[i][j] = cnt;
                    cnt ++;
                }
        for(int i = 0; i < cnt; i ++)
            bfs(i);
        cout << prim() << endl;
    }
    // system("pause");
    return 0;
}