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
这个问题,注意前面的号码就好了。
附上AC代码:
 #include<stdio.h>
#include<string.h>
#include<ctype.h> struct As
{
int x,y;
int Num;
}A[];
struct Dn
{
int x,y;
int Num;
}D[];
int a,b;
char str[][];
int t1[][];
int t2[][];
int k;
int i1,i2;
int Flag;
int main()
{
Flag=;
while(scanf("%d",&a)!=EOF&&a)
{
scanf("%d",&b);
for(int i=;i<;i++)
for(int j=;j<;j++)
{
t1[i][j]=;
t2[i][j]=;
}
for(int i=;i<a;i++)
scanf("%s",str[i]);
for(int i=;i<a;i++)
for(int j=;j<b;j++)
{
if(isalpha(str[i][j]))
{
if(i==||j==)
t1[i][j]=;
else if(str[i-][j]=='*'||str[i][j-]=='*')
t1[i][j]=;
}
}
k=;
i1=i2=;
for(int i=;i<a;i++)
for(int j=;j<b;j++)
{
if(t1[i][j])
{
k++;
t2[i][j]=k;
if(i==||str[i-][j]=='*')
{
D[i1].Num=k;
D[i1].x=i;
D[i1++].y=j;
}
if(j==||str[i][j-]=='*')
{
A[i2].Num=k;
A[i2].x=i;
A[i2++].y=j;
}
}
}
if(Flag!=) printf("\n");
printf("puzzle #%d:\n",Flag++);
printf("Across\n");
for(int i=;i<i2;i++)
{
printf("%3d.",A[i].Num);
for(int j=;;j++)
{
printf("%c",str[A[i].x][A[i].y+j]);
if((A[i].y+j)==b-) break;
if(str[A[i].x][A[i].y+j+]=='*') break;
}
printf("\n");
}
printf("Down\n");
for(int i=;i<i1;i++)
{
printf("%3d.",D[i].Num);
for(int j=;;j++)
{
printf("%c",str[D[i].x+j][D[i].y]);
if((D[i].x+j)==a-) break;
if(str[D[i].x+j+][D[i].y]=='*') break;
}
printf("\n");
}
}
return ;
}

修改之后的代码:

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

 #include<stdio.h>
#include<string.h>
#include<ctype.h> struct As
{
int x,y;
int Num;
} A[];
struct Dn
{
int x,y;
int Num;
} D[];
int Sum1,Sum2;
char str[][];
int t1[][];
int t2[][];
void Initializer();
void Input(int a);
void SearchHead(int ,int );
void OrderHead(int ,int );
void SortAorD(int ,int );
void Output(int ,int ,int );
int main()
{
int Flag=;
int a,b;
while(scanf("%d",&a)!=EOF&&a)
{
Sum1=Sum2=;
scanf("%d",&b);
Initializer();
Input(a);
SearchHead(a,b);
OrderHead(a,b);
SortAorD(a,b);
Output(Flag,a,b);
Flag++;
}
return ;
}
void Initializer()
{
for(int i=; i<; i++)
for(int j=; j<; j++)
{
t1[i][j]=;
t2[i][j]=;
}
} void Input(int a)
{
for(int i=; i<a; i++)
scanf("%s",str[i]);
}
void SearchHead(int a,int b)
{
for(int i=; i<a; i++)
for(int j=; j<b; j++)
{
if(isalpha(str[i][j]))
{
if(i==||j==)
t1[i][j]=;
else if(str[i-][j]=='*'||str[i][j-]=='*')
t1[i][j]=;
}
}
}
void OrderHead(int a,int b)
{
for(int i=; i<a; i++)
for(int j=; j<b; j++)
{
if(isalpha(str[i][j]))
{
if(i==||j==)
t1[i][j]=;
else if(str[i-][j]=='*'||str[i][j-]=='*')
t1[i][j]=;
}
}
}
void SortAorD(int a,int b)
{
int k=;
for(int i=; i<a; i++)
for(int j=; j<b; j++)
{
if(t1[i][j])
{
k++;
t2[i][j]=k;
if(i==||str[i-][j]=='*')
{
D[Sum1].Num=k;
D[Sum1].x=i;
D[Sum1++].y=j;
}
if(j==||str[i][j-]=='*')
{
A[Sum2].Num=k;
A[Sum2].x=i;
A[Sum2++].y=j;
}
}
}
}
void Output(int Flag,int a,int b)
{
if(Flag!=) printf("\n");
printf("puzzle #%d:\n",Flag);
printf("Across\n");
for(int i=; i<Sum2; i++)
{
printf("%3d.",A[i].Num);
for(int j=;; j++)
{
printf("%c",str[A[i].x][A[i].y+j]);
if((A[i].y+j)==b-) break;
if(str[A[i].x][A[i].y+j+]=='*') break;
}
printf("\n");
}
printf("Down\n");
for(int i=; i<Sum1; i++)
{
printf("%3d.",D[i].Num);
for(int j=;; j++)
{
printf("%c",str[D[i].x+j][D[i].y]);
if((D[i].x+j)==a-) break;
if(str[D[i].x+j+][D[i].y]=='*') break;
}
printf("\n");
}
}

