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 ( tex2html_wrap_inline39 and tex2html_wrap_inline41 ), 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
这个问题，注意前面的号码就好了。
附上AC代码：
 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<ctype.h>
 4 
 5 struct As
 6 {
 7     int x,y;
 8     int Num;
 9 }A[400];
10 struct Dn
11 {
12     int x,y;
13     int Num;
14 }D[400];
15 int a,b;
16 char str[20][20];
17 int t1[20][20];
18 int t2[20][20];
19 int k;
20 int i1,i2;
21 int Flag;
22 int main()
23 {
24     Flag=1;
25     while(scanf("%d",&a)!=EOF&&a)
26     {
27         scanf("%d",&b);
28         for(int i=0;i<20;i++)
29             for(int j=0;j<20;j++)
30         {
31             t1[i][j]=0;
32             t2[i][j]=0;
33         }
34         for(int i=0;i<a;i++)
35             scanf("%s",str[i]);
36         for(int i=0;i<a;i++)
37             for(int j=0;j<b;j++)
38             {
39                 if(isalpha(str[i][j]))
40                 {
41                     if(i==0||j==0)
42                         t1[i][j]=1;
43                     else if(str[i-1][j]=='*'||str[i][j-1]=='*')
44                         t1[i][j]=1;
45                 }
46             }
47         k=0;
48         i1=i2=0;
49         for(int i=0;i<a;i++)
50             for(int j=0;j<b;j++)
51             {
52                 if(t1[i][j])
53                 {
54                     k++;
55                     t2[i][j]=k;
56                     if(i==0||str[i-1][j]=='*')
57                     {
58                         D[i1].Num=k;
59                         D[i1].x=i;
60                         D[i1++].y=j;
61                     }
62                     if(j==0||str[i][j-1]=='*')
63                     {
64                         A[i2].Num=k;
65                         A[i2].x=i;
66                         A[i2++].y=j;
67                     }
68                 }
69             }
70         if(Flag!=1) printf("\n");
71         printf("puzzle #%d:\n",Flag++);
72         printf("Across\n");
73         for(int i=0;i<i2;i++)
74         {
75             printf("%3d.",A[i].Num);
76             for(int j=0;;j++)
77             {
78                 printf("%c",str[A[i].x][A[i].y+j]);
79                 if((A[i].y+j)==b-1) break;
80                 if(str[A[i].x][A[i].y+j+1]=='*') break;
81             }
82             printf("\n");
83         }
84         printf("Down\n");
85         for(int i=0;i<i1;i++)
86         {
87             printf("%3d.",D[i].Num);
88             for(int j=0;;j++)
89             {
90                 printf("%c",str[D[i].x+j][D[i].y]);
91                 if((D[i].x+j)==a-1) break;
92                 if(str[D[i].x+j+1][D[i].y]=='*') break;
93             }
94             printf("\n");
95         }
96     }
97     return 0;
98 }
View Code

 修改之后的代码：

速度快了一点，代码长了一点，谢谢 garbageMan

  1 #include<stdio.h>
  2 #include<string.h>
  3 #include<ctype.h>
  4 
  5 struct As
  6 {
  7     int x,y;
  8     int Num;
  9 } A[400];
 10 struct Dn
 11 {
 12     int x,y;
 13     int Num;
 14 } D[400];
 15 int Sum1,Sum2;
 16 char str[20][20];
 17 int t1[20][20];
 18 int t2[20][20];
 19 void Initializer();
 20 void Input(int a);
 21 void SearchHead(int ,int );
 22 void OrderHead(int ,int );
 23 void SortAorD(int ,int );
 24 void Output(int ,int ,int );
 25 int main()
 26 {
 27     int Flag=1;
 28     int a,b;
 29     while(scanf("%d",&a)!=EOF&&a)
 30     {
 31         Sum1=Sum2=0;
 32         scanf("%d",&b);
 33         Initializer();
 34         Input(a);
 35         SearchHead(a,b);
 36         OrderHead(a,b);
 37         SortAorD(a,b);
 38         Output(Flag,a,b);
 39         Flag++;
 40     }
 41     return 0;
 42 }
 43 void Initializer()
 44 {
 45     for(int i=0; i<20; i++)
 46         for(int j=0; j<20; j++)
 47         {
 48             t1[i][j]=0;
 49             t2[i][j]=0;
 50         }
 51 }
 52 
 53 void Input(int a)
 54 {
 55     for(int i=0; i<a; i++)
 56         scanf("%s",str[i]);
 57 }
 58 void SearchHead(int a,int b)
 59 {
 60     for(int i=0; i<a; i++)
 61         for(int j=0; j<b; j++)
 62         {
 63             if(isalpha(str[i][j]))
 64             {
 65                 if(i==0||j==0)
 66                     t1[i][j]=1;
 67                 else if(str[i-1][j]=='*'||str[i][j-1]=='*')
 68                     t1[i][j]=1;
 69             }
 70         }
 71 }
 72 void OrderHead(int a,int b)
 73 {
 74     for(int i=0; i<a; i++)
 75         for(int j=0; j<b; j++)
 76         {
 77             if(isalpha(str[i][j]))
 78             {
 79                 if(i==0||j==0)
 80                     t1[i][j]=1;
 81                 else if(str[i-1][j]=='*'||str[i][j-1]=='*')
 82                     t1[i][j]=1;
 83             }
 84         }
 85 }
 86 void SortAorD(int a,int b)
 87 {
 88     int k=0;
 89     for(int i=0; i<a; i++)
 90         for(int j=0; j<b; j++)
 91         {
 92             if(t1[i][j])
 93             {
 94                 k++;
 95                 t2[i][j]=k;
 96                 if(i==0||str[i-1][j]=='*')
 97                 {
 98                     D[Sum1].Num=k;
 99                     D[Sum1].x=i;
100                     D[Sum1++].y=j;
101                 }
102                 if(j==0||str[i][j-1]=='*')
103                 {
104                     A[Sum2].Num=k;
105                     A[Sum2].x=i;
106                     A[Sum2++].y=j;
107                 }
108             }
109         }
110 }
111 void Output(int Flag,int a,int b)
112 {
113     if(Flag!=1) printf("\n");
114     printf("puzzle #%d:\n",Flag);
115     printf("Across\n");
116     for(int i=0; i<Sum2; i++)
117     {
118         printf("%3d.",A[i].Num);
119         for(int j=0;; j++)
120         {
121             printf("%c",str[A[i].x][A[i].y+j]);
122             if((A[i].y+j)==b-1) break;
123             if(str[A[i].x][A[i].y+j+1]=='*') break;
124         }
125         printf("\n");
126     }
127     printf("Down\n");
128     for(int i=0; i<Sum1; i++)
129     {
130         printf("%3d.",D[i].Num);
131         for(int j=0;; j++)
132         {
133             printf("%c",str[D[i].x+j][D[i].y]);
134             if((D[i].x+j)==a-1) break;
135             if(str[D[i].x+j+1][D[i].y]=='*') break;
136         }
137         printf("\n");
138     }
139 }
View Code

 

posted on 2015-01-04 15:19  活力典  阅读(622)  评论(2)  编辑  收藏  举报

导航