| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
Problem Link: http://lightoj.com/volume_showproblem.php?problem=1180&language=english&type=pdf
I have read in a blog that this particular problem involves dynamic programming with binary search. Someone kind enough please provide me an explanation on how to solve this problem using the mentioned topics.
I think this should work: let's say you use binary search on the answer; when you have time limit fixed, you are able to know how many subprojects of type A and B the i-th programmer can solve. Then, with the time fixed, you do dp[i][j] — the maximum number of subprojects of type B that can be solved considering the programmers from 1 to i and having solved j subprojects of type A; if dp[n][m] >= m, then it means the fixed time is valid and otherwise it isn't.