Submission #1608590


Source Code Expand

from collections import Counter
N,A,B = map(int,input().split())
src = list(map(int,input().split()))
src.sort(reverse=True)

ave = sum(src[:A]) / A
print(ave)

counter = Counter(src)
cnt = counter[src[0]]

ncr = [[1]]
for n in range(1,N+1):
    ncr.append([1])
    for r in range(1,n):
        ncr[n].append(ncr[n-1][r-1] + ncr[n-1][r])
    ncr[n].append(1)

if cnt < A:
    last = src[A-1]
    n = counter[last]
    r = src[:A].count(last)
    print(ncr[n][r])
elif cnt == A:
    print(1)
else:
    ans = 0
    for r in range(A, min(B,cnt)+1):
        ans += ncr[cnt][r]
    print(ans)

Submission Info

Submission Time
Task D - Maximum Average Sets
User prd_xxx
Language Python (3.4.3)
Score 400
Code Size 618 Byte
Status AC
Exec Time 22 ms
Memory 3444 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 20 ms 3316 KB
sample_02.txt AC 20 ms 3316 KB
sample_03.txt AC 20 ms 3316 KB
sample_04.txt AC 20 ms 3316 KB
subtask_1_1.txt AC 20 ms 3316 KB
subtask_1_10.txt AC 21 ms 3316 KB
subtask_1_11.txt AC 20 ms 3316 KB
subtask_1_12.txt AC 21 ms 3316 KB
subtask_1_13.txt AC 20 ms 3316 KB
subtask_1_14.txt AC 21 ms 3316 KB
subtask_1_15.txt AC 20 ms 3316 KB
subtask_1_2.txt AC 20 ms 3316 KB
subtask_1_3.txt AC 20 ms 3316 KB
subtask_1_4.txt AC 22 ms 3444 KB
subtask_1_5.txt AC 20 ms 3316 KB
subtask_1_6.txt AC 21 ms 3316 KB
subtask_1_7.txt AC 21 ms 3316 KB
subtask_1_8.txt AC 21 ms 3316 KB
subtask_1_9.txt AC 20 ms 3316 KB