-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhomework_3.cpp
409 lines (370 loc) · 14.2 KB
/
homework_3.cpp
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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <string>
#include <time.h> // time
#include <cstdlib>
using namespace std;
// don't change this function
// purpose: prints a map of the cave to the console
// input: the printable map a vector of strings
// output: none - console output of the cave diagram
void Print_Cave_Diagram(const vector<string> &cave_diagram){
for (auto s : cave_diagram)
cout<<s <<endl;
}
// Implement these functions below
// Do not change the function prototpyes
void Initialize_Cave(map<vector<int>, set<string> > &cave);
void Print_Square(map<vector<int>, set<string> > &cave);
void Get_Cave_Diagram(map<vector<int>, set<string> > &cave, vector<string> &cave_diagram);
// sample main function
int main() {
map<vector<int>, set<string> > cave;
Initialize_Cave(cave);
Print_Square(cave);
vector<string> cave_diagram;
Get_Cave_Diagram(cave, cave_diagram);
Print_Cave_Diagram(cave_diagram);
return 0;
}
// add the player, ladder, wumpus, pits, gold, stench, breeze to the map
// input:
// output:
void Initialize_Cave(map<vector<int>, set<string> > &cave) {
srand(time(NULL));
// place the "ladder" in row 1 column 1
cave[{1,1}].insert("ladder");
// place the "player" at the same location as the ladder
cave[{1,1}].insert("player");
// place the "wumpus" - can't be in the same square as the ladder
int random1 = 2+(rand()%3);
int random2 = 2+(rand()%3);
cave[{random1,random2}].insert("wumpus");
// place the 3 "pits" - can't be in the same square as the ladder, wumpus, or another pit
int random3 = 2+(rand()%3);
int random4 = 2+(rand()%3);
int random5 = 2+(rand()%3);
int random6 = 2+(rand()%3);
int random7 = 2+(rand()%3);
int random8 = 2+(rand()%3);
while(random1 == random3 && random2 == random4)
{
random3 = 2+(rand()%3);
random4 = 2+(rand()%3);
}
cave[{random3,random4}].insert("pit");
while(random3 == random5 && random4 == random6)
{
random5 = 2+(rand()%3);
random6 = 2+(rand()%3);
}
cave[{random5,random6}].insert("pit");
while(random5 == random7 && random6 == random8)
{
random7 = 2+(rand()%3);
random8 = 2+(rand()%3);
}
cave[{random7,random8}].insert("pit");
// place the "gold" - can't be in the same square as a pit or the ladder
int random9 = 2+(rand()%3);
int random10 = 2+(rand()%3);
while((random9 == random3 && random10 == random4) || (random9 == random5 && random10 == random6) || (random9 == random7 && random10 == random8))
{
random9 = 2+(rand()%3);
random10 = 2+(rand()%3);
}
cave[{random9,random10}].insert("gold");
// place the "stench" squares to the left, right, up, and down from the wumpus
cave[{random1,random2+1}].insert("stench");
cave[{random1,random2-1}].insert("stench");
cave[{random1-1,random2}].insert("stench");
cave[{random1+1,random2}].insert("stench");
// place the "breeze" squares to the left, right, up, and down from the three pits
cave[{random3,random4+1}].insert("breeze");
cave[{random3,random4-1}].insert("breeze");
cave[{random3-1,random4}].insert("breeze");
cave[{random3+1,random4}].insert("breeze");
cave[{random5,random6+1}].insert("breeze");
cave[{random5,random6-1}].insert("breeze");
cave[{random5-1,random6}].insert("breeze");
cave[{random5+1,random6}].insert("breeze");
cave[{random7,random8+1}].insert("breeze");
cave[{random7,random8-1}].insert("breeze");
cave[{random7-1,random8}].insert("breeze");
cave[{random7+1,random8}].insert("breeze");
}
// print the contents of the square
// input:
// output:
void Print_Square(map<vector<int>, set<string> > &cave) {
for (int r=1; r<=4; r++) {
for (int c=1; c<=4; c++) {
cout << r<< ", "<< c << endl;
cout << "This part of the cave contains" << endl;
if(cave[{r,c}].empty() != false)
{
cout<<" nothing"<<endl<<endl;
}
if (cave[{r,c}].empty() == false)
{
for(set<string>::iterator it = cave[{r,c}].begin(); it != cave[{r,c}].end(); it++)
{
cout<<" "<<*it<<endl;
}
cout<<endl;
}
}
}
}
// build a vector of strings where each string in the vector represents one row of the cave output
// input:
// output:
void Get_Cave_Diagram(map<vector<int>, set<string> > &cave, vector<string> &cave_diagram) {
int cell_rows = 5;
int cell_columns = 11;
int total_rows = cell_rows*4 + 1;
int total_columns = cell_columns*4 + 1;
// fill in with vertical cell divisions
for (int r=0; r<total_rows; r++) {
string row(total_columns, ' ');
for (int c=0; c<total_columns; c+=cell_columns) {
row[c] = '|';
}
cave_diagram.push_back(row);
}
// udpate horizontal rows with '-'
for (int i=0; i<total_rows; i+=cell_rows) {
cave_diagram[i] = string(total_columns, '-');
}
// update cell corners with '+'
for (int r=0; r<total_rows; r+=cell_rows) {
for (int c=0; c<total_columns; c+=cell_columns) {
cave_diagram[r][c]='+';
}
}
// replace the part of the string with the cell contents
for (int c=1; c<=4; c++)
{
for (int r=1; r<=4; r++)
{
for(set<string>::iterator it = cave[{r,c}].begin(); it != cave[{r,c}].end(); it++)
{
string word = *it;
for(int i=0; i< word.length(); i++)
{
char letter = word.at(i);
if(r == 1 && c == 1)
{
if(cave_diagram[2].at(3+i) != ' ')
{
cave_diagram[3].at(3+i) = letter;
}
else if(cave_diagram[1].at(3+i) != ' ')
{
cave_diagram[2].at(3+i) = letter;
}
else
cave_diagram[1].at(3+i) = letter;
}
if(r == 1 && c == 2)
{
if(cave_diagram[2].at(14+i) != ' ')
{
cave_diagram[3].at(14+i) = letter;
}
else if(cave_diagram[1].at(14+i) != ' ')
{
cave_diagram[2].at(14+i) = letter;
}
else
cave_diagram[1].at(14+i) = letter;
}
if(r == 1 && c == 3)
{
if(cave_diagram[2].at(25+i) != ' ')
{
cave_diagram[3].at(25+i) = letter;
}
else if(cave_diagram[1].at(25+i) != ' ')
{
cave_diagram[2].at(25+i) = letter;
}
else
cave_diagram[1].at(25+i) = letter;
}
if(r == 1 && c == 4)
{
if(cave_diagram[2].at(36+i) != ' ')
{
cave_diagram[3].at(36+i) = letter;
}
else if(cave_diagram[1].at(36+i) != ' ')
{
cave_diagram[2].at(36+i) = letter;
}
else
cave_diagram[1].at(36+i) = letter;
}
if(r == 2 && c == 1)
{
if(cave_diagram[7].at(3+i) != ' ')
{
cave_diagram[8].at(3+i) = letter;
}
else if(cave_diagram[6].at(3+i) != ' ')
{
cave_diagram[7].at(3+i) = letter;
}
else
cave_diagram[6].at(3+i) = letter;
}
if(r == 2 && c == 2)
{
if(cave_diagram[7].at(14+i) != ' ')
{
cave_diagram[8].at(14+i) = letter;
}
else if(cave_diagram[6].at(14+i) != ' ')
{
cave_diagram[7].at(14+i) = letter;
}
else
cave_diagram[6].at(14+i) = letter;
}
if(r == 2 && c == 3)
{
if(cave_diagram[7].at(25+i) != ' ')
{
cave_diagram[8].at(25+i) = letter;
}
else if(cave_diagram[6].at(25+i) != ' ')
{
cave_diagram[7].at(25+i) = letter;
}
else
cave_diagram[6].at(25+i) = letter;
}
if(r == 2 && c == 4)
{
if(cave_diagram[7].at(36+i) != ' ')
{
cave_diagram[8].at(36+i) = letter;
}
else if(cave_diagram[6].at(36+i) != ' ')
{
cave_diagram[7].at(36+i) = letter;
}
else
cave_diagram[6].at(36+i) = letter;
}
if(r == 3 && c == 1)
{
if(cave_diagram[12].at(3+i) != ' ')
{
cave_diagram[13].at(3+i) = letter;
}
else if(cave_diagram[11].at(3+i) != ' ')
{
cave_diagram[12].at(3+i) = letter;
}
else
cave_diagram[11].at(3+i) = letter;
}
if(r == 3 && c == 2)
{
if(cave_diagram[12].at(14+i) != ' ')
{
cave_diagram[13].at(14+i) = letter;
}
else if(cave_diagram[11].at(14+i) != ' ')
{
cave_diagram[12].at(14+i) = letter;
}
else
cave_diagram[11].at(14+i) = letter;
}
if(r == 3 && c == 3)
{
if(cave_diagram[12].at(25+i) != ' ')
{
cave_diagram[13].at(25+i) = letter;
}
else if(cave_diagram[11].at(25+i) != ' ')
{
cave_diagram[12].at(25+i) = letter;
}
else
cave_diagram[11].at(25+i) = letter;
}
if(r == 3 && c == 4)
{
if(cave_diagram[12].at(36+i) != ' ')
{
cave_diagram[13].at(36+i) = letter;
}
else if(cave_diagram[11].at(36+i) != ' ')
{
cave_diagram[12].at(36+i) = letter;
}
else
cave_diagram[11].at(36+i) = letter;
}
if(r == 4 && c == 1)
{
if(cave_diagram[17].at(3+i) != ' ')
{
cave_diagram[18].at(3+i) = letter;
}
else if(cave_diagram[16].at(3+i) != ' ')
{
cave_diagram[17].at(3+i) = letter;
}
else
cave_diagram[16].at(3+i) = letter;
}
if(r == 4 && c == 2)
{
if(cave_diagram[17].at(14+i) != ' ')
{
cave_diagram[18].at(14+i) = letter;
}
else if(cave_diagram[16].at(14+i) != ' ')
{
cave_diagram[17].at(14+i) = letter;
}
else
cave_diagram[16].at(14+i) = letter;
}
if(r == 4 && c == 3)
{
if(cave_diagram[17].at(25+i) != ' ')
{
cave_diagram[18].at(25+i) = letter;
}
else if(cave_diagram[16].at(25+i) != ' ')
{
cave_diagram[17].at(25+i) = letter;
}
else
cave_diagram[16].at(25+i) = letter;
}
if(r == 4 && c == 4)
{
if(cave_diagram[17].at(36+i) != ' ')
{
cave_diagram[18].at(36+i) = letter;
}
else if(cave_diagram[16].at(36+i) != ' ')
{
cave_diagram[17].at(36+i) = letter;
}
else
cave_diagram[16].at(36+i) = letter;
}
}
}
}
}
}