The approach of greedy assigning out-of-order fails in this case:
J1: 0 2 (Assigns to C)
J2: 1 4 (Assigns to J)
J3: 8 10 (Assigns to C)
J4: 3 10 (Now Impossible because C is busy 8-10, and J is busy 3-4.)
However swapping J1 and J2 so that J is busy 0-2 and C is busy 1-4, now J
is free to do
Hi Igor!
Before I go in and debut your code, will you please explain the logic behind
your solution?
> On Apr 9, 2020, at 11:45 AM, Igor Cha wrote:
>
>
> can anyone help out? D:
>
>> On Tuesday, April 7, 2020 at 8:51:58 AM UTC-7, Igor Cha wrote:
>> Hi, I initially approached this using
can anyone help out? D:
On Tuesday, April 7, 2020 at 8:51:58 AM UTC-7, Igor Cha wrote:
>
> Hi, I initially approached this using the same way as in the analysis of
> the problem, but I thought I found a better solution. However, it kept
> giving me WA and I am trying to figure out why. It
