Submission #1309328

#	Time	Username	Problem	Language	Result	Execution time	Memory
1309328		yyrtc	Rabbit Carrot (LMIO19_triusis)	Pypy 3	100 / 100	244 ms	60516 KiB

triusis

from bisect import bisect_right
n,m=map(int,input().split())

lis=[]

for i in range(n):

    x=int(input())
    x=m*(i+1)-x

    if x<0:
        continue
    
    idx=bisect_right(lis,x)

    if idx==len(lis):
        lis.append(x)
    else:
        lis[idx]=x

print(n-len(lis))

Compilation message (stdout)

Compiling 'triusis.py'...

=======
  adding: __main__.pyc (deflated 23%)

=======

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37