UVa-1103 Ancient Messages

#include <bits/stdc++.h>

using namespace std;

const int maxn = 200;
char g[maxn+3][maxn+3];
int idx[maxn][maxn];
int m,n;
string result;

string hex2bin(char c)
{
    int index;
    if(c<='9')
        index = c-'0';
    else if(c=='a')
        index = 10;
    else if(c=='b')
        index = 11;
    else if(c=='c')
        index = 12;
    else if(c=='d')
        index = 13;
    else if(c=='e')
        index = 14;
    else
        index = 15;

    vector<string> List
    {
        "0000","0001","0010","0011",
        "0100","0101","0110","0111",
        "1000","1001","1010","1011",
        "1100","1101","1110","1111"
    };
    return List[index];
}

void makeGraph(char c,int x,int y)
{
    string contain = hex2bin(c);
    y *= 4;
    for(int i = 0; i< 4; i ++)
    {
        g[x][y+i] = contain[i];
    }
}

void dfs3(int r,int c)
{
    if(r<0 || r>=m || c<0 || c>= 4*n) return ;//出界
    if(idx[r][c]>0 || g[r][c]!='0')    return ;
    g[r][c] = -1;
    idx[r][c] = 1;

    for(int dr = -1; dr <= 1; dr ++)
        for(int dc = -1; dc <= 1; dc ++)
            if(dr != 0 || dc != 0)
                dfs3(r+dr,c+dc);
}

void dfs1()
{
    for(int i = 1; i <= m-2; i ++)
    {
        dfs3(i,0);
        dfs3(i,4*n-1);
    }
    for(int i = 0; i <= 4*n-1; i ++)
    {
        dfs3(0,i);
        dfs3(m-1,i);
    }
}

void dfs2(int r,int c,int &cnt)
{
    if(r<0 || r>=m || c<0 || c>= 4*n) return ;//出界
    if(idx[r][c]>0 || g[r][c]!='1')    return ;
    g[r][c] = -1;
    idx[r][c] = 1;

    for(int dr = -1; dr <= 1; dr ++)
        for(int dc = -1; dc <= 1; dc ++)
            if(dr != 0 || dc != 0)
            {
                if(g[r+dr][c+dc]=='0')
                {
                    cnt ++;
                    dfs3(r+dr,c+dc);
                }
                dfs2(r+dr,c+dc,cnt);
            }
}

int kase = 0;

int main()
{
    while(cin >> m >> n)
    {
        if(m==0&&n==0)
            break;
        char tmpInput;
        memset(idx,0,sizeof(idx));
        result.clear();

        for(int i = 0; i < m; i ++)
        {
            for(int j = 0; j < n; j ++)
            {
                cin >> tmpInput;
                makeGraph(tmpInput,i,j);
            }
        }

        dfs1();

        for(int i = 0; i < m; i ++)
        {
            for(int j = 0; j < 4*n; j ++)
            {
                if(g[i][j]=='1')
                {
                    int cnt = 0;
                    dfs2(i,j,cnt);
                    if(cnt == 0)    result += 'W';
                    else if(cnt==1) result += 'A';
                    else if(cnt==2)    result += 'K';
                    else if(cnt==3)    result += 'J';
                    else if(cnt==4)    result += 'S';
                    else if(cnt==5)    result += 'D';
                }
            }
        }
        sort(result.begin(),result.end());
        cout << "Case " << (++kase) << ": ";
        cout << result << endl;
    }
    return 0;
}