I've been trying to solve this problem from Timus OJ using max flow. Since the constraints are small, it can be brute-forced easily (checking all subsets of teams). Can there be any possible solution using max flow?
→ Обратите внимание
До соревнования
2023 Post World Finals Online ICPC Challenge powered by Huawei
26:35:48
Зарегистрироваться »
2023 Post World Finals Online ICPC Challenge powered by Huawei
26:35:48
Зарегистрироваться »
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 05.05.2024 15:24:14 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
No, this problem is NP hard.
I have had been trying to solve this problem and could not find it's proper solution on internet. I have written a brute force solution which gives me TLE on test case 7. Can you please share your brute force solution ?
Try to get rid of using map for each mask. For instance you can transform every teams to three numbers (before iterations over masks), and then just to use boolean array.