Submission #3224117


Source Code Expand

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def nCr(n: int, r: int):
    dp = [0] * (n + 1)
    for i in range(n + 1):
        pre = 1
        for j in range(i + 1):
            if j == 0 or j == i:
                dp[j] = 1
            else:
                temp, dp[j] = dp[j], dp[j] + pre
                pre = temp

    return dp[r]


def main():
    N, A, B = map(int, input().split())
    V = list(sorted(list(map(int, input().split())), reverse=True))

    use = V[:A]

    c1 = Counter(V)
    c2 = Counter(use)
    ave = sum(use) / A
    print("{0:.7f}".format(ave))

    if len(set(use)) == 1:
        ans = 0
        num = c1[use[0]]
        for n in range(A, min(B, num) + 1):
            ans += nCr(num, n)
        print(ans)

    else:
        num_total = c1[V[A]]
        num_use = c2[V[A]]
        print(nCr(num_total, num_use))


if __name__ == '__main__':
    main()

Submission Info

Submission Time
Task D - Maximum Average Sets
User MitI_7
Language Python (3.4.3)
Score 400
Code Size 1542 Byte
Status AC
Exec Time 38 ms
Memory 3956 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 27 ms 3948 KB
sample_02.txt AC 27 ms 3952 KB
sample_03.txt AC 27 ms 3956 KB
sample_04.txt AC 38 ms 3948 KB
subtask_1_1.txt AC 27 ms 3948 KB
subtask_1_10.txt AC 27 ms 3956 KB
subtask_1_11.txt AC 31 ms 3956 KB
subtask_1_12.txt AC 30 ms 3956 KB
subtask_1_13.txt AC 27 ms 3948 KB
subtask_1_14.txt AC 27 ms 3952 KB
subtask_1_15.txt AC 27 ms 3952 KB
subtask_1_2.txt AC 27 ms 3948 KB
subtask_1_3.txt AC 27 ms 3948 KB
subtask_1_4.txt AC 27 ms 3948 KB
subtask_1_5.txt AC 27 ms 3948 KB
subtask_1_6.txt AC 27 ms 3948 KB
subtask_1_7.txt AC 27 ms 3948 KB
subtask_1_8.txt AC 27 ms 3948 KB
subtask_1_9.txt AC 27 ms 3948 KB