Maximum Independent Set

[matheusdallrosa]

How to indentify this kind of problem?

In this problem: 12083 - Guardian of Decency

I solved it because i had the spoiler on the competitive programming 3, the book says that we need to do the exactly the opposite of what the problem asks and them print V - MCBM.

I want to know if the independent set is the point of the problem when we have edges between the two sets of the bipartite graph.

On this problem: https://www.urionlinejudge.com.br/judge ... /view/1489 this is not true.
I tried to do the same method as the problem Guardian of decency but got i WA.