SRM 532 · 2011-11-22 · by fushar
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | DengklekMakingChains | Greedy | 43.00% | 299 |
| 500 | DengklekBuildingRoads | Dynamic Programming, Graph Theory | 78.00% | 36 |
| 1000 | DengklekCountingFormations | Dynamic Programming, Graph Theory, Math | 75.00% | 57 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | DengklekTryingToSleep | Greedy, Simple Math | 97.00% | 72 |
| 500 | DengklekMakingChains | Greedy | 15.00% | 299 |
| 1000 | DengklekPaintingSquares | Dynamic Programming | 20.00% | 84 |
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.
Sign in to enter a virtual contest.