RFO-Solutions/Robot.cpp at main · huseynovvusal/RFO-Solutions · GitHub

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
// https://basecamp.eolymp.com/az/problems/8361
#include <bits/stdc++.h>
using namespace std;
int a[101][101], x = 50, y = 50;
int main()
{
	string s;
	cin >> s;
	int r = 0, q = 0;
	a[x][y] = 1;
	for (int i = 0; i < s.size(); i++)
	{
		if (s[i] == 'R')
		{
			r++;
			if (r > 3)
				r -= 4;
		}
		else if (s[i] == 'L')
		{
			r--;
			if (r < 0)
				r += 4;
		}
		else if (s[i] == 'S')
		{
			q++;
			if (r == 0)
			{
				if (a[x + 1][y] == 1)
				{
					cout << q;
					return 0;
				}
				else
				{
					a[x + 1][y] = 1;
					x++;
				}
			}
			else if (r == 1)
			{
				if (a[x][y + 1] == 1)
				{
					cout << q;
					return 0;
				}
				else
				{
					a[x][y + 1] = 1;
					y++;
				}
			}
			else if (r == 2)
			{
				if (a[x - 1][y] == 1)
				{
					cout << q;
					return 0;
				}
				else
				{
					a[x - 1][y] = 1;
					x--;
				}
			}
			else if (r == 3)
			{
				if (a[x][y - 1] == 1)
				{
					cout << q;
					return 0;
				}
				else
				{
					a[x][y - 1] = 1;
					y--;
				}
			}
		}
	}
	cout << -1;
}