198712025-12-28 12:43:52marnorlorÚthasználati díj (75 pont)python3Accepted 75/7541ms5080 KiB
def szamolas(N: int, K: int, dij: list):
    varosok=0
    eredmeny=0
    for i in range(0, len(dij)):
        if dij[i]==1:
            varosok=varosok+1
    if varosok==0 or varosok==1:
        return 0
    else:
        for i in range(2, K+1):
            if i>varosok:
                break
            eredmeny=eredmeny+(varosok-(i-1))
    return eredmeny

def test():
    a=szamolas(10, 3, [0, 1, 1, 0, 0, 0, 1, 1, 0, 1])
    assert a==7

    a=szamolas(5, 5, [0, 1, 0, 0, 0])
    assert a==0

    a=szamolas(6, 5, [1, 0, 1, 0, 1, 0])
    print(a)
    assert a==3
    
    a=szamolas(15, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1])
    print(a)
    assert a==50
    
    a=szamolas(2, 2, [1, 1])
    print(a)
    assert a==1


def futtatas():
    N, K=map(int, input().split())
    dij=list(map(int, input().split()))
    a=szamolas(N, K, dij)
    print(a)

#test()
futtatas()
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/016ms3320 KiB
2Accepted0/016ms3308 KiB
3Accepted0/041ms4964 KiB
4Accepted5/517ms3116 KiB
5Accepted5/516ms3180 KiB
6Accepted5/516ms3028 KiB
7Accepted5/516ms3004 KiB
8Accepted5/517ms3124 KiB
9Accepted5/517ms3308 KiB
10Accepted5/517ms3124 KiB
11Accepted5/516ms3312 KiB
12Accepted5/517ms3124 KiB
13Accepted5/517ms3052 KiB
14Accepted5/539ms5004 KiB
15Accepted5/539ms4964 KiB
16Accepted5/537ms5080 KiB
17Accepted5/537ms5012 KiB
18Accepted5/541ms4960 KiB