We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Just a very unelegant approach ,the first two graphs are lists so that I can go through them in a for loop which is faster than a for each and the third is a hashset because I need a O(1) contains. Only one testcase times out.The others pass.
Tripartite Matching
You are viewing a single comment's thread. Return to all comments →
Just a very unelegant approach ,the first two graphs are lists so that I can go through them in a for loop which is faster than a for each and the third is a hashset because I need a O(1) contains. Only one testcase times out.The others pass.