QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#601959#9300. So Many Possibilities...WrongAnswer_90WA 1ms8068kbC++176.1kb2024-09-30 16:47:262024-09-30 16:47:27

Judging History

你现在查看的是最新测评结果

  • [2024-09-30 16:47:27]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:8068kb
  • [2024-09-30 16:47:26]
  • 提交

answer

#include<bits/stdc++.h>
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define ll long long
#define lll __int128
#define fi first
#define se second
#define e emplace
#define eb emplace_back
#define db double
#define ef emplace_front
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vp vector<pii>
#define vt vector<tup>
#define all(x) x.begin(),x.end()
#define mp make_pair

#define FastI
#define FastO
#define int ll
bool ST;
static const ll MOD=998244353,Phi=998244352,inv2=499122177,Root=3,iRoot=332748118;
static const ll inf=1073741823,Inf=4294967296,INF=4557430888798830399;
static const ld eps=1e-9,pi=3.1415926535;
char in[1<<20],*p1=in,*p2=in;
char out[1<<20],*p3=out;
using namespace std;
struct tup
{
	int x,y,z;
	tup(int X=0,int Y=0,int Z=0)
	{x=X,y=Y,z=Z;}
};
#ifdef FastI
#define getchar() (p1==p2&&(p2=(p1=in)+fread(in,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#endif
#ifdef FastO
#define putchar(x) (p3-out==1<<20?fwrite(out,1,1<<20,stdout),p3=out,0:0,*p3++=x)
#define puts(x) write(x,'\n')
#endif
namespace FastIO
{
	template<typename T> inline void write(T x,char ch=' ')
	{
		if(is_same<char,T>::value)putchar(x);
		else
		{
			if(x<0)x=-x,putchar('-');
			static char st[25];
			int top=0;
			do st[top++]=x%10+'0',x/=10;while(x);
			while(top)putchar(st[--top]);
		}
		ch!='~'?putchar(ch):0;
	}
	inline void write(const char*x,char ch=' ')
	{
		for(int i=0;x[i]!='\0';++i)putchar(x[i]);
		ch!='~'?putchar(ch):0;
	}
	inline void read(char&s){do s=getchar();while(s=='\n'||s==' ');}
	inline void read(char s[])
	{
		int len=0;char st;
		do st=getchar();while(st=='\n'||st==' ');
		s[++len]=st,st=getchar();
		while(st!='\n'&&st!=' ')s[++len]=st,st=getchar();
		s[++len]='\0';
	}
	template<typename T> inline void read(T &s)
	{
		char ch=getchar();s=0;
		while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
		bool tf=(ch=='-'&&(ch=getchar()));
		while(ch>='0'&&ch<='9')s=(s<<1)+(s<<3)+ch-'0',ch=getchar();
		s=tf?-s:s;
	}
	inline void edl(){putchar('\n');}
	template<typename T1,typename T2> inline void read(pair<T1,T2> &s){read(s.fi),read(s.se);}
	template<typename T,typename...Args> inline void write(T x,Args...args){write(x,'~'),write(args...);}
	template<typename T,typename...Args> inline void read(T&x,Args&...args){read(x),read(args...);}
	#ifdef FastO
	struct Writer{~Writer(){fwrite(out,1,p3-out,stdout);}}Writ;
	#endif
}
using namespace FastIO;
namespace MTool
{
	inline int Cadd(int a,int b){return (ll)a+b>=MOD?(ll)a+b-MOD:a+b;}
	inline int Cdel(int a,int b){return a-b<0?a-b+MOD:a-b;}
	inline int Cmul(int a,int b){return 1ll*a*b%MOD;}
	inline int sqr(int a){return 1ll*a*a%MOD;}
	inline void Madd(int&a,int b){a=((ll)a+b>=MOD?(ll)a+b-MOD:a+b);}
	inline void Mdel(int&a,int b){a=(a-b<0?a-b+MOD:a-b);}
	inline void Mmul(int&a,int b){a=1ll*a*b%MOD;}
	inline int Cmod(int x){return (x%MOD+MOD)%MOD;}
	inline void Mmod(int&x){x=(x%MOD+MOD)%MOD;}
	template<typename T> inline bool Mmax(T&a,T b){return a<b?a=b,1:0;}
	template<typename T> inline bool Mmin(T&a,T b){return a>b?a=b,1:0;}
	template<typename...Args> inline void Madd(int&a,int b,Args...args){Madd(a,b),Madd(a,args...);}
	template<typename...Args> inline void Mmul(int&a,int b,Args...args){Mmul(a,b),Mmul(a,args...);}
	template<typename...Args> inline void Mdel(int&a,int b,Args...args){Mdel(a,b),Mdel(a,args...);}
	template<typename...Args> inline int Cadd(int a,int b,Args...args){return Cadd(Cadd(a,b),args...);}
	template<typename...Args> inline int Cmul(int a,int b,Args...args){return Cmul(Cmul(a,b),args...);}
	template<typename...Args> inline int Cdel(int a,int b,Args...args){return Cdel(Cdel(a,b),args...);}
	template<typename...Args,typename T> inline bool Mmax(T&a,T b,Args...args){return Mmax(a,b)|Mmax(a,args...);}
	template<typename...Args,typename T> inline bool Mmin(T&a,T b,Args...args){return Mmin(a,b)|Mmin(a,args...);}
	inline int power(int x,int y){int s=1;for(;y;y>>=1,Mmul(x,x))if(y&1)Mmul(s,x);return s;}
}
using namespace MTool;
namespace WrongAnswer_90
{
	ld f[1<<15][110],iv[110][110],iiv[110][110];
	ld ans,C[110][110],g[2][110],pw[110][110];
	ld tmp[1<<15][110];
	ld fr[110];
	int S[1<<15];
	ld val[1<<15];
	int n,m,a[15];
	int now,pre;
	inline void mian()
	{
		read(n,m);
		C[0][0]=1;
		for(int i=1;i<=m;++i)for(int j=0;j<=i;++j)
		C[i][j]=(j?C[i-1][j-1]:0)+C[i-1][j];
		for(int i=0;i<n;++i)read(a[i]);
		fr[0]=1;
		for(int i=1;i<=m;++i)fr[i]=fr[i-1]*i;
		for(int i=0;i<(1<<n);++i)
		{
			val[i]=1;
			for(int j=0;j<n;++j)if(i>>j&1)
			S[i]+=a[j],val[i]/=fr[a[j]];
		}
		for(int i=1;i<=m;++i)
		{
			iv[i][0]=1,iiv[i][0]=1,pw[i][0]=1;
			for(int j=1;j<=m;++j)iv[i][j]=iv[i][j-1]/i;
			for(int j=1;j<=m;++j)pw[i][j]=pw[i][j-1]*i;
			for(int j=1;j<=m;++j)iiv[i][j]=iiv[i][j-1]*(i-1)/i;
		}
		f[0][0]=1;
		tmp[0][0]=1;
		for(int i=1;i<(1<<n);++i)
		{
			int x=__lg(i&-i),lst=i^(1<<x);
			for(int j=0;j<=m;++j)if(fabs(tmp[lst][j])>eps)
			{
				for(int k=0;j+k<=m&&k<a[x];++k)
				tmp[i][j+k]+=tmp[lst][j]/fr[k];
			}
//			cout<<i<<" "<<x<<endl;
//			for(int j=0;j<=m;++j)cout<<tmp[i][j]<<" ";
//			cout<<endl;
		}
//		exit(0);
		for(int i=0;i<(1<<n);++i)for(int j=0;j<=m;++j)
		{
			if(fabs(f[i][j])<eps)continue;
			f[i][j+1]+=f[i][j];
			int lst=n-__builtin_popcount(i);
			for(int k=0;k<n;++k)if((!(i>>k&1))&&j+1>=a[k])
			{
				f[i|(1<<k)][j+1-a[k]]+=
				f[i][j]*iv[lst][a[k]]*iiv[lst][j+1-a[k]]
				*C[j][a[k]-1];
			}
			int al=j;
			for(int k=0;k<n;++k)if(i>>k&1)al+=a[k];
			if(al==m&&fabs(tmp[((1<<n)-1)^i][j])>eps)
			{
				ans+=fr[j]*tmp[((1<<n)-1)^i][j]*iv[lst][j]*f[i][j]*(__builtin_popcount(i));
//				cerr<<i<<" "<<j<<" "<<fr[j]*tmp[((1<<n)-1)^i][j]<<" "<<f[i][j]<<endl;
			}
		}
		printf("%.7Lf",ans);
	}
	inline void Mian()
	{
		int T=1;
//		read(T);
		while(T--)mian();
	}
}
bool ED;
signed main()
{
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	double st=clock();
	WrongAnswer_90::Mian();
	double ed=clock();
 	cerr<<endl;
 	cerr<<"Time: "<<ed-st<<" ms\n";
 	cerr<<"Memory: "<<abs(&ST-&ED)/1024.0/1024.0<<" MB\n";
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 8068kb

input:

2 2
2 2

output:

0.5000000

result:

ok found '0.5000000000', expected '0.5000000000', error '0'

Test #2:

score: 0
Accepted
time: 1ms
memory: 8040kb

input:

3 3
1 2 3

output:

1.0833333

result:

ok found '1.0833333000', expected '1.0833333333', error '3.33333e-08'

Test #3:

score: -100
Wrong Answer
time: 1ms
memory: 8032kb

input:

3 100
80 32 38

output:

0.0000000

result:

wrong answer 1st numbers differ - expected: '0.917682017512703', found: '0.000000000000000', error = '0.917682'