codeforces 261B
4121 단어 codeforcesBaoge
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
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.
Sample test(s)
input
3
1 2 3
3
output
1.3333333333
Note
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).
신 dp 아
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
double f[55][55][55];//f[i][j][k],j people sum is i ,k the next
int n,a[55],p;
double sum,c[55];
int main()
{
c[0]=1;
for(int i=1; i<=50; i++)c[i]=c[i-1]*i;
while(scanf("%d",&n)!=EOF)
{
memset(f,0,sizeof(f));
sum=0;
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
sum+=a[i];
f[0][0][i]=1;
}
scanf("%d",&p);
if(sum<=p)
{
cout<<n<<endl;
continue;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(j!=i)
{
for(int g=n; g>=1; g--)
{
for(int k=p; k>=a[i]; k--)
{
f[k][g][j]+=f[k-a[i]][g-1][j];
}
}
}
}
}
sum=0;
for(int i=1; i<=n; i++)
{
for(int g=1; g<=n; g++)
{
if(a[i]>p)a[i]=p+1;
for(int j=p-a[i]+1; j<=p; j++)
sum+=f[j][g][i]*c[g]*c[n-g-1]*g;
}
}
sum/=c[n];
printf("%.9f
",sum);
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
Codeforces Round #715 Div. 2C The Sports Festival: 구간 DP전형구간 DP의 초전형. 이하, 0-indexed. 입력을 정렬하여 어디서나 시작하고 최적으로 좌우로 계속 유지하면 좋다는 것을 알 수 있습니다. {2000})$의 주문이 된다. 우선, 입력을 소트하여 n개의 요소를 $...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.