纵横字谜的答案 Crossword Answers, ACM/ICPC World Finals 1994, UVa232

3-6

#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <vector>
using namespace std;
int main()
{
	int col, row;
	int puznum = 0;
	while (cin >> row && row != 0)
	{
		int num = 0;
		cin >> col;
		if (puznum != 0)
			cout << endl;
		cout << "puzzle #" << ++puznum << ":" << endl;
		vector<string> solution;
		int** a;//存储各方格数值,0代表为非eligible square的白方块,-1表示黑方块
		a = new int* [row];
		for (int i = 0; i < row; ++i)
		{
			a[i] = new int[col] {0};
		}
		string s;
		for (int i = 0; i < row; ++i)
		{
			cin >> s;
			solution.push_back(s);
		}
		for (int i = 0; i < row; ++i)
		{
			for (int j = 0; j < col; ++j)
			{
				if ((i == 0 || j == 0 || solution[i - 1][j] == '*' || solution[i][j - 1] == '*') && solution[i][j] != '*')
				{
					a[i][j] = ++num;
				}
				else if (solution[i][j] == '*')
				{
					a[i][j] = -1;
				}
				else
				{
					a[i][j] = 0;
				}
			}
		}
		cout << "Across\n";
		for (int i = 0; i < row; ++i)
		{
			for (int j = 0; j < col; ++j)
			{
				if (a[i][j] > 0)
				{
					cout << setw(3) << a[i][j] << '.';
					while (j < col && solution[i][j] != '*')
					{
						cout << solution[i][j++];
					}
					cout << endl;
				}
			}
		}
		cout << "Down\n";
		for (int i = 0; i < row; ++i)
		{
			for (int j = 0; j < col; ++j)
			{
				if (a[i][j] > 0 && (i == 0 || a[i - 1][j] == -1))
				{
					cout << setw(3) << a[i][j] << '.';
					int temp = i;
					while (temp < row && solution[temp][j] != '*')
					{
						cout << solution[temp++][j];
					}
					cout << endl;
				}
			}
		}
		//释放动态数组指向的内存
		for (int i = 0; i < row; ++i)
		{
			delete[] a[i];
		}
		delete[] a;
	}
}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

进击的程序

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值