Gfrktyl

I recently took a Codility test, the objective of the task is to count the number of time an elevator stop. Let us consider the following scenario :

A = [60, 80, 40] is the weight of each person,

B = [2, 3, 5] the floors,

X = 2 (max number of people allowed in the elevator) and 

Y = 200 (max number of weight allowed at a time). 

For this case, the solution would be N = 5, since the elevator took 60 plus 80 to floors number 2 and 3 (2 stops), then came back to 0 (3 stops), it went to 5 (4 stops) and it returned to 0 ( 5 stops).

My codes compiled and it worked with the example cases given during the test. However, I received a very low grade for this task. I will appreciate it if someone can help me figure out the problem with my code. Thanks in advance.

def solution (A, B, M, X, Y):



    original = X

    count = 1

    N = len(A)



    while N > 0:

        if sum(A[:X]) <= Y:

            count = count + len(B[:X]) + 1

            N = N - len(B[:X])

            reVal = A

            reM = A[:X]

            final_list = list(set(reVal).difference(set(reM)))

            A = final_list



            reVal1 = B

            reM1 = A[:X]

            final_list2 = list(set(reVal1).difference(set(reM1)))

            B = final_list2

            X = original

        else:

            X = X - 1

            continue

    return(count)