forked from mpfeifer1/Kattis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathglitchbot.cpp
114 lines (98 loc) · 1.95 KB
/
glitchbot.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
#include <iostream>
#include <vector>
#include <string>
using namespace std;
string other(string original) {
if(original == "Left") {
return "Right";
}
if(original == "Right") {
return "Forward";
}
else {
return "Left";
}
}
string other2(string original) {
if(original == "Left") {
return "Forward";
}
if(original == "Right") {
return "Left";
}
else {
return "Right";
}
}
int turn(int dir, string direction) {
if(direction == "Left") {
dir--;
}
if(direction == "Right") {
dir++;
}
if(dir < 0) {
dir += 4;
}
if(dir > 3) {
dir -= 4;
}
return dir;
}
void move(int& x, int& y, int& dir, string direction) {
if(direction == "Forward") {
if(dir == 0) {
y++;
}
if(dir == 1) {
x++;
}
if(dir == 2) {
y--;
}
if(dir == 3) {
x--;
}
}
else {
dir = turn(dir, direction);
}
}
bool process(int x, int y, vector<string>& moves) {
int currX = 0;
int currY = 0;
int dir = 0;
for(auto i : moves) {
move(currX, currY, dir, i);
}
if(currX == x && currY == y) {
return true;
}
return false;
}
int main() {
int endX, endY;
cin >> endX >> endY;
int n;
cin >> n;
vector<string> moves;
for(int i = 0; i < n; i++) {
string temp;
cin >> temp;
moves.push_back(temp);
}
for(int i = 0; i < moves.size(); i++) {
string original = moves[i];
moves[i] = other(original);
if(process(endX, endY, moves)) {
cout << i+1 << " " << moves[i] << endl;
return 0;
}
moves[i] = other2(original);
if(process(endX, endY, moves)) {
cout << i+1 << " " << moves[i] << endl;
return 0;
}
moves[i] = original;
}
}