Uva-232 - Crossword Answers

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 c characters 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 2AT*O6 7AIM*DEN*ME*ONEUPON*TOSO*ERIN*SA*OR*IES*DEA0

Sample Output

puzzle #1:Across  1.AT  3.ODown  1.A  2.TOpuzzle #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.DEADown  1.A  2.IMPOSE  3.MEO  4.DO  5.ENTIRE  6.NEON  9.US 10.NE 14.ROD 16.AS 18.I
 20.A
题意有点绕，从左到右自上而下挨个字母扫描，如果这个字母左面是*或者是边界那么就以此为起点往右走，直到到达*或者边界，这样作为一个单词存入across，同理这个字母也可以作为竖着的一个单词，要求相同，需要注意的是如果这个字母既是across的单词又是down的单词，那么这两个单词的序号应该相同。下面提供C和C++代码。--[Az]
#include <stdio.h>#include <stdlib.h>#include <string.h>char box[15][15],across[100][100],down[100][100];int hang,lie,puzz = 1;int getacross(int lie,int i,int j,int jsq,char box[15][15],char across[100][100]){    int n = 0;    if(box[i][j] == '*')        return 0;    if(j == 0||box[i][j-1] == '*')    {        for(n = 0;; j++,n++)        {            if(box[i][j] != '*'&&j < lie)                across[jsq][n] = box[i][j];            else                break;        }        return 1;    }    else        return 0;}int getdown(int hang,int i,int j,int jsq,char box[15][15],char down[100][100]){    int n;    if(box[i][j] == '*')        return 0;    if(i == 0 || box[i-1][j] == '*')    {        for(n = 0;; i++,n++)        {            if(i < hang && box[i][j] != '*')                down[jsq][n] = box[i][j];            else                break;        }        return 1;    }    else        return 0;}int main(){    while(scanf("%d",&hang) != EOF)    {        if(hang == 0)            break;        scanf("%d",&lie);        getchar();        int czh = -1,czl = -1;        int i,j,jsq = 1;        //printf("i = %d,j  = %d\n",hang,lie);        memset(box,0,sizeof(box));        for(i = 0; i < hang; i++)        {            for(j = 0; j < lie; j++)            {                box[i][j] = getchar();                //printf("box[%d][%d] = %c\n",i,j,box[i][j]);            }            getchar();        }//        for(i = 0; i < hang; i++)//        {//            for(j = 0; j < lie; j++)//            {//                printf("%c",box[i][j]);//            }//            printf("\n");//        }        memset(across,0,sizeof(across));        memset(down,0,sizeof(down));        for(i = 0; i < hang; i++)        {            for(j = 0; j < lie; j++)            {                czh = getacross(lie,i,j,jsq,box,across);                czl = getdown(hang,i,j,jsq,box,down);                if(czh == 1 || czl == 1)                    jsq++;            }        }        if(puzz != 1)            printf("\n");        printf("puzzle #%d:\n",puzz++);        printf("Across\n");        for(i = 0; i <= jsq; i++)        {            if(across[i][0] != 0)                printf("%3d.",i);            else                continue;            for(j = 0;; j++)            {                if(across[i][j] != 0)                    printf("%c",across[i][j]);                else                    break;            }            printf("\n");        }        printf("Down\n");        for(i = 0; i <= jsq; i++)        {            if(down[i][0] != 0)                printf("%3d.",i);            else                continue;            for(j = 0;; j++)            {                if(down[i][j] != 0)                    printf("%c",down[i][j]);                else                    break;            }            printf("\n");        }    }    return 0;}



#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>#include <cctype>#include <string>#include <algorithm>#include <numeric>using namespace std;bool cmp(pair<int, string> a, pair<int, string> b)  {    return a.first < b.first;}int main() {    char Map[15][15];    int Mapf[15][15];    int x, y, cnt = 0;    while(cin >> x) {        if(x) cin >> y;        else break;        for(int i = 0; i < 15; i++) {            for(int j = 0; j < 15; j++) {                Map[i][j] = '*';            }        }        memset(Mapf, 0, sizeof(Mapf));        pair<int, string> p[1001];        int cur = 0;        for(int i = 1; i <= x; i++) {            for(int j = 1; j <= y; j++) {                cin >> Map[i][j];                if(Map[i][j] == '*') {                    Mapf[i][j] = -1;                } else {                    if(i - 1 < 1 || j - 1 < 1 || Map[i - 1][j] == '*' || Map[i][j - 1] == '*') Mapf[i][j] = ++cur;                    else Mapf[i][j] = -1;                }            }        }        /*for(int i = 1; i <= x; i++) {            for(int j = 1; j <= y; j++) {                cout << Mapf[i][j] << " ";            }            cout << endl;        }*/        if(cnt) cout << endl;        int last = 0;        printf("puzzle #%d:\n", ++cnt);        cout << "Across" << endl;        for(int i = 1; i < 15; i++) {            string str = "";            for(int j = 1; j < 15; j++) {                if(Map[i][j] != '*') {                    if(str == "") last = Mapf[i][j];                    str += Map[i][j];                } else {                    if(str != "") {//cout << "  " << last << "." << str << endl;                        printf("%3d.", last);                        cout << str << endl;                    }                    str = "";                }            }        }        cout << "Down" << endl;        int pcu = 0;        for(int j = 1; j < 15; j++) {            string str = "";            for(int i = 1; i < 15; i++) {                if(Map[i][j] != '*') {                    if(str == "") last = Mapf[i][j];                    str += Map[i][j];                } else {                    if(str != "") {                        p[pcu].first = last;                        p[pcu++].second = str;                    //cout << "  " << last << "." << str << endl;                        str = "";                    }                }            }        }        sort(p, p + pcu, cmp);        for(int i = 0; i < pcu; i++) {            printf("%3d.", p[i].first);            cout << p[i].second<<endl;        }    }    return 0;}