QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#427390#8774. Manhattan Walkucup-team3586#AC ✓12ms19532kbC++231.3kb2024-06-01 13:11:032024-06-01 13:11:04

Judging History

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

  • [2024-06-01 13:11:04]
  • 评测
  • 测评结果:AC
  • 用时:12ms
  • 内存:19532kb
  • [2024-06-01 13:11:03]
  • 提交

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);}
long double dp[1005][1005];
ll p;
int n,m;
long double solve(long double a,long double b,long double c)
{
	if(b<a) return b;
	if(a+c<b) return a+c/2.0;
	long double val=b-a;
	return (a+val/2.0)*val/c+(c-val)*b/c;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m>>p;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			if(i==1&&j==1) continue;
			if(i==1)
				dp[i][j]=dp[i][j-1]+p*0.25;
			else if(j==1)
				dp[i][j]=dp[i-1][j]+p*0.25;
			else
				dp[i][j]=(solve(dp[i-1][j],dp[i][j-1],p)+solve(dp[i][j-1],dp[i-1][j],p))*0.5;
		}
	cout<<fixed<<setprecision(15)<<dp[n][m]<<endl;
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3848kb

input:

2 3 8

output:

2.875000000000000

result:

ok found '2.8750000', expected '2.8750000', error '0.0000000'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

5 5 5

output:

2.432233868873881

result:

ok found '2.4322339', expected '2.4322339', error '0.0000000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

1 1 1

output:

0.000000000000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #4:

score: 0
Accepted
time: 8ms
memory: 19532kb

input:

1000 1000 1000000000

output:

1782317138.808375250664540

result:

ok found '1782317138.8083754', expected '1782317138.8083761', error '0.0000000'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3836kb

input:

1 4 5

output:

3.750000000000000

result:

ok found '3.7500000', expected '3.7500000', error '0.0000000'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3812kb

input:

4 1 5

output:

3.750000000000000

result:

ok found '3.7500000', expected '3.7500000', error '0.0000000'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3732kb

input:

1 1 1000000000

output:

0.000000000000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

1 2 1000000000

output:

250000000.000000000000000

result:

ok found '250000000.0000000', expected '250000000.0000000', error '0.0000000'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3660kb

input:

2 1 1000000000

output:

250000000.000000000000000

result:

ok found '250000000.0000000', expected '250000000.0000000', error '0.0000000'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3804kb

input:

1 2 1

output:

0.250000000000000

result:

ok found '0.2500000', expected '0.2500000', error '0.0000000'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3844kb

input:

2 1 1

output:

0.250000000000000

result:

ok found '0.2500000', expected '0.2500000', error '0.0000000'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3768kb

input:

1 10 3

output:

6.750000000000000

result:

ok found '6.7500000', expected '6.7500000', error '0.0000000'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3812kb

input:

10 1 3

output:

6.750000000000000

result:

ok found '6.7500000', expected '6.7500000', error '0.0000000'

Test #14:

score: 0
Accepted
time: 12ms
memory: 19452kb

input:

997 993 998244353

output:

1779941051.346162437926978

result:

ok found '1779941051.3461623', expected '1779941051.3461628', error '0.0000000'

Test #15:

score: 0
Accepted
time: 3ms
memory: 18876kb

input:

988 313 886183312

output:

78753022570.483319185674191

result:

ok found '78753022570.4833221', expected '78753022570.4833527', error '0.0000000'

Test #16:

score: 0
Accepted
time: 0ms
memory: 12956kb

input:

583 286 322190846

output:

8636356976.843714021146297

result:

ok found '8636356976.8437138', expected '8636356976.8437138', error '0.0000000'

Test #17:

score: 0
Accepted
time: 8ms
memory: 17464kb

input:

892 468 494964816

output:

17125998682.729238951578736

result:

ok found '17125998682.7292385', expected '17125998682.7292328', error '0.0000000'

Test #18:

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

input:

26 882 386682745

output:

78231677700.750421971082687

result:

ok found '78231677700.7504272', expected '78231677700.7504883', error '0.0000000'

Test #19:

score: 0
Accepted
time: 0ms
memory: 19296kb

input:

867 926 422131798

output:

945100500.399107266217470

result:

ok found '945100500.3991072', expected '945100500.3991071', error '0.0000000'

Test #20:

score: 0
Accepted
time: 0ms
memory: 4028kb

input:

37 68 19

output:

62.284459880159053

result:

ok found '62.2844599', expected '62.2844599', error '0.0000000'

Test #21:

score: 0
Accepted
time: 0ms
memory: 3944kb

input:

23 90 80

output:

860.050698735791088

result:

ok found '860.0506987', expected '860.0506987', error '0.0000000'

Test #22:

score: 0
Accepted
time: 0ms
memory: 4060kb

input:

43 55 85

output:

118.389267967564183

result:

ok found '118.3892680', expected '118.3892680', error '0.0000000'

Test #23:

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

input:

93 66 43

output:

97.904840858751091

result:

ok found '97.9048409', expected '97.9048409', error '0.0000000'

Test #24:

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

input:

78 93 30

output:

44.845452326450609

result:

ok found '44.8454523', expected '44.8454523', error '0.0000000'

Test #25:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

9 5 481032867

output:

400507342.366738342010649

result:

ok found '400507342.3667383', expected '400507342.3667384', error '0.0000000'

Test #26:

score: 0
Accepted
time: 2ms
memory: 10364kb

input:

366 73 3

output:

149.486464233095968

result:

ok found '149.4864642', expected '149.4864642', error '0.0000000'

Test #27:

score: 0
Accepted
time: 0ms
memory: 3680kb

input:

6 4 5

output:

2.894645169728758

result:

ok found '2.8946452', expected '2.8946452', error '0.0000000'

Test #28:

score: 0
Accepted
time: 0ms
memory: 3868kb

input:

8 10 5

output:

3.397360852474909

result:

ok found '3.3973609', expected '3.3973609', error '0.0000000'

Test #29:

score: 0
Accepted
time: 0ms
memory: 3688kb

input:

10 1 7

output:

15.750000000000000

result:

ok found '15.7500000', expected '15.7500000', error '0.0000000'

Test #30:

score: 0
Accepted
time: 0ms
memory: 3836kb

input:

10 7 10

output:

7.371646607394142

result:

ok found '7.3716466', expected '7.3716466', error '0.0000000'

Test #31:

score: 0
Accepted
time: 0ms
memory: 3804kb

input:

2 8 1

output:

1.327106919465782

result:

ok found '1.3271069', expected '1.3271069', error '0.0000000'