【算法竞赛阅读笔记】 UVA227 谜题 Puzzle

最新推荐文章于 2023-07-09 21:37:58 发布

Tanzq-blog

最新推荐文章于 2023-07-09 21:37:58 发布

阅读量200

点赞数

分类专栏： ACM 文章标签：算法

本文链接：https://blog.csdn.net/qq_46276931/article/details/109378330

版权

ACM 专栏收录该内容

88 篇文章 6 订阅

订阅专栏

题目提交处

UVA227

代码

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

#define _for(i, a, b) for (int i = (a); i < (b); ++i)
const int N = 10;
char g[N][N];
int dx[] = { -1, 0, 1, 0 }, dy[] = { 0, 1, 0, -1 };
int x, y;
bool first = true;

inline bool init() {
	if (!first) getchar();

	_for(i, 0, 5) {
		_for(j, 0, 5) {
			g[i][j] = getchar();
			if (g[i][j] == 'Z') return false;
			if (g[i][j] == ' ') x = i, y = j;
		}

		if (g[i][4] == '\n') {
			g[i][4] = ' ';
			x = i, y = 4;
		}
		else getchar();
	}
	return true;
}

inline bool slove() {
	char op;
	bool flag = true;

	while ((op = getchar()) != '0') {
		int opt;
		if (op == 'A') opt = 0;
		else if (op == 'R') opt = 1;
		else if (op == 'B') opt = 2;
		else if (op == 'L') opt = 3;
		else continue;

		int a = x + dx[opt], b = y + dy[opt];
		if (a >= 0 && a < 5 && b >= 0 && b < 5) {
			swap(g[x][y], g[a][b]);
			x = a, y = b;
		}
		else flag = false;
	}
	return flag;
}

int main() {
	int cnt = 0;

	while (init()) {
		if (first) first = false;
		else puts("");

		printf("Puzzle #%d:\n", ++cnt);
		if (slove()) {
			_for(i, 0, 5) {
				_for(j, 0, 5) printf("%s%c",(j ? " " : ""), g[i][j]);
				puts("");
			}
		}
		else puts("This puzzle has no final configuration.");
	}
	return 0;
}