| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | Proof_by_QED | 131 |
Я так понял, тем, кто уже прошел в Round 2, зарегистрироваться нельзя. У меня при регистрации пишет "Registration in this competition is by invitation only".
Hints for solving 500 Pointer Problem please????
You can use a dp or a greedy solution. Let me know if you need more hints?
Describe please both of them
In DP state, keep record for :
1. current day
2. the person who worked on the previous day
3. the person worked the day before the previous day
4. days for which Alice has already worked
5. days for which Bob has already worked
You do not need the days for which the third person has worked since that is fixed and dependent on point 1,4,5.
Now for each day try assigning the work to all the three people, if possible, and pick the one which gives a possible solution.