| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
Hello guys,I was doing this graph theory problem which requires simple bfs.I have few issues with this hope you can help me out.
P.S-I have seen its solution on web and I cannot understand why we are doing bfs from every node?? And summing maximum of red and black everytime.Please see my solution v/s one i found on web.Thank you
Here, what you need to do is divide all the fighters in two groups. So you can color them using black and red. It is obvious that fighters from same group wont fight. So fighters from red group will fight against only with fighters from black group and vice versa. Here, the list of rivals are given. So, if one is from red group then the other will be obviously from the black group. Start coloring them like this using bfs. At the end, you have two separate groups and you still don't know who are vampires and lykans. To know what is the maximum size of any group you just take maximum of red group and black group. That's it.