纵横字谜的答案 (UVa232)

纵横字谜的答案

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status

Description

Crossword Answers

A crossword puzzle consists of a rectangular grid of black and white squares and two lists of definitions (or descriptions).

One list of definitions is for ``words" to be written left to right across white squares in the rows and the other list is for words to be written down white squares in the columns. (A word is a sequence of alphabetic characters.)

To solve a crossword puzzle, one writes the words corresponding to the definitions on the white squares of the grid.

The definitions correspond to the rectangular grid by means of sequential integers on ``eligible" white squares. White squares with black squares immediately to the left or above them are ``eligible." White squares with no squares either immediately to the left or above are also ``eligible." No other squares are numbered. All of the squares on the first row are numbered.

The numbering starts with 1 and continues consecutively across white squares of the first row, then across the eligible white squares of the second row, then across the eligible white squares of the third row and so on across all of the rest of the rows of the puzzle. The picture below illustrates a rectangular crossword puzzle grid with appropriate numbering.

An ``across" word for a definition is written on a sequence of white squares in a row starting on a numbered square that does not follow another white square in the same row.

The sequence of white squares for that word goes across the row of the numbered square, ending immediately before the next black square in the row or in the rightmost square of the row.

A ``down" word for a definition is written on a sequence of white squares in a column starting on a numbered square that does not follow another white square in the same column.

The sequence of white squares for that word goes down the column of the numbered square, ending immediately before the next black square in the column or in the bottom square of the column.

Every white square in a correctly solved puzzle contains a letter.

You must write a program that takes several solved crossword puzzles as input and outputs the lists of across and down words which constitute the solutions.

Input

Each puzzle solution in the input starts with a line containing two integers r and c (  and  ), where r (the first number) is the number of rows in the puzzle and c (the second number) is the number of columns.

The r rows of input which follow each contain c characters (excluding the end-of-line) which describe the solution. Each of those ccharacters is an alphabetic character which is part of a word or the character ``*", which indicates a black square.

The end of input is indicated by a line consisting of the single number 0.

Output

Output for each puzzle consists of an identifier for the puzzle (puzzle #1:, puzzle #2:, etc.) and the list of across words followed by the list of down words. Words in each list must be output one-per-line in increasing order of the number of their corresponding definitions.

The heading for the list of across words is ``Across". The heading for the list of down words is ``Down".

In the case where the lists are empty (all squares in the grid are black), the Across and Down headings should still appear.

Separate output for successive input puzzles by a blank line.

Sample Input

2 2
AT
*O
6 7
AIM*DEN
*ME*ONE
UPON*TO
SO*ERIN
*SA*OR*
IES*DEA
0

Sample Output

puzzle #1:
Across
  1.AT
  3.O
Down
  1.A
  2.TO

puzzle #2:
Across
  1.AIM
  4.DEN
  7.ME
  8.ONE
  9.UPON
 11.TO
 12.SO
 13.ERIN
 15.SA
 17.OR
 18.IES
 19.DEA
Down
  1.A
  2.IMPOSE
  3.MEO
  4.DO
  5.ENTIRE
  6.NEON
  9.US
 10.NE
 14.ROD
 16.AS
 18.I
 20.A

题意：输入一个r行c列的网格，黑格用*号表示，每个白格都填有一个字母。如果一个白格的左边相邻位置或者上边相邻位置没有白格（可能是黑格，也可能出了网格边界），则称这个白格是一个起始格。首先把所有起始格从左到右，从上到下顺序编号1，2，3，。。。。要求找出所有横向单词。这些单词必须从一个起始格开始，向右延伸到一个黑格的左边或者整个网格的最右边。最后找出所有的竖向单词。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#pragma comment (linker,"/STACK:102400000,102400000")
#define maxn 105
#define MAXN 2005
#define mod 1000000009
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-6
typedef long long ll;
using namespace std;

struct St
{
    int x,y;
    int r,c;
}st[111];

char mp[12][12];
int n,m;

int main()
{
    int cas=0;
    while (scanf("%d",&n),n)
    {
        scanf("%d",&m);
//        if (cas) printf("\n");
        for (int i=0;i<n;i++)
            scanf("%s",mp[i]);
//        for (int i=0;i<n;i++)
//            printf("%s\n",mp[i]);
        int num=1;
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<m;j++)
            {
                if(mp[i][j]!='*')
                {
                    if ((i-1)<0||(j-1)<0||mp[i-1][j]=='*'||mp[i][j-1]=='*')
                    {
                        st[num].x=i;
                        st[num].y=j;
                        if ((j-1)<0||mp[i][j-1]=='*')  st[num].r=1;  else  st[num].r=0;
                        if ((i-1)<0||mp[i-1][j]=='*')  st[num].c=1;  else  st[num].c=0;
                        num++;
                    }
                }
            }
        }
        if (cas)
            printf("\n");
//        printf("num=%d\n",num);
        printf("puzzle #%d:\nAcross\n",++cas);
        for (int i=1;i<num;i++)
        {
            if (st[i].r)
            {
                printf("%3d.",i);
                for (int j=st[i].y;j<m;j++)
                {
                    if (mp[ st[i].x ][j]=='*')
                        break;
                    printf("%c",mp[ st[i].x ][j]);
                }
                printf("\n");
            }
        }
//        printf("num=%d\n",num);
        printf("Down\n");
        for (int i=0;i<num;i++)
        {
            if (st[i].c)
            {
                printf("%3d.",i);
                for (int j=st[i].x;j<n;j++)
                {
                    if (mp[j][ st[i].y ]=='*')
                        break;
                    printf("%c",mp[j][ st[i].y ]);
                }
                printf("\n");
            }
        }
//        printf("\n");
    }
    return 0;
}