知识点:连通块的划分
这个题还是有一点麻烦的,写了37分钟,首先我们要把输入的16进制转化为2进制的01,这个方法各有不同,然后就是处理了,首先第一次dfs,我们把图里面不属于字母的空白部分都标记,这里运用了补一圈的思想,只要从边界深搜一次就能把所有的不属于字母的空白给标记了,然后是第二次深搜,给每个01标记上它属于第几个字母,第三次深搜就是遍历字母的空白块,然后累加看看第几个字母有几个空白块,最后通过有几个空白块来确定图像里都是什么字母
#include <bits/stdc++.h>
using namespace std;
const int N = 205;
int h, w, a[N][N], v[N][N], vis[N][N], rec[N * N];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
void dfs(int x, int y) {
v[x][y] = N * N;
for (int i = 0; i < 4; i++) {
int xx = x + dx[i];
int yy = y + dy[i];
if (xx < 0 || xx > h + 1 || yy < 0 || yy > w * 4 + 1) continue;
if (!v[xx][yy] && !a[xx][yy]) dfs(xx, yy);
}
}
void dfs1(int x, int y, int num) {
v[x][y] = num;
for (int i = 0; i < 4; i++) {
int xx = x + dx[i];
int yy = y + dy[i];
if (xx < 1 || xx > h || yy < 1 || yy > w * 4) continue;
if (!v[xx][yy]) dfs1(xx, yy, num);
}
}
void dfs2(int x, int y) {
vis[x][y] = 1;
for (int i = 0; i < 4; i++) {
int xx = x + dx[i];
int yy = y + dy[i];
if (xx < 1 || xx > h || yy < 1 || yy > w * 4) continue;
if (!vis[xx][yy] && !a[xx][yy]) dfs2(xx, yy);
}
}
int main() {
int Case = 1;
while (cin >> h >> w && h) {
memset(a, 0, sizeof(a));
memset(v, 0, sizeof(v));
memset(vis, 0, sizeof(vis));
memset(rec, 0, sizeof(rec));
for (int i = 0; i < h; i++) {
string s;
cin >> s;
for (int j = 0; j < w; j++) {
int num = (isdigit(s[j]) ? s[j] - '0' : s[j] - 'a' + 10);
for (int k = 4; k >= 1; k--) {
a[i + 1][j * 4 + k] = num % 2;
num /= 2;
}
}
}
dfs(0, 0);
int cnt = 0;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w * 4; j++) {
if (!v[i][j]) dfs1(i, j, ++cnt);
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w * 4; j++) {
if (!vis[i][j] && !a[i][j]) {
dfs2(i, j);
rec[v[i][j]]++;
}
}
}
char str[10] = "WAKJSD";
vector<char> ans;
for (int i = 1; i <= cnt; i++) {
ans.push_back(str[rec[i]]);
}
sort(ans.begin(), ans.end());
printf("Case %d: ", Case++);
for (int i = 0; i < cnt; i++) {
cout << ans[i];
}
cout << endl;
}
return 0;
}