Uva 232 纵横字谜

题目详情
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 areeligible." 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 isDown".

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
AIMDEN
MEONE
UPONTO
SOERIN
SAOR*
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

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
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);
        for (int i=0;i<n;i++)
            scanf("%s",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;//左边为左边界||“*”的r为1
                        if ((i-1)<0||mp[i-1][j]=='*')  st[num].c=1;  else  st[num].c=0;//上边为上边界||“*”的c为1
                        num++;
                    }
                }
            }
        }
        if (cas)//这一步是题目要求，从第二组数据开始多输出一行空格
            printf("\n");
        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("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");
            }
        }
    }

这一题本来我咋修改我的手写代码也不对，在uDebug上测试后发现原来是把一个“.”打成“：”！这一题我的想法是先用数字数组替换字符数组，便于判断，然后第二部分纵列时用结构体存放并排序，感觉思路也没问题，尽管有些复杂。。。。。大家可以看一下！

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct Stu{
	int num;
	char fuhao='.';
	string mun;
};	
bool cmp(Stu a,Stu b)
{
	return a.num<b.num;
}
int main()
{
	struct Stu number[10001];
	char s[15][15];
	int w=0,a,b;	
	while(scanf("%d",&a)&&a)
	{		 
	    int f[15][15]={0};
		cin>>b;
		int x=0;
		for(int i=0;i<a;i++)
		{
		for(int j=0;j<b;j++)
		{
			cin>>s[i][j];	
			if(s[i][j]=='*') f[i][j]=-1;		
		  else if(i==0||j==0) f[i][j]=++x;
		  else if(s[i][j]!='*'&&(s[i-1][j]=='*'||s[i][j-1]=='*')) f[i][j]=++x;			 
		}
		}
	if(w) printf("\n");
	printf("puzzle #%d:\nAcross\n",++w);
	for(int i=0;i<a;i++)
	{	
	for(int j=0;j<b;j++)
	{   
	    string c;	   
		if(f[i][j]>0)
		{
		   printf("%3d:",f[i][j]);
			int k;
			for(k=j;k<b;k++)
			{
				if(f[i][k]==-1) break;
				c+=s[i][k];
			}
			j=k;
			cout<<c<<endl;
			c="";
		}					
    }
    }
	printf("Down\n");
	int l=0;
	for(int i=0;i<b;i++)
	{	
	for(int j=0;j<a;j++)
	{   
	    string c;	   
		if(f[j][i]>0)
		{
		   number[l].num=f[j][i];
		    
			int k;
			for(k=j;k<a;k++)
			{
				if(f[k][i]==-1) break;
				c+=s[k][i];
			}
			j=k;
			number[l].mun=c;
			l++;	
		}					
    }
    }
    sort(number,number+l,cmp);
	for(int i=0;i<l;i++)
	{
	printf("%3d.",number[i].num);
	cout<<number[i].mun<<endl;
	}		 
	}
	return 0;	
}

第三种暴力求解法，第二天早上突然想明白了，真傻！

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
	char s[15][15];
	int w=0,a,b;	
	while(scanf("%d",&a)&&a)
	{		 
	    int f[15][15]={0};
		cin>>b;
		int x=0;
		for(int i=0;i<a;i++)
		{
		for(int j=0;j<b;j++)
		{
			cin>>s[i][j];	
			if(s[i][j]=='*') f[i][j]=-1;		
		  else if(i==0||j==0) f[i][j]=++x;
		  else if(s[i][j]!='*'&&(s[i-1][j]=='*'||s[i][j-1]=='*')) f[i][j]=++x;			 
		}
		}
	if(w) printf("\n");
	printf("puzzle #%d:\nAcross\n",++w);
	for(int i=0;i<a;i++)
	{	
	for(int j=0;j<b;j++)
	{   
	    string c;	   
		if(f[i][j]>0)
		{
		   printf("%3d.",f[i][j]);
			int k;
			for(k=j;k<b;k++)
			{
				if(f[i][k]==-1) break;
				c+=s[i][k];
			}
			j=k;
			cout<<c<<endl;
			c="";
		}					
    }
    }
	printf("Down\n");
	for(int i=0;i<a;i++)	
	for(int j=0;j<b;j++)
	{   
	    if(f[i][j]>0)
		{
			if(i>0&&s[i-1][j]!='*') continue;
			printf("%3d.",f[i][j]);
			int x1=i,y1=j;			
			while(true)
			{
				cout<<s[x1][y1];
				x1++;
				if(x1>=a||s[x1][y1]=='*')
				{
					cout<<endl;
					break;
				}				
			}				
		}					
    }		 
	}
	return 0;	
}