I'm stuck with this problem and can't figure out how to proceed.Can anyone give me some hints how can i solve it using BPM?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | nor | 157 |
| 4 | atcoder_official | 156 |
| 4 | cry | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 154 |
| 7 | adamant | 154 |
| 9 | Um_nik | 152 |
| 10 | djm03178 | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 01.09.2024 09:36:00 (l2).
Десктопная версия, переключиться на мобильную.
При поддержке
Think of a graph with nodes corresponding to rows on the left and nodes corresponding co columns on the right.
Search about minimum vertex cover on bipartite, König's theorem.
Interesting part of this problem is that you shouldn't output the cardinality of MVC, but you should be able to recover the solution as well. Proof of König's theorem on Wikipedia already provides an efficient algorithm for retrieving that.
Thank you so much!