Submission #198946

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

sortbooks

def MOOD(l, r, W1):
    Mood = []
    w = W1[l - 1:r]
    pl = w.copy()
    pl.sort()
    mood = 0
    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)
    return max(Mood)


nm = input().split(' ')
N, M = int(nm[0]), int(nm[1])
W = input().split(' ')
Task = []
for i in range(M):
    Task.append(input().split(' '))
for i in range(M):
    if MOOD(int(Task[i][0]), int(Task[i][1]), W) <= int(Task[i][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