QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#55004	#2964. Loot Chest	T3alaadl3k2olyehymn3k^#	AC ✓	2ms	4080kb	C++	908b	2022-10-11 21:24:21	2022-10-11 21:24:24

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-10-11 21:24:24]
评测

测评结果：AC
用时：2ms
内存：4080kb

查看

[2022-10-11 21:24:21]
提交

answer

#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")

#include "bits/stdc++.h"

#define int long long
#define rep(i, n) for(int (i)=0 ;(i)<n ;(i)++)
using namespace std;
#define double long double
const int N = 10000;
double dp[N];
double deltaL, deltaW, probOfG, probofL, W;
double zby1;

double solve(int curProb) {
    if (curProb >= 100)return 1 / W;
    double &cur = dp[curProb];
    if (cur > -1)return cur;
    cur = 0;
    return cur = 1 + W * ((100 - curProb) / 100.0 * solve(curProb + deltaW)) + probofL * solve(curProb + deltaL);
}

signed main() {
    for (int i = 0; i < N; i++)
        dp[i] = -1;
    cin >> deltaL >> deltaW >> probOfG >> probofL;
    probofL /= 100;
    probOfG /= 100;
    W = 1 - probofL;

    cout << fixed << setprecision(9) << solve(0) / probOfG << endl;
}

源文件, 语言: C++

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3876kb

input:

1 100 50 0

output:

4.000000000

result:

ok found '4.0000000', expected '4.0000000', error '0.0000000'

Test #2:

score: 0

Accepted

time: 1ms

memory: 4004kb

input:

50 50 100 25

output:

2.833333333

result:

ok found '2.8333333', expected '2.8333333', error '0.0000000'

Test #3:

score: 0

Accepted

time: 2ms

memory: 4032kb

input:

1 100 10 0

output:

20.000000000

result:

ok found '20.0000000', expected '20.0000000', error '0.0000000'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3912kb

input:

2 3 10 80

output:

197.005706720

result:

ok found '197.0057067', expected '197.0057067', error '0.0000000'

Test #5:

score: 0

Accepted

time: 2ms

memory: 4080kb

input:

1 1 100 0

output:

13.209960630

result:

ok found '13.2099606', expected '13.2099606', error '0.0000000'

Test #6:

score: 0

Accepted

time: 2ms

memory: 3852kb

input:

1 100 100 0

output:

2.000000000

result:

ok found '2.0000000', expected '2.0000000', error '0.0000000'

Test #7:

score: 0

Accepted

time: 0ms

memory: 4076kb

input:

1 1 1 0

output:

1320.996063022

result:

ok found '1320.9960630', expected '1320.9960630', error '0.0000000'

Test #8:

score: 0

Accepted

time: 1ms

memory: 3880kb

input:

1 2 1 99

output:

14648.653617579

result:

ok found '14648.6536176', expected '14648.6536176', error '0.0000000'

Test #9:

score: 0

Accepted

time: 2ms

memory: 3912kb

input:

100 100 1 1

output:

201.010101010

result:

ok found '201.0101010', expected '201.0101010', error '0.0000000'

Test #10:

score: 0

Accepted

time: 2ms

memory: 3796kb

input:

1 3 1 49

output:

1326.893953585

result:

ok found '1326.8939536', expected '1326.8939536', error '0.0000000'

Test #11:

score: 0

Accepted

time: 2ms

memory: 3972kb

input:

69 91 78 18

output:

3.011682301

result:

ok found '3.0116823', expected '3.0116823', error '0.0000000'

Test #12:

score: 0

Accepted

time: 2ms

memory: 3916kb

input:

40 13 94 9

output:

4.338797657

result:

ok found '4.3387977', expected '4.3387977', error '0.0000000'

Test #13:

score: 0

Accepted

time: 2ms

memory: 3880kb

input:

88 43 61 71

output:

7.713913184

result:

ok found '7.7139132', expected '7.7139132', error '0.0000000'

Test #14:

score: 0

Accepted

time: 2ms

memory: 3916kb

input:

13 46 56 40

output:

6.790049790

result:

ok found '6.7900498', expected '6.7900498', error '0.0000000'

Test #15:

score: 0

Accepted

time: 0ms

memory: 4076kb

input:

79 82 27 70

output:

16.793827160

result:

ok found '16.7938272', expected '16.7938272', error '0.0000000'

Test #16:

score: 0

Accepted

time: 0ms

memory: 3892kb

input:

62 57 67 33

output:

4.337369125

result:

ok found '4.3373691', expected '4.3373691', error '0.0000000'

Test #17:

score: 0

Accepted

time: 2ms

memory: 3796kb

input:

3 1 1 97

output:

4951.756246923

result:

ok found '4951.7562469', expected '4951.7562469', error '0.0000000'

Test #18:

score: 0

Accepted

time: 2ms

memory: 3920kb

input:

1 2 54 50

output:

28.323919760

result:

ok found '28.3239198', expected '28.3239198', error '0.0000000'

Test #19:

score: 0

Accepted

time: 2ms

memory: 3844kb

input:

2 3 6 1

output:

132.831285269

result:

ok found '132.8312853', expected '132.8312853', error '0.0000000'

Test #20:

score: 0

Accepted

time: 2ms

memory: 4044kb

input:

2 3 34 2

output:

23.589985115

result:

ok found '23.5899851', expected '23.5899851', error '0.0000000'

Test #21:

score: 0

Accepted

time: 1ms

memory: 3968kb

input:

66 63 52 38

output:

5.714429280

result:

ok found '5.7144293', expected '5.7144293', error '0.0000000'

Test #22:

score: 0

Accepted

time: 0ms

memory: 3792kb

input:

62 46 75 27

output:

3.852912392

result:

ok found '3.8529124', expected '3.8529124', error '0.0000000'

Test #23:

score: 0

Accepted

time: 0ms

memory: 4024kb

input:

65 18 37 17

output:

9.490843403

result:

ok found '9.4908434', expected '9.4908434', error '0.0000000'

Test #24:

score: 0

Accepted

time: 0ms

memory: 3920kb

input:

97 13 80 32

output:

4.430480978

result:

ok found '4.4304810', expected '4.4304810', error '0.0000000'