YNZH's Blog

纵横字谜Uva232

input

input.txt 保存输入结果

1
2
3
4
5
6
7
8
9
10
11
2 2
AT
*O
6 7
AIM*DEN
*ME*ONE
UPON*TO
SO*ERIN
*SA*OR*
IES*DEA
0

code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <cstring>
#define LOCAL
int main()
{

#ifdef LOCAL

freopen("input.txt","r",stdin);
freopen("out.txt", "w", stdout);

#endif // LOCAL

int r, c, n = 0;
while (scanf("%d", &r) == 1 && r != 0)
{
scanf( "%d", &c);


char ** m = new char*[r]; //字母格矩阵
int** beginPoint = new int*[r]; //起始格点存储矩阵


for (int i = 0; i < r; i++)
{
m[i] = new char[c];
beginPoint[i] = new int[c];
}

for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
char c = '\0';
scanf( "%c", &c);
while (c == 10 || c == 13)
{
scanf( "%c", &c);
}
m[i][j] = c;

}
}

if ((n + 1) != 1)
{
printf("\n");
}

printf("puzzle #%d:\nAcross", ++n);
//ACross

int began = 0;
int flag = 1; //flag为1可以开始选择起点
for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
char ch = m[i][j];
beginPoint[i][j] = -1;
//首行所有白格都是起始格
if (i == 0)
{
if (ch != '*')
{
began++;
beginPoint[i][j] = began;
}
if (flag&& ch != '*')
{
printf("\n%3d.%c", began, ch);

if (j == c - 1)
{
flag = 1;
continue;
}
else
{
flag = !flag;
continue;
}

}
if (ch != '*')
{
printf("%c", ch);
if (j == c - 1)
{
flag = 1;
continue;
}
}
else if (ch == '*')
{
flag = 1;
continue;
}

}

//非首行
else
{
if (ch != '*')
{
if (j == 0 || m[i][j - 1] == '*' || m[i - 1][j] == '*')
{
began++;
beginPoint[i][j] = began;
}
}
if (flag&&ch != '*')
{
if (j == 0 || m[i][j - 1] == '*' || m[i - 1][j] == '*')
{

printf("\n%3d.%c", beginPoint[i][j], ch);

if (j == c - 1)
{
flag = 1;
continue;
}
else
{
flag = !flag;
continue;
}
}
}
if (ch != '*')
{

printf("%c", ch);
if (j == c - 1)
{
flag = 1;
continue;
}
}
else if (ch == '*')
{
flag = 1;
continue;
}
}
}
}
printf("\n");
//Down ====================================

printf("Down");
flag = 1; //flag为1可以开始选择起点

for (int i = 0; i < r; i++)
{
for (int j = 0; j < c; j++)
{
char ch = m[i][j];

//首行所有白格都是起始格
if (i == 0)
{
if (flag&& ch != '*')
{
printf("\n%3d.%c", beginPoint[i][j], ch);
}
else
{
continue;
}
for (int k = i + 1; k < r; k++)
{

char ch1 = m[k][j];
if (ch1 != '*')
{
printf("%c", ch1);
m[k][j] = '*';
if (k == r - 1)
{
flag = 1;
break;
}
}
else if (ch1 == '*')
{
flag = 1;
break;
}
}
}

//非首行
else
{
if (ch != '*' && flag)
{
printf("\n%3d.%c", beginPoint[i][j], ch);

for (int k = i + 1; k < r; k++)
{
char ch = m[k][j];
if (ch != '*')
{
printf("%c", ch);
m[k][j] = '*';
if (k == r - 1)
{
flag = 1;
break;
}
}
else if (ch == '*')
{
flag = 1;
break;
}
}
}
}
}
}
for (int i = 0; i < r; i++)
{
delete[] m[i];
delete[] beginPoint[i];
m[i] = NULL;
beginPoint[i] = NULL;
}
delete m;
m = NULL;
beginPoint = NULL;

printf("\n");

}
#ifdef LOCAL
fclose(stdout);
fclose(stdin);
#endif // LOCAl


return 0;

}

output

out.txt

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
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

总结

  • 使用freopen将stdin输入重定向到文件方便测试
  • 注意要#define LOCAL然后使用#ifdef #endif语句块包含重定向语句在提交答案时取消注释即可

 评论


博客内容遵循 署名-非商业性使用-相同方式共享 4.0 国际 (CC BY-NC-SA 4.0) 协议

本站使用 Material X 作为主题 , 总访问量为 次 。
载入天数...载入时分秒...