• + 1 comment

    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?