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.
The problem asks for any valid completion of the graph. I'm able to compute the minimum-difference and the set of K edges correctly. However, the edges that I choose to add are not the same as the output (correct nonetheless). Is there a criteria?
Does the output here cover all possible ways to add edges?
I am getting WA, but my graphs are equivalent to the ones in the solution.
Black and White Tree
You are viewing a single comment's thread. Return to all comments →
The problem asks for any valid completion of the graph. I'm able to compute the minimum-difference and the set of K edges correctly. However, the edges that I choose to add are not the same as the output (correct nonetheless). Is there a criteria? Does the output here cover all possible ways to add edges? I am getting WA, but my graphs are equivalent to the ones in the solution.