Codeforces 262D Maxim and Restaurant
来源:互联网 发布:windows 10 截图 编辑:程序博客网 时间:2024/05/13 19:18
Maxim has opened his own restaurant! The restaurant has got a huge table, the table's length is p meters.
Maxim has got a dinner party tonight, n guests will come to him. Let's index the guests of Maxim's restaurant from 1 to n. Maxim knows the sizes of all guests that are going to come to him. The i-th guest's size (ai) represents the number of meters the guest is going to take up if he sits at the restaurant table.
Long before the dinner, the guests line up in a queue in front of the restaurant in some order. Then Maxim lets the guests in, one by one. Maxim stops letting the guests in when there is no place at the restaurant table for another guest in the queue. There is no place at the restaurant table for another guest in the queue, if the sum of sizes of all guests in the restaurant plus the size of this guest from the queue is larger than p. In this case, not to offend the guest who has no place at the table, Maxim doesn't let any other guest in the restaurant, even if one of the following guests in the queue would have fit in at the table.
Maxim is now wondering, what is the average number of visitors who have come to the restaurant for all possible n! orders of guests in the queue. Help Maxim, calculate this number.
The first line contains integer n (1 ≤ n ≤ 50) — the number of guests in the restaurant. The next line contains integers a1, a2, ..., an (1 ≤ ai ≤ 50) — the guests' sizes in meters. The third line contains integer p (1 ≤ p ≤ 50) — the table's length in meters.
The numbers in the lines are separated by single spaces.
In a single line print a real number — the answer to the problem. The answer will be considered correct, if the absolute or relative error doesn't exceed 10 - 4.
31 2 33
1.3333333333
In the first sample the people will come in the following orders:
- (1, 2, 3) — there will be two people in the restaurant;
- (1, 3, 2) — there will be one person in the restaurant;
- (2, 1, 3) — there will be two people in the restaurant;
- (2, 3, 1) — there will be one person in the restaurant;
- (3, 1, 2) — there will be one person in the restaurant;
- (3, 2, 1) — there will be one person in the restaurant.
In total we get (2 + 1 + 2 + 1 + 1 + 1) / 6 = 8 / 6 = 1.(3).
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <cmath>#include <string>#include <sstream>#include <vector>#include <queue>#include <set>#include <map>#include <ctime>#define MAXN 1000 #define offset 10000 #define eps 1e-11 #define PI acos(-1.0)//3.14159265358979323846 #define exp 2.718281828#define mod 1000000007using namespace std;typedef long long LL;double fac[55],f[55][55][55];int a[55];int main(){fac[0] = 1;for(int i = 1;i<=54;i++){fac[i] = fac[i-1] * i;}int n;scanf("%d",&n);int sum = 0;for(int i = 1;i<=n;i++){scanf("%d",&a[i]);sum += a[i];}int p;scanf("%d",&p);if(sum <= p){printf("%d\n",n);}else{for(int i = 1;i<=n;i++){f[0][0][i] = 1;}for(int i = 1;i<=n;i++){for(int j = 1;j<=n;j++){if(i != j){for(int k = n;k>=1;k--){for(int x = p;x>=0&&x>=a[i];x--){f[x][k][j] += f[x-a[i]][k-1][j];}}}}}double ans = 0;for(int i = 1;i<=n;i++){if(a[i] > p){a[i] = p+1; }for(int x = p+1-a[i];x<=p;x++){for(int k = 1;k<=n;k++){ans += f[x][k][i]*fac[k]*fac[n-k-1]*k;}}}//printf("%.7lf\n",ans);ans /= fac[n];printf("%.7lf\n",ans);}return 0;}
- Codeforces 262D Maxim and Restaurant
- BNU28000 Maxim and Restaurant
- CodeForces 261B Maxim and Restaurant [数学+基础DP]
- Codeforces 721D Maxim and Array[贪心]
- codeforces 721D Maxim and Array(贪心)
- 721D Maxim and Array codeforces(模拟)
- 【24.17%】【codeforces 721D】Maxim and Array
- codeforces 721D D. Maxim and Array (STL||优先队列)
- Codeforces Round #160 (Div. 1), problem: (B) Maxim and Restaurant DP+组合数学
- Codeforces Round #374 (Div. 2) D - Maxim and Array
- Codeforces Round #374 (Div. 2) D. Maxim and Array
- codeforces 721D. Maxim and Array(贪心)
- Codeforces Round #374 (Div. 2)D. Maxim and Array(贪心)
- Codeforces Round 374 (Div 2)D Maxim and Array 【贪心】
- CodeForces 721D. Maxim and Array(贪心,思维题)
- Codeforces Round #374 (Div. 2) D. Maxim and Array
- Codeforces Round #374 (Div. 2) D. Maxim and Array 贪心
- Codeforces Round #374 (Div. 2) D. Maxim and Array 贪心
- poj1852求蚂蚁的最长最短时间、
- 部分和问题
- Apache Avro 入门
- 安装nodejs hexo 在阿里云服务器上
- HTML学习笔记(jQuery)NO.6
- Codeforces 262D Maxim and Restaurant
- Python实例浅谈之一标识符检查
- 硬币问题 又贪心(每个面值都有数量限制)
- CRACK - PPTP VPN
- 有穷自动机的相关概念
- android 语音识别 之 讯飞语音移植
- Qt4升级Qt5问题总汇
- POJ 1654 Area(计算几何)
- NSData知识