SRM 693 · 2016-06-04 · by jcvb
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | BiconnectedDiv1 | Dynamic Programming, Graph Theory, Greedy | 67.00% | 147 |
| 500 | BipartiteConstruction | Graph Theory | 52.00% | 50 |
| 1000 | TriangleFree | Dynamic Programming, Graph Theory | 42.00% | 109 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | TriangleEasy | Graph Theory, Greedy | 68.00% | 103 |
| 500 | BiconnectedDiv2 | Graph Theory, Greedy | 44.00% | 141 |
| 1000 | TreeAndCycle | Dynamic Programming, Graph Theory | 0.00% | 112 |
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.