-
Notifications
You must be signed in to change notification settings - Fork 0
/
haoyu_jiang_look.py
92 lines (79 loc) · 3.47 KB
/
haoyu_jiang_look.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
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
import sys
# open system files
f = open(sys.argv[1], 'r')
# set start_point
start_point = int(f.readline())
# set input_request list
input_request = map(int, f.readline().split(','))
f.close()
def look_schedule(request_list,start_point):
output_request = []
more_start=[]
less_start=[]
equal_start = []
cost=[]
# check the request_list
for request in request_list:
if request < 0 or request > 199:
print "the request_list is wrong"
# divide and sort groups in input_list
more_start = [request for request in request_list if request > start_point]
less_start = [request for request in request_list if request < start_point]
equal_start = [request for request in request_list if request == start_point]
more_start.sort()
less_start.sort(reverse=True)
for request in equal_start:
output_request.append(request)
# decide the starting direction , combine into output_list , calculate the cost
if len(more_start) == 0 and len(less_start) == 0:
print ','.join(map(str, output_request))
cost = 0
print cost
elif len(more_start)==0 and len(less_start)!=0:
for request in less_start:
output_request.append(request)
print ','.join(map(str, output_request))
cost = start_point - less_start[len(less_start)-1]
print cost
elif len(more_start)!=0 and len(less_start)==0:
for request in more_start:
output_request.append(request)
print ','.join(map(str, output_request))
cost = more_start[len(more_start)-1] - start_point
print cost
elif len(more_start) != 0 and len(less_start) != 0:
if (more_start[0]-start_point) > (start_point-less_start[0]):
for request in less_start:
output_request.append(request)
for request in more_start:
output_request.append(request)
print ','.join(map(str, output_request))
cost = (start_point - less_start[len(less_start)-1]) + (more_start[len(more_start)-1] - less_start[len(less_start)-1])
print cost
elif (more_start[0]-start_point) < (start_point-less_start[0]):
for request in more_start:
output_request.append(request)
for request in less_start:
output_request.append(request)
print ','.join(map(str, output_request))
cost = (more_start[len(more_start)-1] - start_point) + (more_start[len(more_start)-1] - less_start[len(less_start)-1])
print cost
else:
if start_point <= 99:
for request in less_start:
output_request.append(request)
for request in more_start:
output_request.append(request)
print ','.join(map(str, output_request))
cost = (start_point - less_start[len(less_start) - 1]) + (
more_start[len(more_start) - 1] - less_start[len(less_start) - 1])
print cost
if start_point >= 100:
for request in more_start:
output_request.append(request)
for request in less_start:
output_request.append(request)
print ','.join(map(str, output_request))
cost = (more_start[len(more_start) - 1] - start_point) + (more_start[len(more_start) - 1] - less_start[len(less_start) - 1])
print cost
look_schedule(input_request,start_point)