題目鏈接： http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=168
（該題目同POJ 1888）
?
| 13832879 | 232 | Crossword Answers | Accepted | C++ | 0.279 | 2014-07-04 13:47:00 |
| 13832817 | 232 | Crossword Answers | Runtime error | C++11 | 0.000 | 2014-07-04 13:30:54 |
| 13832786 | 232 | Crossword Answers | Runtime error | C++ | 0.000 | 2014-07-04 13:24:03 |
| 13832776 | 232 | Crossword Answers | Runtime error | C++ | 0.000 | 2014-07-04 13:21:02 |
?
?
?
?
| ? 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 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
解題思路：純粹字符串亂搞題。開(kāi)始由于輸出時(shí)候遍歷越界使勁的RE，在不嚴(yán)謹(jǐn)?shù)腜OJ上居然沒(méi)有RE，直接AC了，讓我好無(wú)語(yǔ)?？磥?lái)是g++和C++的編譯環(huán)境差異，以后有機(jī)會(huì)去了解一下兩者的區(qū)別。越說(shuō)越想看CSAPP呃。
1
#include <iostream>
2
#include <cstring>
3
#include <cstdio>
4
#include <cstdlib>
5
#include <cctype>
6
#include <
string
>
7
#include <algorithm>
8
#include <numeric>
9
using
namespace
std;
10
11
bool
cmp(pair<
int
,
string
> a, pair<
int
,
string
>
b) {
12
return
a.first <
b.first;
13
}
14
15
int
main() {
16
char
Map[
15
][
15
];
17
int
Mapf[
15
][
15
];
18
int
x, y, cnt =
0
;
19
20
while
(cin >>
x) {
21
if
(x) cin >>
y;
22
else
break
;
23
for
(
int
i =
0
; i <
15
; i++
) {
24
for
(
int
j =
0
; j <
15
; j++
) {
25
Map[i][j] =
'
*
'
;
26
27
}
28
}
29
memset(Mapf,
0
,
sizeof
(Mapf));
30
pair<
int
,
string
> p[
1001
];
31
int
cur =
0
;
32
33
34
for
(
int
i =
1
; i <= x; i++
) {
35
for
(
int
j =
1
; j <= y; j++
) {
36
cin >>
Map[i][j];
37
if
(Map[i][j] ==
'
*
'
) {
38
Mapf[i][j] = -
1
;
39
}
else
{
40
if
(i -
1
<
1
|| j -
1
<
1
|| Map[i -
1
][j] ==
'
*
'
|| Map[i][j -
1
] ==
'
*
'
) Mapf[i][j] = ++
cur;
41
else
Mapf[i][j] = -
1
;
42
}
43
}
44
}
45
/*
for(int i = 1; i <= x; i++) {
46
for(int j = 1; j <= y; j++) {
47
cout << Mapf[i][j] << " ";
48
}
49
cout << endl;
50
}
*/
51
if
(cnt) cout <<
endl;
52
int
last =
0
;
53
printf(
"
puzzle #%d:\n
"
, ++
cnt);
54
cout <<
"
Across
"
<<
endl;
55
for
(
int
i =
1
; i <
15
; i++
) {
56
string
str =
""
;
57
for
(
int
j =
1
; j <
15
; j++
) {
58
if
(Map[i][j] !=
'
*
'
) {
59
if
(str ==
""
) last =
Mapf[i][j];
60
str +=
Map[i][j];
61
}
else
{
62
if
(str !=
""
) {
//
cout << " " << last << "." << str << endl;
63
printf(
"
%3d.
"
, last);
64
cout << str <<
endl;
65
}
66
str =
""
;
67
}
68
69
}
70
}
71
72
cout <<
"
Down
"
<<
endl;
73
int
pcu =
0
;
74
for
(
int
j =
1
; j <
15
; j++
) {
75
string
str =
""
;
76
for
(
int
i =
1
; i <
15
; i++
) {
77
if
(Map[i][j] !=
'
*
'
) {
78
if
(str ==
""
) last =
Mapf[i][j];
79
str +=
Map[i][j];
80
}
else
{
81
if
(str !=
""
) {
82
p[pcu].first =
last;
83
p[pcu++].second =
str;
84
//
cout << " " << last << "." << str << endl;
85
str =
""
;
86
}
87
}
88
89
}
90
}
91
sort(p, p +
pcu, cmp);
92
for
(
int
i =
0
; i < pcu; i++
) {
93
printf(
"
%3d.
"
, p[i].first);
94
cout << p[i].second<<
endl;
95
}
96
}
97
98
return
0
;
99
}
?
更多文章、技術(shù)交流、商務(wù)合作、聯(lián)系博主
微信掃碼或搜索：z360901061
微信掃一掃加我為好友
QQ號(hào)聯(lián)系： 360901061
您的支持是博主寫(xiě)作最大的動(dòng)力，如果您喜歡我的文章，感覺(jué)我的文章對(duì)您有幫助，請(qǐng)用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧，狠狠點(diǎn)擊下面給點(diǎn)支持吧，站長(zhǎng)非常感激您！手機(jī)微信長(zhǎng)按不能支付解決辦法：請(qǐng)將微信支付二維碼保存到相冊(cè)，切換到微信，然后點(diǎn)擊微信右上角掃一掃功能，選擇支付二維碼完成支付。
【本文對(duì)您有幫助就好】元
