Hi everyone, so I found this problem today, and it seems like a really obvious bipartite matching, but I've been getting TLE in it. Is there some faster way to solve it?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | jiangly | 3578 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | tourist | 3565 |
| 8 | maroonrk | 3531 |
| 9 | Radewoosh | 3521 |
| 10 | Um_nik | 3482 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 28.04.2024 12:49:22 (j1).
Десктопная версия, переключиться на мобильную.
При поддержке
O(VE) bipartite matching algorithm obviously gets TLE on dense graph with such limits. I think solution which runs in O(sqrt(v) * E) will pass. For example you can use "Hopcroft–Karp algorithm".
Sorry, forgot to say I used Hopcroft-Karp.
Strange... Show your code, maybe i can help. Solution with O(N ^ 2.376) exists, but i think Hopcroft-Karp must pass.
Here it is: http://pastebin.com/3RH9u4SN
Your algorithm works in O(VE) time and it isn't Hopcroft-Karp. Just try this testcase: 500 500
2 2 2 2 2 ... (500 times)
2 2 2 2 2 ... (500 times)
Copy this a few times and then add "0 0". Your algorithm will work more then 5 seconds (and will get TLE).
Thanks, I found the mistake, I was using the || operator instead of |= when updating the variable change. With this change it still isn't Hopcroft karp because i'm not taking shortest paths, but that only makes it a bit slower.
Dinnic works here, my solution accepted in 4.86 seconds.