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.
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 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.
2 2 AT *O 6 7 AIM*DEN *ME*ONE UPON*TO SO*ERIN *SA*OR* IES*DEA 0
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
背景:提交完第一次看到Output limit exceeded,原来也是超时的意思呀,听说主要是因为输出进入了死循环。
学习:在多case的题目中对于用于标记的数组一定要记得在每个case 开始前使用memset进行初始化。并利用一个标记数组来记录该位置是否为起始格。
最后一组不用有一个空行,所以在每个输出之前打印空行而不是在之后,注意第一个之前不需要打印。
#include<stdio.h> #include<string.h> char s[15][15]; int a[15][15]={0}; int main () { int x,y; int count=0; while (1) { memset(a,0,sizeof(a)); scanf("%d",&x); if(x==0) break; scanf("%d",&y); count++; int i,j; int n=0; for(i=0;i<x;i++) { for(j=0;j<y;j++) { s[i][j]=getchar(); if(s[i][j]=='\n') { j--; continue; } else if(s[i][j]!='*') { if(j-1<0||i-1<0||s[i][j-1]=='*'||s[i-1][j]=='*') a[i][j]=++n; } } } if(count-1) printf("\n"); printf("puzzle #%d:\n",count); printf("Across\n"); for(i=0;i<x;i++) { for(j=0;j<y;j++) { if(a[i][j]!=0) { printf("%3d.",a[i][j]); int k=j; while (1) { if(s[i][k]=='*'||k+1>y) { printf("\n"); break; } else { printf("%c",s[i][k]); } k++; } j=k-1; //使他跳过已经在之前的单词中出现过的起始格 } } } printf("Down\n"); for(i=0;i<x;i++) { for(j=0;j<y;j++) { if(a[i][j]!=0 && a[i][j]!=200) { printf("%3d.",a[i][j]); int m=i; while (1) { if(s[m][j]=='*'||m+1>x) { printf("\n"); break; } else { a[m][j]=200; //感觉此处不能使用类似上面的方法 因为i作为行数直接加会打乱顺序 j就不会影响 printf("%c",s[m][j]); //并且选200作为标记 也是因为起始格肯定不会为200 一开始选3 就出错了 起始格为3的直接被跳过 } m++; } } } } } return 0; }