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.
My C# algorithm times out for the three last cases.
Is there a way to avoid checking the global connectivity of both T (through T and U) and D (through D and U) each time I assign a U to either T or D?
Separate the chocolate
You are viewing a single comment's thread. Return to all comments →
My C# algorithm times out for the three last cases. Is there a way to avoid checking the global connectivity of both T (through T and U) and D (through D and U) each time I assign a U to either T or D?
Same problem.