Rockethon 2014

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
391 Rockethon 2014 FINISHED False 10800 383832023 Feb. 16, 2014, 6 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 217 ) D2 Supercollider PROGRAMMING data structures

This problem consists of two subproblems: for solving subproblem D1 you will receive 3 points, and for solving subproblem D2 you will receive 16 points. Manao is the chief architect involved in planning a new supercollider. He has to identify a plot of land where the largest possible supercollider can be built. The supercollider he is building requires four-way orthogonal collisions of particles traveling at the same speed, so it will consist of four accelerating chambers and be shaped like a plus sign (i.e., +). Each of the four accelerating chambers must be the same length and must be aligned with the Earth's magnetic field (parallel or orthogonal) to minimize interference. The accelerating chambers need to be laid down across long flat stretches of land to keep costs under control. Thus, Manao has already commissioned a topographical study that has identified all possible maximal length tracts of land available for building accelerating chambers that are either parallel or orthogonal to the Earth's magnetic field. To build the largest possible supercollider, Manao must identify the largest symmetric plus shape from among these candidate tracts. That is, he must find the two tracts of land that form an axis-aligned plus shape with the largest distance from the center of the plus to the tip of the shortest of the four arms of the plus. Note that the collider need not use the entire length of the tracts identified (see the example in the notes). The first line of the input will contain two single-space-separated integers n , the number of north-south tracts and m , the number of west-east tracts. Each of the n lines following the first describes a north-south tract. Each such tract is described by three single-space-separated integers x i , y i , l i representing the vertical line segment from ( x i , y i ) to ( x i , y i + l i ) . Similarly, after the n lines describing north-south tracts follow m similar lines describing the west-east tracts. Each such t

Tutorials

Submissions

No solutions yet.