在贝尔州大学的考试期间，学生们依次参加考试。每个学生根据题目难度可能立即失败或花费固定时间完成。如果考试总时长为M分钟，我们需要找出每个学生需要最少多少名学生提前离开，以便他们自己能完成考试。输入包含学生人数和总时长，以及每个学生答题所需时间。输出每个学生所需的最少离开人数。可以通过记录每个时间点出现的频率来解决这个问题。
The only difference between easy and hard versions is constraints.
If you write a solution in Python, then prefer to send it in PyPy to speed up execution time.
A session has begun at Beland State University. Many students are taking exams.
Polygraph Poligrafovich is going to examine a group of ?n students. Students will take the exam one-by-one in order from 11-th to ?n-th. Rules of the exam are following:
- The ?i-th student randomly chooses a ticket.
- if this ticket is too hard to the student, he doesn't answer and goes home immediately (this process is so fast that it's considered no time elapses). This student fails the exam.
- if the student finds the ticket easy, he spends exactly ??ti minutes to pass the exam. After it, he immediately gets a mark and goes home.
Students take the exam in the fixed order, one-by-one, without any interruption. At any moment of time, Polygraph Poligrafovich takes the answer
最低0.47元/天 解锁文章
扫一扫
3287
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
