QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#799235 | #667. Randomized Binary Search Tree | Kazemaru | WA | 0ms | 3932kb | C++17 | 435b | 2024-12-05 08:52:38 | 2024-12-05 08:52:39 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
const int N=5e4;
double f[N],g[N],h[N];
signed main(){
cin>>n;
f(p,1,n){
if(p>50){h[p]=1;continue;}f[0]=1;
f(i,0,n)f(j,0,n-i)g[i+j+1]+=f[i]*f[j];
f(i,0,n)f[i]=g[i]/i,g[i]=0;h[p]=f[n];
}
f(p,1,n)cout<<p<<" ",printf("%.5lf\n",h[p]-h[p-1]);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3932kb
input:
1
output:
1 1.00000
result:
wrong output format Extra information in the output file