Submission #1294414


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=1
    li=[0]
    for j in xrange(1,n):
        if i>>j&1:
            cnt+=1
            li.append(j)
    if cnt<k:continue
    tmp=0
    h=a[0]
    for j in xrange(1,len(li)):
        tmp+=max(h+1-a[li[j]],0)
        h=max(h+1,a[li[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 210
Code Size 397 Byte
Status WA
Exec Time 130 ms
Memory 2696 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 120 / 120 90 / 90 0 / 140
Status
AC × 2
AC × 2
AC × 3
AC × 8
WA × 1
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 10 ms 2692 KB
sub0_in2.txt AC 10 ms 2692 KB
sub1_in1.txt AC 92 ms 2692 KB
sub1_in2.txt AC 93 ms 2692 KB
sub2_in1.txt AC 10 ms 2692 KB
sub2_in2.txt AC 10 ms 2696 KB
sub2_in3.txt AC 10 ms 2692 KB
sub3_in1.txt AC 98 ms 2692 KB
sub3_in2.txt WA 130 ms 2692 KB