SRM 779 · 2020-02-20 · by lazy_fox, misof
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | ArraySorting | Dynamic Programming, Recursion, Sorting | 73.00% | 57 |
| 500 | SubstringQueries | String Manipulation | 36.00% | 136 |
| 1000 | ParadePlanner | Dynamic Programming, Graph Theory, Math | 72.00% | 51 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | OperateString | Brute Force | 71.00% | 29 |
| 500 | OneGcd | Math | 47.00% | 31 |
| 1000 | ArraySorting | Dynamic Programming, Recursion, Sorting | 32.00% | 57 |
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.