例题6-13(uva-1103)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>

#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;

int n, m;
char matrix[207][207];
int  color[207][207];

const int dir[4][2] = { {1,0},{-1,0},{0,1},{0,-1} };
const char aTable[] = "WAKJSD";

set<int> nearCnt[1024];

map<char, char> mmp = { {'0',0}, {'1',1},{'2',2},{'3',3},{'4',4},{'5',5},{'6',6},{'7',7},{'8',8},{'9',9},{'a',10},{'b',11},{'c',12},{'d',13},{'e',14},{'f',15} };

//颜色连通的分块
void DivBlock(int x,int y,int id) {
	color[x][y] = id;
	for (int i = 0; i < 4; ++i) {
		int nx = x + dir[i][0];
		int ny = y + dir[i][1];
		if (nx >= 0 && nx < n && ny >= 0 && ny < m && matrix[x][y] == matrix[nx][ny] && 0 == color[nx][ny]) {
			DivBlock(nx, ny, id);
		}
	}
}

//统计空白块数量
void CulNearBlank(int x,int y) {
	for (int i = 0; i < 4; ++i) {
		int nx = x + dir[i][0];
		int ny = y + dir[i][1];
		if (nx >= 0 && nx < n && ny >= 0 && ny < m && 0 == matrix[nx][ny]) {
			nearCnt[color[x][y]].insert(color[nx][ny]);
		}
	}
}

int main()
{
	string out;
	char in;
	int cnt = 0, nStart = 0;
	while (cin >> n >> m && n && m) {

		out = "";
		memset(color, 0, sizeof(color));
		memset(matrix, 0, sizeof(matrix));
		
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				cin >> in;
				//周围多加一圈空白块
				nStart = j * 4+1;
				for (int k = 0; k < 4; ++k) {
					matrix[i+1][nStart + k] = (mmp[in] & (1 << (3 - k))) >> (3 - k);
				}
			}
		}
		//周围多加一圈空白块
		n += 2;
		m = m * 4 + 2;

		int id = 0;
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				if (!color[i][j]) {
					DivBlock(i, j, ++id);
				}
			}
		}

		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				if (matrix[i][j]) {
					CulNearBlank(i, j);
				}
			}
		}
		
		for (int i = 0; i <= id; ++i) {
			//数量 - 各个象形字之间的空白块(=1)
			if (nearCnt[i].size() > 0) out.push_back(aTable[nearCnt[i].size() - 1]);
			nearCnt[i].clear();
		}
		sort(out.begin(), out.end());

		cout << "Case " << ++cnt << ": " << out << endl;
	}
	return 0;
}