-
Notifications
You must be signed in to change notification settings - Fork 0
/
droneProgramming.cpp
284 lines (264 loc) · 7.95 KB
/
droneProgramming.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
#include"droneProgramming.h"
void DroneProgramming::visualizeDroneWithAllPaths(std::string outPath)
{
std::ofstream output (outPath);
droneWithAllPaths.toGv(output);
}
void DroneProgramming::visualizeDroneWithShortestPaths(std::string outPath)
{
std::ofstream output (outPath);
droneWithShortestPaths.toGv(output);
}
//Returns the length of a string that represents a path in the tree by a given identifier
int DroneProgramming::lengthOfChosenPath(std::string path) const
{
int length = 0;
for(char elem : path)
{
if(elem != 'P')
{
length++;
}
}
return length;
}
//Returns the quantity of paint spill of a string that represents a path in the tree by a given identifier
int DroneProgramming::quantityPaintSpill(std::string path) const
{
int quantity = 0;
for(char elem : path)
{
if(elem == 'P')
{
quantity++;
}
}
return quantity;
}
//Returns a string of path in which there is no paint spill
std::string DroneProgramming::findPathWithoutPaintSpill(std::string path) const
{
std::string saver;
for(char elem : path)
{
if(elem != 'P')
{
saver.push_back(elem);
}
}
return saver;
}
//Returns the number of turns Tom should make to reach Jerry of a string that represents a path in the tree by a given identifier
int DroneProgramming::countTurns(std::string path) const
{
int turns = 0;
std::string helper = findPathWithoutPaintSpill(path);
for(int i = 0; i < helper.size() - 1; i++)
{
if(helper[i] != helper[i+1])
{
turns++;
}
}
return turns;
}
//Returns the maximum amount of spilled paint
int DroneProgramming::maxPaintSpill(std::vector<std::string> paths) const
{
int max = 0;
if(!paths.empty())
{
max = quantityPaintSpill(paths[0]);
for(std::string posPath : paths)
{
if(quantityPaintSpill(posPath) > max)
{
max = quantityPaintSpill(posPath);
}
}
}
return max;
}
//Returns all paths with maximum amount of spilled paint
std::vector<std::string> DroneProgramming::pathsWithMostPaintSpill() const
{
std::vector<std::string> saver;
int max = maxPaintSpill(room.getPossiblePaths());
if(max)
{
for(std::string posPath : room.getPossiblePaths())
{
if(quantityPaintSpill(posPath) == max)
{
saver.push_back(posPath);
}
}
}
return saver;
}
//Returns the number of least turns
int DroneProgramming::minTurns(std::vector<std::string> other) const
{
int min = 0;
if(!other.empty())
{
min = countTurns(other[0]);
for(std::string elem : other)
{
if(countTurns(elem) < min)
{
min = countTurns(elem);
}
}
}
return min;
}
//Returns all paths with maximum amount of spilled paint and minimum turns Tom should make to reach Jerry
std::vector<std::string> DroneProgramming::pathsWithMaxPaintSpillAndLeastTurns() const
{
std::vector<std::string> result;
std::vector<std::string> curr = pathsWithMostPaintSpill();
if(!curr.empty())
{
int min = minTurns(curr);
for(std::string elem : curr)
{
if(countTurns(elem) == min)
{
result.push_back(elem);
}
}
}
return result;
}
//Returns all fastest paths with maximum amount of spilled paint Tom should make to reach Jerry
std::vector<std::string> DroneProgramming::fastestPathWithMostPaintSpill() const
{
std::vector<std::string> result;
std::vector<std::string> curr = room.createShortestPossiblePaths();
if(!curr.empty())
{
int max = maxPaintSpill(curr);
for(std::string elem : curr)
{
if(quantityPaintSpill(elem) == max)
{
result.push_back(elem);
}
}
}
return result;
}
void DroneProgramming::print(std::string path) const
{
for(int i = 0; i < path.size() - 1; i++)
{
std::cout << path[i] << "->";
}
std::cout << path[path.size() - 1];
}
void DroneProgramming::createRoomAndDrone()
{
bool flag = true;
std::string filePath;
do
{
try
{
std::cout << "Please, enter file name: ";
std::cin >> filePath;
room.createRoom(filePath + ".txt");
flag = false;
}
catch(const std::runtime_error& e)
{
std::cout << e.what() << '\n';
}
} while (flag);
droneWithAllPaths.addAllPaths(room.createAllPossiblePaths());
droneWithShortestPaths.addAllPaths(room.createShortestPossiblePaths());
droneWithAllPaths.createIdToLeaves();
droneWithShortestPaths.createIdToLeaves();
}
void DroneProgramming::visualize()
{
std::string visAllPaths;
std::cout<<"Please, type a file name to visualize tree with all possible paths in: ";
std::cin>>visAllPaths;
visualizeDroneWithAllPaths(visAllPaths + ".gv");
std::string visShortestPaths;
std::cout<<"Please, type a file name to visualize tree with the shortest possible paths in: ";
std::cin>>visShortestPaths;
visualizeDroneWithShortestPaths(visShortestPaths + ".gv");
}
void DroneProgramming::mainFunctionalities()
{
int id;
do
{
while (std::cout << "Please, enter number of leaf: " && !(std::cin >> id))
{
std::cin.clear(); //clear bad input flag
std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n'); //discard input
std::cout << "Invalid input, please re-enter!\n";
}
} while (id < 0 || id >= droneWithShortestPaths.countLeaves());
std::cout << "\nCommands which have to be entered in the drone: ";
print(droneWithShortestPaths.findPathOnLeafWithId(id));
std::cout<<'\n';
std::cout << "Length of path: " << lengthOfChosenPath(droneWithShortestPaths.findPathOnLeafWithId(id)) << '\n';
std::cout << "Amount of paint spilled: " << quantityPaintSpill(droneWithShortestPaths.findPathOnLeafWithId(id)) << '\n';
std::cout << "Number of turns: " << countTurns(droneWithShortestPaths.findPathOnLeafWithId(id)) << "\n\n";
}
void DroneProgramming::firstAdditionallyFunctionalities() const
{
std::vector<std::string> maxPaintMinTurns = pathsWithMaxPaintSpillAndLeastTurns();
if(!maxPaintMinTurns.empty())
{
std::cout<<"Paths with the most paint spill and the least turns: ";
for(std::string maxElem : maxPaintMinTurns)
{
print(maxElem);
std::cout<< " ";
}
std::cout << '\n';
}
else
{
std::cout << "There are no roads in which there is paint spill!\n";
}
}
void DroneProgramming::secondAdditionallyFunctionalities() const
{
std::vector<std::string> maxPaintShortestPath = fastestPathWithMostPaintSpill();
if(!maxPaintShortestPath.empty())
{
std::cout<<"The shortest path with the most paint spill: ";
for(std::string elem : maxPaintShortestPath)
{
print(elem);
std::cout<< " ";
}
std::cout << '\n';
}
else
{
std::cout << "There are no roads in which there is paint spill!\n";
}
}
//main function demonstrating all functionalities
void DroneProgramming::start()
{
createRoomAndDrone();
if(droneWithAllPaths.countLeaves())
{
visualize();
mainFunctionalities();
firstAdditionallyFunctionalities();
secondAdditionallyFunctionalities();
}
else
{
std::cout<< "No paths from Tom to Jerry!\n";
}
}