SRM 795 · 2020-12-11 · by jy_25, majk, misof
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | AtLeastKDays | Dynamic Programming, Graph Theory | 69.00% | 144 |
| 500 | NRooksPosition | Greedy, Sorting | 58.00% | 88 |
| 1000 | DiscountedShortestPaths | Graph Theory, Greedy | 7.00% | 59 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | DivideLoot | Greedy, Simple Math, Simple Search, Iteration, Sorting | 58.00% | 119 |
| 500 | VertexMove | Geometry | 85.00% | 17 |
| 1000 | AtLeastKDays | Dynamic Programming, Graph Theory | 25.00% | 144 |
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.