UVa 232 Crossword Answers的更多相关文章

  1. UVa232.Crossword Answers

    题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem& ...

  2. Uva 232 一个换行WA 了四次

    由于UVA OJ上没有Wrong anwser,搞的多花了好长时间去测试程序,之前一直以为改OJ有WA,后来网上一搜才知道没有WA,哎哎浪费了好长时间.此博客用来记录自己的粗心大意. 链接地址:htt ...

  3. poj 1888 Crossword Answers 模拟题

    Crossword Answers Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 869   Accepted: 405 D ...

  4. Crossword Answers UVA - 232

    题目大意 感觉挺水的一道题.找出左面右面不存在或者是黑色的格子的白各,然后编号输出一横向单词和竖向单词(具体看原题) 解析 ①找出各个格子的编号 ②对每个节点搜索一下 ③输出的时候注意最后一个数据后面 ...

  5. 【习题 3-6 UVA - 232】Crossword Answers

    [链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 模拟题.注意场宽为3 [代码] #include <bits/stdc++.h> using namespace std ...

  6. 紫书第三章训练1 D - Crossword Answers

    A crossword puzzle consists of a rectangular grid of black and white squares and two lists of defini ...

  7. UVA 232 Corssword Answer

    题意:输入m*n大小的字符串(里面有*,*为黑格,其他为白格),然后对它编号,编号规则为从左到右,从上往下,且左边或上面没有白格(可能是黑格或越界),如下图: 注意: ①除第一次输出答案外,其余每次输 ...

  8. Crossword Answers -------行与列按序输出

    题目链接:https://vjudge.net/problem/UVA-232#author=0 题意:关键句:The de nitions correspond to the rectangular ...

  9. [刷题]算法竞赛入门经典 3-4/UVa455 3-5/UVa227 3-6/UVa232

    书上具体所有题目:http://pan.baidu.com/s/1hssH0KO 题目:算法竞赛入门经典 3-4/UVa455:Periodic Strings 代码: //UVa455 #inclu ...

随机推荐

  1. A Simple Math Problem(HDU 1757 构造矩阵)

    If x < 10 f(x) = x.If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-1 ...

  2. Spring MVC URL传参

    Spring MVC 学习 之 - URL参数传递   在学习 Spring Mvc 过程中,有必要来先了解几个关键参数:    @Controller: 在类上注解,则此类将编程一个控制器,在项目启 ...

  3. While reading XXX pngcrush caught libpng error: N

    错误一:   While reading /XXX/XXX/XXX/img1.png pngcrush caught libpng error:   Not a PNG filCould not fi ...

  4. angular+bootstrap分页指令案例

    AngularJS中不仅内置了许多指令,而且开发人员也可以通过自定义指令来完成特殊操作,指令创建成功后可以到处复用. Web应用中的分页处理最为常见,我们可以将分页模块编写成一个可以复用的Angula ...

  5. javascript 事件触发

    http://www.zhangxinxu.com/wordpress/2012/04/js-dom%E8%87%AA%E5%AE%9A%E4%B9%89%E4%BA%8B%E4%BB%B6/ htt ...

  6. cf A. Down the Hatch!

    http://codeforces.com/contest/332/problem/A #include <cstdio> #include <iostream> #inclu ...

  7. Linq to OBJECT延时标准查询操作符

    1.Where 操作符用于限定输入集合中的元素,将符合条件的元素组织声称一个序列结果.2.Select  操作符用于根据输入序列中的元素创建相应的输出序列中的元素,输出序列中的元素类型可以与输入序列中 ...

  8. iptables 顺序

    -A INPUT -s 115.236.6.6/32 -p udp -m udp --dport 111 -j ACCEPT -A INPUT -s 10.175.197.98/32 -p udp - ...

  9. hdu5017:补题系列之西安网络赛1011

    补题系列之西安网络赛1011 题目大意:给定一个椭球: 求它到原点的最短距离. 思路: 对于一个椭球的标准方程 x^2/a^2 + y^2/b^2 +z^2/c^2=1 来说,它到原点的最短距离即为m ...

  10. Java 微服务框架 Redkale 入门介绍

    Redkale 功能 Redkale虽然只有1.xM大小,但是麻雀虽小五脏俱全.既可作为服务器使用,也可当工具包使用.作为独立的工具包提供以下功能:1.convert包提供JSON的序列化和反序列化功 ...