SRM 803 · 2021-03-30 · by a.poorakhavan, misof
Division I
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | MarriageAndCirclingChallenge | Brute Force, Graph Theory | 77.00% | 36 |
| 500 | MarriageAndSelectionChallenge | Dynamic Programming | 31.00% | 39 |
| 1000 | MarriageAndGamingChallenge | Graph Theory | 100.00% | 22 |
Division II
| Points | Problem | Categories | Success Rate | Cases |
|---|---|---|---|---|
| 250 | MarriageAndTravelingChallenge | Brute Force, Simple Search, Iteration | 95.00% | 12 |
| 500 | MarriageAndChargingChallenge | Brute Force | 60.00% | 40 |
| 1000 | MarriageAndCirclingChallenge | Brute Force, Graph Theory | 45.00% | 36 |
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.