Perfect Bipartite Matching
How can i find maximum perfect matching in bipartite graph? it can be a a sub-graph of main bipartite graph?
Codeforces Round 946 Solution Discussion