-
Notifications
You must be signed in to change notification settings - Fork 0
/
haoyu_jiang_c-scan.py
51 lines (44 loc) · 1.59 KB
/
haoyu_jiang_c-scan.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
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 cscan_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
for request in request_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()
# combine into output list
for request in equal_start:
output_request.append(request)
for request in more_start:
output_request.append(request)
for request in less_start:
output_request.append(request)
print ','.join(map(str, output_request))
# caculate the cost
if len(more_start)==0 and len(less_start)!=0:
cost = (199 - start_point) + 199 + less_start[len(less_start) - 1]
elif len(more_start)!=0 and len(less_start)==0:
cost = (199 - start_point) + 199
elif len(more_start) != 0 and len(less_start) != 0:
cost = (199-start_point) + 199 + less_start[len(less_start)-1]
elif len(more_start) == 0 and len(less_start) == 0:
cost = 0
print cost
cscan_schedule(input_request,start_point)