Submission #1294443


Source Code Expand

n,k=map(int,raw_input().split())
a=map(int,raw_input().split())
ans=float("inf")
for i in xrange(1<<n):
    cnt=0
    li=[]
    for j in xrange(1,n):
        if i>>j&1:
            cnt+=1
            li.append(j)
    if cnt<k-1:continue
    tmp=0
    h=a[0]
    for j in li:
        for l in xrange(j):
            h=max(h,a[l])
        tmp+=max(h+1-a[j],0)
        h=max(h+1,a[j])
    ans=min(ans,tmp)
print ans

Submission Info

Submission Time
Task B - Buildings are Colorful!
User roto_37
Language Python (2.7.6)
Score 350
Code Size 431 Byte
Status AC
Exec Time 240 ms
Memory 2692 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 120 / 120 90 / 90 140 / 140
Status
AC × 2
AC × 2
AC × 3
AC × 9
Set Name Test Cases
Sample sub0_in1.txt, sub0_in2.txt
Subtask1 sub1_in1.txt, sub1_in2.txt
Subtask2 sub2_in1.txt, sub2_in2.txt, sub2_in3.txt
Subtask3 sub0_in1.txt, sub0_in2.txt, sub1_in1.txt, sub1_in2.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt
Case Name Status Exec Time Memory
sub0_in1.txt AC 11 ms 2692 KB
sub0_in2.txt AC 11 ms 2692 KB
sub1_in1.txt AC 92 ms 2692 KB
sub1_in2.txt AC 93 ms 2692 KB
sub2_in1.txt AC 11 ms 2692 KB
sub2_in2.txt AC 11 ms 2692 KB
sub2_in3.txt AC 11 ms 2692 KB
sub3_in1.txt AC 117 ms 2692 KB
sub3_in2.txt AC 240 ms 2692 KB