CF28C.Bath Queue

提高+/省选-

通过率:0%

时间限制:2.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

There are n students living in the campus. Every morning all students wake up at the same time and go to wash. There are m rooms with wash basins. The i-th of these rooms contains a__i wash basins. Every student independently select one the rooms with equal probability and goes to it. After all students selected their rooms, students in each room divide into queues by the number of wash basins so that the size of the largest queue is the least possible. Calculate the expected value of the size of the largest queue among all rooms.

校园里有 nn 名学生。每天早晨,所有学生同时醒来并去洗漱。 campus 里有 mm 个配备洗手池的房间,其中第 ii 个房间有 aia_i 个洗手池。每名学生独立地、以相等的概率随机选择一个房间前往。在所有学生都选定房间后,每个房间内的学生会根据该房间的洗手池数量排成若干队列,使得该房间内最长队列的长度尽可能小。请计算所有房间中最长队列长度的期望值。

输入格式

The first line contains two positive integers n and m (1 ≤ n, m ≤ 50) — the amount of students and the amount of rooms. The second line contains m integers _a_1, _a_2, ... , a__m (1 ≤ a__i ≤ 50). a__i means the amount of wash basins in the i-th room.

第一行包含两个正整数 nn 和 mm(1 ≤ n, m ≤ 501 \leq n, m \leq 50)—— 分别表示学生的数量和房间的数量。
第二行包含 mm 个整数 a1, a2, …, ama_1, a_2, \ldots, a_m(1 ≤ ai ≤ 501 \leq a_i \leq 50)。其中 aia_i 表示第 ii 个房间中的洗手池数量。

输出格式

Output single number: the expected value of the size of the largest queue. Your answer must have an absolute or relative error less than 10 - 9.

输出一个数字:最大队列长度的期望值。你的答案的绝对或相对误差必须小于 10−910^{-9}。

输入输出样例

  • 输入#1

    1 1
    2

    输出#1

    1.00000000000000000000
  • 输入#2

    2 2
    1 1

    输出#2

    1.50000000000000000000
  • 输入#3

    2 3
    1 1 1

    输出#3

    1.33333333333333350000
  • 输入#4

    7 5
    1 1 2 3 1

    输出#4

    2.50216960000000070000

输入解题思路,AI测评打分。不知道怎么写?

首页