ZOJ 3804--解题报告

#include <cstdio>

#include <vector>

#include <algorithm>

struct move_t {
	int t;
	int x;
	int y;	
	move_t(int t = 0, int x = 0, int y = 0)
		: t(t), x(x), y(y) {
	}
};

struct compare_func_t {
	bool operator() (const move_t &lhs, const move_t &rhs) const {
		return lhs.t < rhs.t;		
	}
};

// *) 用于统计周边字符为 ch 的个数
inline int sensor(char cmap[64][64], int n, int m, int y, int x, char ch) {
	
	// *) 遍历八角的范围
	static int DIRECIONS[8][2] = {
		{1, 0}, {-1, 0}, {0, 1}, {0, -1}, 
		{1, 1}, {-1, 1}, {1, -1}, {-1, -1} 
	};

	int result = 0;
	for ( int i = 0; i < 8; i++ ) {
		int dx = x + DIRECIONS[i][0];
		int dy = y + DIRECIONS[i][1];
		if ( dx >= 0 && dx < m && dy >= 0 && dy < n ) {
			if ( cmap[dy][dx] == ch ) {
				result ++;
			}	
		}  		
	} 	
	return result;

}


int main()
{
	
	int kase;
	int n, m, f, k;
	char data[2][64][64];

	scanf("%d", &kase);
	while (  kase-- > 0 ) {
		scanf("%d%d%d%d", &n, &m, &f, &k);
		int before = 0, after = 1;
		for ( int i = 0; i < n; i++ ) {
			scanf("%s", data[before][i]);	
		}				
		
		int forward = 0;
		std::vector<move_t> moves;
		int t, x, y;			
		for ( int i = 0; i < k; i++ ) {
			scanf("%d%d%d", &t, &y, &x);
			moves.push_back(move_t(t, x, y));	
		}		
		std::sort(moves.begin(), moves.end(), compare_func_t());	
		
		for ( int i = 0; i < f; i++ ) {
			
			// *) 一轮迭代, 进行状态变化
			for ( int s = 0; s < n; s++ ) {
				for ( int k = 0; k < m; k++ ) {
					data[after][s][k] = data[before][s][k];
					if ( data[before][s][k] == ‘0‘ ) {
						int val = sensor(data[before], n, m, s, k, ‘1‘);
						if ( val == 3 ) {
							data[after][s][k] = ‘1‘;	
						}
					} else if ( data[before][s][k] == ‘1‘ ) {
						int val = sensor(data[before], n, m, s, k, ‘1‘);
						if ( val < 2 || val > 3  ) {
							data[after][s][k] = ‘0‘;
						}
					}
				}
			}				
			
			// *) 有人离开游戏	
			while ( forward < moves.size() ) {
				const move_t &mv = moves[forward];
				if ( mv.t <= i + 1 ) {
					data[after][mv.y - 1][mv.x - 1] = ‘X‘;
					forward++;	
				} else {
					break;
				}	
			}	

			// *) 滚动数组进行切换				
			before ^= after ^= before ^= after;
	
		}	

		// *) 输出结果
		for ( int i = 0; i < n; i++ ) {
			data[before][i][m] = ‘\0‘;
			printf("%s\n", data[before][i]);
		}
	
	}	
	return 0;
}