README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

1820. Maximum Number of Accepted Invitations (Medium)

Related Topics

[Array] [Backtracking] [Matrix]

Hints

Hint 1

We can see that the problem can be represented as a directed graph with an edge from each boy to the girl he invited.

Hint 2

We need to choose a set of edges such that no to source points in the graph (i.e., boys) have an edge with the same endpoint (i.e., the same girl).

Hint 3

The problem is maximum bipartite matching in the graph.