1968.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1968 on 2006-03-02 at 19:56:15 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const char *KIND = "RSP";
const int MAX = 128;
const int DIR[][2] = { { -1, 0 }, { 1, 0 }, { 0, 1 }, { 0, -1 } };

inline int code(char);

int main()
{
	char kingdom[MAX][MAX];
	int t, T, i, j, k, d;
	int h, w, day;
	
	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		scanf("%d %d %d\n", &h, &w, &day);
		for(i = 0; i < h; i++) gets(kingdom[i]);
		bool change = true;
		for(d = 0; d < day && change; d++) {
			char next[MAX][MAX]; change = false;
			memcpy(next, kingdom, sizeof(kingdom));
			for(i = 0; i < h; i++)
				for(j = 0; j < w; j++)
					for(k = 0; k < 4; k++) {
						int x = i+DIR[k][0], y = j+DIR[k][1];
						if(x < 0 || x >= h || y < 0 || y >= w) continue;
						int oa = code(kingdom[i][j]), ob = code(kingdom[x][y]);
						if(oa == (ob+1)%3) { next[i][j] = kingdom[x][y]; change = true; break; }
					}
			memcpy(kingdom, next, sizeof(next));
		}
		if(t != 0) putchar('\n');
		for(i = 0; i < h; i++) puts(kingdom[i]);
	}
	
	return 0;
}

inline int code(char form)
{
	int o;
	for(o = 0; form != KIND[o]; o++) ;
	return o;
}