QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#466577#968. Extreme WealthKevin5307ML 0ms0kbC++231.1kb2024-07-07 22:37:492024-07-07 22:37:50

Judging History

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

  • [2024-07-07 22:37:50]
  • 评测
  • 测评结果:ML
  • 用时:0ms
  • 内存:0kb
  • [2024-07-07 22:37:49]
  • 提交

answer

//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const long double eps=1e-9;
long double dp[5005][5005];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for(int i=0;i<5005;i++)
		dp[i][0]=dp[0][i]=pow(0.5,i);
	for(int i=1;i<5005;i++)
		for(int j=1;j<5005;j++)
			dp[i][j]=(dp[i-1][j]+dp[i][j-1])/2;
	ll a,b;
	cin>>a>>b;
	if(max(a,b)>5000) die("Extreme Wealth");
	long double ans=1/dp[a][b];
	if(ans>1e9) die("Extreme Wealth");
	cout<<fixed<<setprecision(15)<<ans<<endl;
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Memory Limit Exceeded

input:

3 2

output:

3.200000000000000

result: