SRM 692 · 2016-06-04 · by Xellos0
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | HardProof | Graph Theory, Search | 60.00% | 102 |
| 500 | LinenCenter | Dynamic Programming, String Parsing | 81.00% | 47 |
| 1000 | TreeSums | Graph Theory | 83.00% | 51 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | PriorityQueue | Brute Force | 95.00% | 37 |
| 500 | Dubs | Brute Force | 46.00% | 56 |
| 1000 | LinenCenterEasy | Dynamic Programming, String Parsing | 0.00% | 50 |
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.