SRM 492 · 2010-03-12 · by dolphinigle
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | TimeTravellingGardener | Brute Force, Geometry, Greedy | 78.00% | 273 |
| 500 | TimeTravellingTour | Dynamic Programming, Graph Theory | 55.00% | 243 |
| 1000 | TimeTravellingGogo | Graph Theory | 10.00% | 124 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | TimeTravellingCellar | Brute Force, Simulation | 63.00% | 334 |
| 500 | TimeTravellingGardener | Brute Force, Geometry, Greedy | 39.00% | 273 |
| 1000 | TimeTravellingSalesman | Graph Theory | 49.00% | 199 |
Virtual Contest
Rerun this round against its original field. TopCoder scoring, 75-minute coding phase, and the real competitors replayed as ghosts on the scoreboard.
A division runs one field at a time and starts on the quarter hour, so entering puts you in the next slot — at most fifteen minutes away — alongside everyone else who signs up before the gun.
Sign in to enter a virtual contest.