JOIN
Get Time
long_comps_topcoder  Problem Statement
Contest: Marathon Match 22
Problem: TrafficTiming

Problem Statement

    

You have just been hired as your city's new traffic control engineer. A city is represented as a grid, where north-south streets run at x = 10, 20, 30, etc, and east-west streets run at y = 10, 20, 30, etc. Points such as (30, 17) and (43, 20) are points along roads, while points such as (30, 40) and (20, 20) are at intersections. At every intersection there is a traffic light. (1, 1) is the northwest corner of the city, while (width, height) is the southeast corner.

Based upon significant research done by your predecessor, you have detailed information about where many cars begin their commute, and the exact path they will take to get to their destination.

Each traffic light is programmed so that a green light faces exactly one of the four cardinal directions at any given moment. Each traffic light will run its own timing sequence, and will loop through that sequence indefinitely. Each sequence can contain up to 20 directions.

You are given the width and height of the city, and a String[] describing the commute path of each car that was studied. Each dimension of the city is congruent to 9 MOD 10. The number of intersections is (width / 10) * (height / 10), using integer division. Thus, a 59 x 49 city would have 5 * 4 = 20 intersections.

The path of each car is given as the starting x,y location and a sequence of moves in one of the four cardinal directions, where each move means to move to the next intersection in that direction. After the final move, the car pulls into a parking garage at the final intersection, and is no longer on the road. For instance, if a path is described as "25,20 ENWS" (quotes for clarity), that means the car started at (25, 20), travelled east to (30, 20), turned left and travelled north to (30, 10), turned left again and travelled west to (20, 10), then turned left once more and travelled south to its final destination of (20, 20).

During each unit of time, a car will attempt to move one unit in the direction it is currently travelling, provided that location is clear of any other car moving in the same direction. (Two cars travelling the same road in opposite directions, however, can occupy the same location.) When about to enter an intersection, a car will only do so if the entire intersection is clear (no cars moving in any direction), and there is a green light for that direction.

The returned String[] should represent the traffic light timing string for each traffic light, starting with the one at (10, 10), and proceeding in row-major order. Each element should be formatted as a sequence of up to 20 'N', 'S', 'E', or 'W' characters, describing the sequence. For instance, the timing "NNEWS" would have a green light for north-bound traffic at time 0 and 1, for east-bound at time 2, for west-bound at time 3, for south-bound at time 4, then repeating starting at time 5.

Your score will be the number of units of time it takes for each car to reach its destination. You solution will be run for a maximum of 1,000 units of time, after which point you will be penalized an additional 50 units of time for each car not yet at its destination. Your total score for a full submission will be the sum of min_score / your_score for each test case, where min_score is the lowest score by any submission for that test case.

Test Case Generation

The width and height of the city will each be chosen as 49, 59, ..., 199 (uniformly at random). For each intersection, a set of proababilities will be chosen, defining the expected behavior of cars reaching that intersection. Five probabilities will be chosen: the probability of a car ending its trip at that intersection, or of continuing one block in any of the four directions. (All points in the 5-simplex are equally likely.) The number of cars will be chosen between 200 and (height * width / 10), inclusive. The path of each car is then generated:

  • A starting point on any road, but not in an intersection, is chosen. If another car is already at that starting location, another location is chosen.
  • An initial direction towards either adjacent intersection is chosen. (If the starting location is near the edge of the board, there may be only one possible initial direction.)
  • The behavior of the car at this intersection is determined based upon the predefined probability for this intersection. (Going off the edge of the city, or making a u-turn are not permitted.) This step repeats until the car finally reaches a destination.

A visualizer is available for this problem.

 

Definition

    
Class:TrafficTiming
Method:setTimings
Parameters:int, int, String[]
Returns:String[]
Method signature:String[] setTimings(int width, int height, String[] carPaths)
(be sure your method is public)
    
 

Notes

-The first few examples have fewer cars than normally allowed, to help facilitate testing.
-There are 100 non-example test cases.
-Each test case is allowed 60 seconds to execute.
-Memory limit is 1GB.
 

Examples

0)
    
width = 139
height = 169
#cars = 1

115,70 W
1)
    
width = 119
height = 149
#cars = 10

41,20 EESSW
10,113 S
90,47 N
49,30 ES
96,90 ENWNWWNENNNW
40,119 SW
25,110 EE
30,103 S
119,30 WWNWWS
100,16 NE
2)
    
width = 179
height = 89
#cars = 30

10,14 S
80,85 NEENN
110,25 NNEEES
84,10 EE
90,12 NE
170,84 NNNN
170,31 N
34,50 WNWWN
22,40 W
24,50 ESS
110,28 NE
93,30 ESENESS
60,73 NW
150,69 NWWSS
54,40 W
160,17 NE
5,50 ENN
99,20 WNE
160,42 NNNES
140,51 N
40,2 S
134,60 WNW
143,50 EEE
74,30 ESE
45,30 W
85,70 ESEE
108,80 ENNNNWSENN
149,40 ENNENW
173,10 WS
10,28 S
3)
    
width = 179
height = 109
#cars = 100

175,40 WNW
38,90 W
110,14 N
110,59 NNW
52,50 ES
29,10 E
170,52 N
56,70 EEEESEEEENNESENEENW
173,20 WSW
46,70 WS
10,78 SS
157,80 EN
80,31 NW
42,50 ENNEN
122,70 WNEENES
70,72 SSSE
78,50 WSWNEENWNWWWS
53,80 EESSW
70,63 NE
78,60 E
100,69 NN
113,40 WW
152,50 W
20,99 NEN
106,70 E
126,40 WWW
30,107 NNNE
142,80 ESWWS
75,30 WWSEE
149,10 E
136,20 ENE
50,93 NNENEESSWSWN
70,78 NEENN
20,74 NWN
120,66 SSENNEN
120,29 SWSW
40,1 S
40,46 S
56,40 EENWSWSS
129,80 ENW
125,60 WN
40,69 NWNEN
60,16 SWWWW
70,79 NWSWSWSW
120,43 SWNEENESWNESSEENNN
70,4 SES
90,68 NNNW
60,108 NWNN
146,40 WSE
38,40 WWNWNN
50,5 SWSS
170,38 SWSWNEN
110,19 N
119,80 W
100,108 NNEEES
114,90 EENN
168,30 WSESWW
46,40 W
145,50 ESES
140,41 S
60,74 N
20,68 SWN
30,74 SEE
125,20 W
70,32 NNN
173,60 WWNWS
60,2 S
80,2 SSSS
123,50 ESE
24,100 EENWN
76,40 EN
146,90 WN
167,80 WN
145,90 ESE
90,96 S
50,31 SSSWSESENEEEE
20,45 S
20,37 NWS
110,54 N
110,77 SWWWSS
120,88 SWSE
30,47 N
80,6 SW
80,99 NE
44,20 WSSW
120,11 NWWSWSENEE
20,107 NW
130,5 SWWSSWNW
34,60 WWW
116,40 WW
120,34 NEEEE
40,48 N
60,11 N
80,72 S
77,100 WWW
13,20 W
170,105 NN
174,40 WNNN
25,100 WWNNEES
92,20 WSES
4)
    
width = 109
height = 49
#cars = 381

5)
    
width = 199
height = 79
#cars = 1032

6)
    
width = 99
height = 179
#cars = 964

7)
    
width = 109
height = 139
#cars = 1141

8)
    
width = 149
height = 69
#cars = 1022

9)
    
width = 89
height = 49
#cars = 353


This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2010, TopCoder, Inc. All rights reserved.