-
Notifications
You must be signed in to change notification settings - Fork 1
/
1998 S3.cpp
278 lines (188 loc) · 7.93 KB
/
1998 S3.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
/*
1998 S3 - Mars Rover
Difficulty: Easy (Just very time consuming to implement)
This problem is quite simple. Imagine a cartesian plane with the lander at (0, 0), now simulate the rover's movement across the plane.
Key realization, regardless of what way the rover moves, it's minimum distance back to the lander is the horizontal distance from the lander + the vertical distance from the lander since it can only move in 4 directions. You can test this yourself.
Meaning you will only ever need 2 move commands and however many rotations required to achieve these move commands.
There are 8 possibilites to where the rover can end.
1. Top left quadrant
2. Top right quadrant
3. Bottom left quadrant
4. Bottom right quadrant
5. Positive X Axis
6. Negative X Axis
7. Positive Y Axis
8. Negative Y Axis
From each of the position, you must also consider 4 possible ending directions of the rover.
In total, 32 possibilites, very time consuming to implement
*/
#include <iostream>
int main(){
int n;
std::cin >> n;
for (int i = 0; i < n; i++){
//startX, startY for lander, roverX, roverY for rover
int startX = 0, startY = 0, roverX = 0, roverY = 0, direction = 0;
int instruction, distance; //I will be storing direction in the form of degrees, 0 is north, 90 is east, etc.
while (true){
std::cin >> instruction;
//End of excursion
if (instruction == 0){
break;
}
//Move
if (instruction == 1){
std::cin >> distance;
if (direction == 0){
roverY += distance;
}
else if (direction == 90){
roverX += distance;
}
else if (direction == 180){
roverY -= distance;
}
else{
roverX -= distance;
}
}
//Turn right
else if (instruction == 2){
direction += 90;
direction %= 360;
}
//Turn left
else{
direction += 270; //Going left 90 is the same thing as going right 270
direction %= 360;
}
}
//Output distance
std::cout << "Distance is " << std::abs(roverX) + std::abs(roverY) << '\n';
/*
Way too many if statements, not gonna comment them all.
General idea, determine which 2 directions you need to face, figure out which is closest from the starting direction, go to that one first, then go to the other afterward.
*/
//Top Left Quadrant
if (roverX < startX && roverY > startY){
if (direction == 0){
std::cout << 2 << '\n' << 1 << '\n' << startX - roverX << '\n' << 2 << '\n' << 1 << '\n' << roverY << '\n';
}
else if (direction == 90){
std::cout << 1 << '\n' << startX - roverX << '\n' << 2 << '\n' << 1 << '\n' << roverY << '\n';
}
else if (direction == 180){
std::cout << 1 << '\n' << roverY << '\n' << 3 << '\n' << 1 << '\n' << startX - roverX << '\n';
}
else{
std::cout << 3 << '\n' << 1 << '\n' << roverY << '\n' << 3 << '\n' << 1 << '\n' << startX - roverX << '\n';
}
}
//Top Right Quadrant
if (roverX > startX && roverY > startY){
if (direction == 0){
std::cout << 3 << '\n' << 1 << '\n' << roverX << '\n' << 3 << '\n' << 1 << '\n' << roverY << '\n';
}
else if (direction == 90){
std::cout << 2 << '\n' << 1 << '\n' << roverY << '\n' << 2 << '\n' << 1 << '\n' << roverX << '\n';
}
else if (direction == 180){
std::cout << 1 << '\n' << roverY << '\n' << 2 << '\n' << 1 << '\n' << roverX << '\n';
}
else{
std::cout << 1 << '\n' << roverX << '\n' << 3 << '\n' << 1 << '\n' << roverY << '\n';
}
}
//Bottom Right Quadrant
if (roverX > startX && roverY < startY){
if (direction == 0){
std::cout << 1 << '\n' << startY - roverY << '\n' << 3 << '\n' << 1 << '\n' << roverX << '\n';
}
else if (direction == 90){
std::cout << 3 << '\n' << 1 << '\n' << startY - roverY << '\n' << 3 << '\n' << 1 << '\n' << roverX << '\n';
}
else if (direction == 180){
std::cout << 2 << '\n' << 1 << '\n' << roverX << '\n' << 2 << '\n' << 1 << '\n' << startY - roverY << '\n' ;
}
else{
std::cout << 1 << '\n' << roverX << '\n' << 2 << '\n' << 1 << '\n' << startY - roverY << '\n';
}
}
//Bottom Left Quadrant
if (roverX < startX && roverY < startY){
if (direction == 0){
std::cout << 1 << '\n' << startY - roverY << '\n' << 2 << '\n' << 1 << '\n' << startX - roverX << '\n';
}
else if (direction == 90){
std::cout << 1 << '\n' << startX - roverX << '\n' << 3 << '\n' << 1 << '\n' << startY - roverY << '\n';
}
else if (direction == 180){
std::cout << 3 << '\n' << 1 << '\n' << startX - roverX << '\n' << 3 << '\n' << 1 << '\n' << startY - roverY << '\n';
}
else{
std::cout << 2 << '\n' << 1 << '\n' << startY - roverY << '\n' << 2 << '\n' << 1 << '\n' << startX - roverX << '\n';
}
}
//Positive Y Axis
if (roverX == startX && roverY > startY){
if (direction == 0){
std::cout << 2 << '\n' << 2 << '\n' << 1 << '\n' << roverY << '\n';
}
else if (direction == 90){
std::cout << 2 << '\n' << 1 << '\n' << roverY << '\n';
}
else if (direction == 180){
std::cout << 1 << '\n' << roverY << '\n';
}
else{
std::cout << 3 << '\n' << 1 << '\n' << roverY << '\n';
}
}
//Negative Y Axis
if (roverX == startX && roverY < startY){
if (direction == 0){
std::cout << 1 << '\n' << startY - roverY << '\n';
}
else if (direction == 90){
std::cout << 3 << '\n' << 1 << '\n' << startY - roverY << '\n';
}
else if (direction == 180){
std::cout << 2 << '\n' << 2 << '\n' << 1 << '\n' << startY - roverY << '\n';
}
else{
std::cout << 2 << '\n' << 1 << '\n' << startY - roverY << '\n';
}
}
//Positive X Axis
if (roverX > startX && roverY == startY){
if (direction == 0){
std::cout << 3 << '\n' << 1 << '\n' << roverX << '\n';
}
else if (direction == 90){
std::cout << 2 << '\n' << 2 << '\n' << 1 << '\n' << roverX << '\n';
}
else if (direction == 180){
std::cout << 2 << '\n' << 1 << '\n' << roverX << '\n';
}
else{
std::cout << 1 << '\n' << roverX << '\n';
}
}
//Negative X Axis
if (roverX < startX && roverY == startY){
if (direction == 0){
std::cout << 2 << '\n' << 1 << '\n' << startX - roverX << '\n';
}
else if (direction == 90){
std::cout << 1 << '\n' << startX - roverX << '\n';
}
else if (direction == 180){
std::cout << 3 << '\n' << 1 << '\n' << startX - roverX << '\n';
}
else{
std::cout << 2 << '\n' << 2 << '\n' << 1 << '\n' << startX - roverX << '\n';
}
}
}
return 0;
}