Submission #198950

#	Time	Username	Problem	Language	Result	Execution time	Memory
198950		David	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	Cpython 3	0 / 100	30 ms	3424 KiB

sortbooks

def MOOD(l, r, W2):
    Mood = []
    w = W2[l - 1:r]
    pl = w.copy()
    pl.sort()
    for i in range(0, r + 1 - l):
        if i == pl.index(w[i]):
            continue
        else:
            mood = max(w[i:w.index(pl[i])]) + pl[i]
            w.insert(i, w.pop(w.index(pl[i])))
            Mood.append(mood)
        if max(Mood) is None:
            return 0
        elif Mood:
            return max(Mood)
        else:
            return 0


N, M = random.randint(1, 500), random.randint(1, 500)
W = [random.randint(1, 1000000000) for k in range(N)]
Task = []
for k in range(M):
    r1 = random.randint(1, N)
    l1 = random.randint(1, r1)
    Task.append((l1, r1, random.randint(1, 2000000000)))
for m in range(M):
    if int(MOOD(Task[m][0], Task[m][1], W)) <= Task[m][2]:
        print(1)
    else:
        print(0)

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23