QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#792149	#8774. Manhattan Walk	lukamosiashvili^#	AC ✓	17ms	19632kb	C++17	2.0kb	2024-11-29 01:17:50	2024-11-29 01:17:51

Judging History

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

[2024-11-29 01:17:51]
评测

测评结果：AC
用时：17ms
内存：19632kb

查看

[2024-11-29 01:17:50]
提交

answer

#include <bits/stdc++.h>
using namespace std;

long double dp[1009][1009];

int main(){
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int n, m;
    int pp;
    cin >> n >> m >> pp;

    long double p = pp;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(i == 1 && j == 1){
                dp[i][j] = 0;
                continue;
            }

            if(i == 1){
                dp[i][j] = dp[i][j - 1] + p*0.25;
                continue;
            }

            if(j == 1){
                dp[i][j] = dp[i - 1][j] + p*0.25;
                continue;
            }

            // down
            //dp[i][j] = min(dp[i - 1][j], dp[i][j - 1] + pp*0.5);
            if(dp[i - 1][j] <= dp[i][j - 1]){
                dp[i][j] = dp[i - 1][j];
            }else{
                if(dp[i - 1][j] >= dp[i][j - 1] + p){
                    dp[i][j] = dp[i][j - 1] + p * 0.5;
                }else{
                    long double probA = (dp[i - 1][j] - dp[i][j - 1]) / p;
                    dp[i][j] = (dp[i][j - 1] + (dp[i - 1][j] - dp[i][j - 1]) / 2.0) * probA;
                    long double probB = 1.0 - probA;
                    dp[i][j] += (dp[i - 1][j]) * probB;
                }
            }
            // right
            //dp[i][j] += min(dp[i][j - 1], dp[i - 1][j] + p*0.5);
            if(dp[i][j - 1] <= dp[i - 1][j]){
                dp[i][j] += dp[i][j - 1];
            }else{
                if(dp[i][j - 1] >= dp[i - 1][j] + p){
                    dp[i][j] += dp[i][j - 1] + p * 0.5;
                }else{
                    long double probA = (dp[i][j - 1] - dp[i - 1][j]) / p;
                    dp[i][j] += (dp[i - 1][j] + (dp[i][j - 1] - dp[i - 1][j]) / 2.0) * probA;
                    long double probB = 1.0 - probA;
                    dp[i][j] += (dp[i][j - 1]) * probB;
                }
            }
            //
            dp[i][j] = dp[i][j] / 2.0;
        }
    }

    cout << setprecision(12) << dp[n][m];
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3820kb

input:

2 3 8

output:

2.875

result:

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

Test #2:

score: 0

Accepted

time: 0ms

memory: 3700kb

input:

5 5 5

output:

2.43223386887

result:

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

Test #3:

score: 0

Accepted

time: 0ms

memory: 3892kb

input:

1 1 1

output:

result:

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

Test #4:

score: 0

Accepted

time: 17ms

memory: 19600kb

input:

1000 1000 1000000000

output:

1782317138.81

result:

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

Test #5:

score: 0

Accepted

time: 0ms

memory: 3812kb

input:

1 4 5

output:

3.75

result:

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

Test #6:

score: 0

Accepted

time: 0ms

memory: 3848kb

input:

4 1 5

output:

3.75

result:

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

Test #7:

score: 0

Accepted

time: 0ms

memory: 3916kb

input:

1 1 1000000000

output:

result:

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

Test #8:

score: 0

Accepted

time: 0ms

memory: 3820kb

input:

1 2 1000000000

output:

250000000

result:

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

Test #9:

score: 0

Accepted

time: 0ms

memory: 3820kb

input:

2 1 1000000000

output:

250000000

result:

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

Test #10:

score: 0

Accepted

time: 0ms

memory: 3660kb

input:

1 2 1

output:

0.25

result:

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

Test #11:

score: 0

Accepted

time: 0ms

memory: 3824kb

input:

2 1 1

output:

0.25

result:

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

Test #12:

score: 0

Accepted

time: 0ms

memory: 3852kb

input:

1 10 3

output:

6.75

result:

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

Test #13:

score: 0

Accepted

time: 0ms

memory: 3852kb

input:

10 1 3

output:

6.75

result:

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

Test #14:

score: 0

Accepted

time: 12ms

memory: 19632kb

input:

997 993 998244353

output:

1779941051.35

result:

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

Test #15:

score: 0

Accepted

time: 3ms

memory: 18028kb

input:

988 313 886183312

output:

78753022570.5

result:

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

Test #16:

score: 0

Accepted

time: 2ms

memory: 14504kb

input:

583 286 322190846

output:

8636356976.84

result:

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

Test #17:

score: 0

Accepted

time: 8ms

memory: 17372kb

input:

892 468 494964816

output:

17125998682.7

result:

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

Test #18:

score: 0

Accepted

time: 1ms

memory: 6220kb

input:

26 882 386682745

output:

78231677700.8

result:

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

Test #19:

score: 0

Accepted

time: 14ms

memory: 18164kb

input:

867 926 422131798

output:

945100500.399

result:

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

Test #20:

score: 0

Accepted

time: 0ms

memory: 4008kb

input:

37 68 19

output:

62.2844598802

result:

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

Test #21:

score: 0

Accepted

time: 0ms

memory: 3948kb

input:

23 90 80

output:

860.050698736

result:

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

Test #22:

score: 0

Accepted

time: 0ms

memory: 4088kb

input:

43 55 85

output:

118.389267968

result:

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

Test #23:

score: 0

Accepted

time: 1ms

memory: 6260kb

input:

93 66 43

output:

97.9048408588

result:

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

Test #24:

score: 0

Accepted

time: 1ms

memory: 4268kb

input:

78 93 30

output:

44.8454523265

result:

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

Test #25:

score: 0

Accepted

time: 0ms

memory: 3936kb

input:

9 5 481032867

output:

400507342.367

result:

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

Test #26:

score: 0

Accepted

time: 0ms

memory: 10492kb

input:

366 73 3

output:

149.486464233

result:

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

Test #27:

score: 0

Accepted

time: 0ms

memory: 3848kb

input:

6 4 5

output:

2.89464516973

result:

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

Test #28:

score: 0

Accepted

time: 0ms

memory: 3856kb

input:

8 10 5

output:

3.39736085247

result:

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

Test #29:

score: 0

Accepted

time: 0ms

memory: 3860kb

input:

10 1 7

output:

15.75

result:

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

Test #30:

score: 0

Accepted

time: 0ms

memory: 3916kb

input:

10 7 10

output:

7.37164660739

result:

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

Test #31:

score: 0

Accepted

time: 0ms

memory: 3832kb

input:

2 8 1

output:

1.32710691947

result:

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