TCO20 Round 3B · 2020-04-13 · by misof
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | VisitALot | Graph Theory, Greedy, Simple Math, Simple Search, Iteration | 67.00% | 200 |
| 500 | ShortBugPaths | Dynamic Programming, Graph Theory, Math | 68.00% | 115 |
| 1000 | HorseTicket | Dynamic Programming, Math | 70.00% | 130 |
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.