-
Notifications
You must be signed in to change notification settings - Fork 0
/
task_5.py
63 lines (48 loc) · 1.39 KB
/
task_5.py
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
from argparse import ArgumentParser
def parse_args():
parser = ArgumentParser(description="Calculate minimal loader's fee.")
parser.add_argument("-m", "--height",
type=int,
required=True,
action="store",
help=" house height")
parser.add_argument("-n", "--floor",
type=int,
required=True,
action="store",
help=" target floor")
parser.add_argument("-k",
type=int,
required=True,
action="store",
help=" floors available for elevator")
return parser.parse_args()
def bin_search_upper(x, arr):
l = 0
r = len(arr) - 1
i = 0
while l + 1 < r:
m = (r + l) // 2
if arr[m] == x:
return arr[m]
elif arr[m] > x:
r = m
else:
l = m
i += 1
return arr[r]
def count_fee(m, n, k):
UP = 200
DOWN = 100
k_floors = list(range(1, m, k))
k_upper = bin_search_upper(n, k_floors)
fee = min([abs(n - k_upper - k) * UP, (k_upper - n) * DOWN])
return fee
def main():
args = parse_args()
m = args.height
n = args.floor
k = args.k
print(count_fee(m, n, k))
if __name__ == "__main__":
main()