This repository has been archived by the owner on Jul 20, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
night_in_museum.cpp
112 lines (105 loc) · 2.92 KB
/
night_in_museum.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
#include <iostream>
#include <string>
using namespace std;
int main()
{
string word;
cin >> word; //zeus
int counter = 0, steps = 0, decrease_to_alphabet = 96;
int start_point = 0, end_point = 0;
start_point = (int)'a';
end_point = (int)word[0];
if (start_point == end_point)
{
steps = 0;
}
else if (abs(start_point - end_point) == 1)
{
steps = 1;
}
else if (start_point <= 110)
{
if ((end_point > 110 && start_point > 110) || (end_point <= 110 && start_point <= 110))
{
steps = abs((end_point - decrease_to_alphabet) - (start_point - decrease_to_alphabet));
}
else
{
steps = 26 - abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet));
}
}
else
{
if (end_point < start_point)
{
if ((end_point > 110 && start_point > 110) || (end_point <= 110 && start_point <= 110))
{
steps = abs((end_point - decrease_to_alphabet) - (start_point - decrease_to_alphabet));
}
else
{
steps = 26 - abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet));
}
}
else
{
steps = (end_point - decrease_to_alphabet) - (start_point - decrease_to_alphabet);
}
}
counter += steps;
for (int i = 1; i < word.length(); i++)
{
start_point = (int)word[i-1];
end_point = (int)word[i];
if (start_point == end_point)
{
steps = 0;
}
else if (abs(start_point - end_point) == 1)
{
steps = 1;
}
else if (start_point <= 110)
{
if ((end_point > 110 && start_point > 110) || (end_point <= 110 && start_point <= 110))
{
steps = abs((end_point - decrease_to_alphabet) - (start_point - decrease_to_alphabet));
}
else if (abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet)) <
26 - abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet)))
{
steps = abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet));
}
else
{
steps = 26 - abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet));
}
}
else
{
if (end_point < start_point)
{
if ((end_point > 110 && start_point > 110) || (end_point <= 110 && start_point <= 110))
{
steps = abs((end_point - decrease_to_alphabet) - (start_point - decrease_to_alphabet));
}
else if (abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet)) <
26 - abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet)))
{
steps = abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet));
}
else
{
steps = 26 - abs((start_point - decrease_to_alphabet) - (end_point - decrease_to_alphabet));
}
}
else
{
steps = (end_point - decrease_to_alphabet) - (start_point - decrease_to_alphabet);
}
}
counter += steps;
}
cout << counter << endl;
return 0;
}