Ra1nWarden / Online-Judges

My solutions to various online judge problems.
0 stars 0 forks source link

11419 TLE (How to find exact elements in minimum vertex cover on bipartite graph) #20

Closed Ra1nWarden closed 9 years ago

Ra1nWarden commented 9 years ago

Not a tough problem but the input seems very large 1.3 MB Spent a lot of time reading minimum vertex cover. The number of elements in the minimum vertex cover set is the same as maxflow but to find the specifics. Look at http://blog.sina.com.cn/s/blog_51cea4040100h152.html