UVA 1103 Ancient Messages

题目链接：https://vjudge.net/problem/UVA-1103

题目大意

　　给定一张关于古代象形文字的 01 点阵图（输入以十六进制表示），判断图中有哪些象形文字，并按字典序输出。

分析

　　居然是按洞的多少来区别象形文字的，我也是服了，dfs 裸题。

代码如下

#include <bits/stdc++.h>
using namespace std;
 
#define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define Rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define For(i,s,t) for (int i = (int)(s); i <= (int)(t); ++i)
#define rFor(i,t,s) for (int i = (int)(t); i >= (int)(s); --i)
#define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
#define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
 
#define LOWBIT(x) ((x)&(-x))
 
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // 删去 x 中所有 c 
#define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower);
#define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper);
 
#define ms0(a) memset(a,0,sizeof(a))
#define msI(a) memset(a,0x3f,sizeof(a))
#define msM(a) memset(a,-1,sizeof(a))

#define MP make_pair
#define PB push_back
#define ft first
#define sd second
 
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}
 
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}

template<typename T>
ostream &operator<<(ostream &out, vector<T> &v) {
    Rep(i, v.size()) out << v[i] << " 
"[i == v.size() - 1];
    return out;
}
 
template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "
";
    return out;
}

inline int gc(){
    static const int BUF = 1e7;
    static char buf[BUF], *bg = buf + BUF, *ed = bg;
    
    if(bg == ed) fread(bg = buf, 1, BUF, stdin);
    return *bg++;
} 

inline int ri(){
    int x = 0, f = 1, c = gc();
    for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
    for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
    return x*f;
}

template<class T>
inline string toString(T x) {
    ostringstream sout;
    sout << x;
    return sout.str();
}

inline int toInt(string s) {
    int v;
    istringstream sin(s);
    sin >> v;
    return v;
}

//min <= aim <= max
template<typename T>
inline bool BETWEEN(const T aim, const T min, const T max) {
    return min <= aim && aim <= max;
}

typedef unsigned int uI;
typedef long long LL;
typedef unsigned long long uLL;
typedef vector< int > VI;
typedef vector< bool > VB;
typedef vector< char > VC;
typedef vector< double > VD;
typedef vector< string > VS;
typedef vector< LL > VL;
typedef vector< VI > VVI;
typedef vector< VB > VVB;
typedef vector< VS > VVS;
typedef vector< VL > VVL;
typedef vector< VVI > VVVI;
typedef vector< VVL > VVVL;
typedef pair< int, int > PII;
typedef pair< LL, LL > PLL;
typedef pair< int, string > PIS;
typedef pair< string, int > PSI;
typedef pair< string, string > PSS;
typedef pair< double, double > PDD;
typedef vector< PII > VPII;
typedef vector< PLL > VPLL;
typedef vector< VPII > VVPII;
typedef vector< VPLL > VVPLL;
typedef vector< VS > VVS;
typedef map< int, int > MII;
typedef unordered_map< int, int > uMII;
typedef map< LL, LL > MLL;
typedef map< string, int > MSI;
typedef map< int, string > MIS;
typedef multiset< int > mSI;
typedef multiset< char > mSC;
typedef set< int > SI;
typedef stack< int > SKI;
typedef deque< int > DQI;
typedef queue< int > QI;
typedef priority_queue< int > PQIMax;
typedef priority_queue< int, VI, greater< int > > PQIMin;
const double EPS = 1e-8;
const LL inf = 0x7fffffff;
const LL infLL = 0x7fffffffffffffffLL;
const LL mod = 1e9 + 7;
const int maxN = 2e2 + 7;
const LL ONE = 1;
const LL evenBits = 0xaaaaaaaaaaaaaaaa;
const LL oddBits = 0x5555555555555555;

int T, N, M;
int bitArr[maxN][maxN];
mSC ans;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
map< int, char > dict = {PII(1, 'A'), PII(3, 'J'), PII(5, 'D'), PII(4, 'S'), PII(0, 'W'), PII(2, 'K')};

// 把与bitArr[x][y] = 0联通的联通 0 区域全部置为-1 
void dfs1(int x, int y) {
    bitArr[x][y] = -1; 
    
    Rep(i, 4) {
        int newX = x + dx[i];
        int newY = y + dy[i];
        
        if(!BETWEEN(newX, 0, N + 1) || !BETWEEN(newY, 0, M + 1) || bitArr[newX][newY] != 0) continue;
        dfs1(newX, newY);
    }
}

// 把与bitArr[x][y] = 1联通的联通 1 区域全部置为-1,并返回0联通区数量 
int dfs2(int x, int y) {
    int ret = 0;
    bitArr[x][y] = -1; 
    
    Rep(i, 4) {
        int newX = x + dx[i];
        int newY = y + dy[i];
        
        if(!BETWEEN(newX, 0, N + 1) || !BETWEEN(newY, 0, M + 1)) continue;
        if(bitArr[newX][newY] == 1) {
            ret += dfs2(newX, newY);
        }
        else if(bitArr[newX][newY] == 0) {
            dfs1(newX, newY);
            ++ret; 
        }
    }
    return ret;
}

void print() {
    For(i, 1, N) {
        For(j, 1, M) {
            if(bitArr[i][j] != -1) cout << bitArr[i][j];
            else cout << " ";
        }
        cout << endl;
    }
}

int main() {
    //freopen("MyOutput.txt","w",stdout);
    //freopen("input.txt","r",stdin);
    //INIT();
    while(cin >> N >> M && N) {
        ms0(bitArr);
        ans.clear();
        For(i, 1, N) {
            Rep(j, M) {
                int x;
                scanf("%1x", &x);
                
                For(k, 1, 4) {
                    bitArr[i][(j << 2) + (5 - k)] = ((x & (1 << (k - 1))) != 0);
                }
            } 
        }
        M <<= 2;
        
        dfs1(0, 0);
        
        For(i, 1, N) {
            For(j, 1, M) {
                if(bitArr[i][j] < 0) continue;
                int ret = dfs2(i, j);
                ans.insert(dict[ret]);
            }
        }
        
        printf("Case %d: ", ++T);
        for(auto x : ans) cout << x;
        printf("
");
    }
    return 0;
}