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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
| from math import ceil
from helpers import IO
from typing import Dict, List
class Task:
def __init__(self, duration: int, num_intersections: int, num_streets: int, num_cars: int, bonus: int):
self.duration = duration
self.num_intersections = num_intersections
self.num_streets = num_streets
self.num_cars = num_cars
self.bonus = bonus
self.all_streets: Dict[str, Street] = dict()
self.all_intersections: List[Intersection] = [Intersection(i) for i in range(num_intersections)]
self.all_cars: List[Car] = []
class Street:
def __init__(self, begin: int, end: int, name: str, length: int):
self.begin = begin
self.end = end
self.name = name
self.length = length
task.all_intersections[end].incoming.append(self.name)
self.cars: List[Car] = []
self.greenCarCounts = 0
def __repr__(self):
return f"S {self.name}: {self.length}"
class Intersection:
def __init__(self, index: int):
self.index = index
self.incoming: List[str] = []
def __repr__(self):
return f"I {self.index}: {self.incoming}"
class Car:
def __init__(self, index: int, number: int, streets: List[str]):
self.index = index
self.number = number
self.streets = streets
self.length = sum([task.all_streets[street].length for street in streets])
self.reached = True
self.passingstreet = streets[0]
self.passedstreet = 0
self.reachedstreet = None
def __repr__(self):
return f"C {self.index}: {self.length}"
"""def status_update(self):
self.currentlength + +
if self.currentlength == self.passingroad.length:
self.reached = True
self.passedstreet + +
self.reachedstreet = self.passingstreet
self.passingstreet = self.streets[self.passedstreet]
else:
self.reached = False
self.reachedstreet = None"""
def main():
code_io = IO()
listName = ['a', 'b', 'c', 'd', 'e', 'f']
for filename in listName:
code_io.set_file_in("./tasks/"+filename+".txt")
code_io.set_file_out("./results/"+filename+".txt")
global task
D, I, S, V, F = code_io.readline_tuple(int)
task = Task(D, I, S, V, F)
for _ in range(S):
B, E, Name, L = code_io.readline_tuple(str)
task.all_streets[Name] = Street(int(B), int(E), Name, int(L))
for i in range(V):
Line = code_io.readline_array(str)
task.all_cars.append(Car(i, int(Line[0]), Line[1:]))
arr = sorted(task.all_cars, key=lambda car: car.length)
"""
for intersection in task.all_intersections:
greencarlist = [0]*len(intersection.incoming)
for i in range(D):
for cars in task.all_cars:
cars.update_status()
if cars.reachedstreet in intersection.incoming:
if arr.index(cars) < greenCar:
greenCar = arr.index(cars)
for street in intersection.incoming:
if street.name==arr[greenCar].reachedstreet:
greencarlist[intersection.index(street)]+=1
sum(greencarlist)"""
counter = 0
for cars in arr:
for street in cars.streets:
task.all_streets[street].greenCarCounts += 1
counter += task.all_streets[street].length
if counter > task.duration:
break
code_io.write(len(task.all_intersections))
for intersection in task.all_intersections:
code_io.write(intersection.index)
code_io.write(len(intersection.incoming))
ratio = sum([task.all_streets[street].greenCarCounts for street in intersection.incoming]) / task.duration
for street in intersection.incoming:
if (int(ceil(task.all_streets[street].greenCarCounts * ratio))) > task.duration:
code_io.write(street + " " + str(task.duration))
else:
code_io.write(street + " " + str(1 + int(ceil(task.all_streets[street].greenCarCounts * ratio))))
code_io.flush()
if __name__ == '__main__':
main()
"""
This is the algo
for time in range(totaltime):
for cars in all_cars:
cars.update_status()
for intersection in all_intersections:
for all cars waiting at this intersection:
turn the green light for the car with the smallest index in the array to green
record the green light change for this intersection ID
def update_status:
current_road+=1
if current_road==crossingroad.length():
waiting=crossingroad
current_road=0
def cost():
return (length of remaining route + remaining intersection * itsweight
"""
|
wechat
alipay
