【HDOJ】1987 Decoding

简单搜索。

 /* hdoj 1987 */
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <algorithm>
 using namespace std;

 char s[];
 char map[][];
 bool visit[][];
 int n, m, len;
 int dir[][] = {
     ,, ,, ,-, -,
 }; // right down left up

 bool check(int x, int y) {
     return x< || x>=n || y< || y>=m;
 }

 void solve() {
     int i, j, k, tmp;
     int d = ;
     int t = n*m/;
     int x, y, xx, yy;

     len = ;
     memset(visit, false, sizeof(visit));

     x = , y = -;
     while (t--) {
         k = ;
         tmp = ;
         while (k) {
             xx = x + dir[d][];
             yy = y + dir[d][];
             if (check(xx, yy) || visit[xx][yy]) {
                 d = (d+) & ;
                 continue;
             }
             visit[xx][yy] = true;
             tmp = (tmp<<) + map[xx][yy]-'';
             --k;
             x = xx;
             y = yy;
         }
         if (tmp == )
             s[len++] = ' ';
         else
             s[len++] = tmp + 'A' - ;
     }
 }

 int main() {
     int t, tt;
     int i, j, k;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
     #endif

     scanf("%d", &t);
     for (tt=; tt<=t; ++tt) {
         scanf("%d %d %s", &n, &m, s);
         k = ;
         for (i=; i<n; ++i)
             for (j=; j<m; ++j)
                 map[i][j] = s[k++];
         solve();
         i = len - ;
         while (s[i] == ' ')
             --i;
         s[i+] = '\0';
         i = ;
         while (s[i] == ' ')
             ++i;
         printf("%d %s\n", tt, s+i);
     }

     return ;
 }