【HDOJ】1057 A New Growth Industry

纯粹的模拟题目。

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXN 20
 #define MAXM 16

 char tb[] = ".!X#";
 int D[MAXM];
 int map[][MAXN+][MAXN+];
 int dir[][] = {
     {-,}, {,}, {,}, {,-}
 };

 int isInvalid(int x, int y) {
     return x< || x>=MAXN || y< || y>=MAXN;
 }

 int main() {
     int t, n;
     int i, j, k, p, r;
     int x, y;
     int sum;

 #ifndef ONLINE_JUDGE
     freopen("data.in", "r", stdin);
     freopen("data.out", "w", stdout);
 #endif
     memset(map , , sizeof(map));
     scanf("%d", &t);
     while (t--) {
         scanf("%d", &n);
         for (i=; i<MAXM; ++i)
             scanf("%d", &D[i]);
         for (r=, i=; i<=MAXN; ++i) {
             for (j=; j<=MAXN; ++j) {
                 scanf("%d", &map[r][i][j]);
             }
         }
         for (p=; p<n; ++p, r=!r) {
             for (i=; i<=MAXN; ++i) {
                 for (j=; j<=MAXN; ++j) {
                     sum = map[r][i][j] + map[r][i+][j] + map[r][i-][j]+\
                             map[r][i][j+] + map[r][i][j-];
                     map[!r][i][j] = map[r][i][j] + D[sum];
                     if (map[!r][i][j] > )
                         map[!r][i][j] = ;
                     if (map[!r][i][j] < )
                         map[!r][i][j] = ;
                 }
             }
         }
         for (i=; i<=MAXN; ++i) {
             for (j=; j<=MAXN; ++j) {
                 printf("%c", tb[map[r][i][j]]);
             }
             printf("\n");
         }
         if (t)
             printf("\n");
     }

     return ;
 }