Submission #11676159


Source Code Expand

from collections import Counter
import math
def nCr(n, r):
    if n < r:
        return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

n, a, b = map(int, input().split())

values = [int(i) for i in input().split()]
values.sort(reverse=True)

MAX = sum(values[:a]) / a
print(MAX)
e = a + 1
use_nums = []
for i in range(a, b + 1):
    v = sum(values[:i]) / i
    if v == MAX:
        use_nums.append(Counter(values[:i]))

cd = Counter(values)
ans = 0
for nums in use_nums:
    t = 1
    for k, v in nums.items():
        m = cd.get(k)
        t = t * nCr(m, v)
    ans += t
print(ans)

Submission Info

Submission Time
Task D - Maximum Average Sets
User tiruka
Language PyPy3 (2.4.0)
Score 400
Code Size 643 Byte
Status AC
Exec Time 171 ms
Memory 39280 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 166 ms 38768 KB
sample_02.txt AC 161 ms 38384 KB
sample_03.txt AC 161 ms 38256 KB
sample_04.txt AC 171 ms 39280 KB
subtask_1_1.txt AC 162 ms 38256 KB
subtask_1_10.txt AC 160 ms 38256 KB
subtask_1_11.txt AC 166 ms 38768 KB
subtask_1_12.txt AC 164 ms 38640 KB
subtask_1_13.txt AC 161 ms 38256 KB
subtask_1_14.txt AC 164 ms 38256 KB
subtask_1_15.txt AC 161 ms 38256 KB
subtask_1_2.txt AC 160 ms 38256 KB
subtask_1_3.txt AC 160 ms 38256 KB
subtask_1_4.txt AC 161 ms 38256 KB
subtask_1_5.txt AC 162 ms 38512 KB
subtask_1_6.txt AC 165 ms 38256 KB
subtask_1_7.txt AC 163 ms 38256 KB
subtask_1_8.txt AC 162 ms 38256 KB
subtask_1_9.txt AC 161 ms 38256 KB