【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[2][MAXN+2][MAXN+1];
int dir[4][2] = {
    {-1,0}, {1,0}, {0,1}, {0,-1}
};

int isInvalid(int x, int y) {
    return x<0 || x>=MAXN || y<0 || 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 , 0, sizeof(map));
    scanf("%d", &t);
    while (t--) {
        scanf("%d", &n);
        for (i=0; i<MAXM; ++i)
            scanf("%d", &D[i]);
        for (r=0, i=1; i<=MAXN; ++i) {
            for (j=1; j<=MAXN; ++j) {
                scanf("%d", &map[r][i][j]);
            }
        }
        for (p=0; p<n; ++p, r=!r) {
            for (i=1; i<=MAXN; ++i) {
                for (j=1; j<=MAXN; ++j) {
                    sum = map[r][i][j] + map[r][i+1][j] + map[r][i-1][j]+
                            map[r][i][j+1] + map[r][i][j-1];
                    map[!r][i][j] = map[r][i][j] + D[sum];
                    if (map[!r][i][j] > 3)
                        map[!r][i][j] = 3;
                    if (map[!r][i][j] < 0)
                        map[!r][i][j] = 0;
                }
            }
        }
        for (i=1; i<=MAXN; ++i) {
            for (j=1; j<=MAXN; ++j) {
                printf("%c", tb[map[r][i][j]]);
            }
            printf("
");
        }
        if (t)
            printf("
");
    }

    return 0;
}