QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#429219#8774. Manhattan Walkucup-team2000#AC ✓15ms19668kbC++201.9kb2024-06-02 03:42:352024-06-02 03:42:37

Judging History

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

  • [2024-06-02 03:42:37]
  • 评测
  • 测评结果:AC
  • 用时:15ms
  • 内存:19668kb
  • [2024-06-02 03:42:35]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << ' ' << x << '\n'
#define debug2(x, y) debug(x); debug(y)
#define ll long long
#define ld long double
const int mxN = 1e3 + 5;

ld dp[mxN][mxN];

int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        int r, c, p;
        cin >> r >> c >> p;
        for(int i = 0; i < r; i++) for(int j = 0; j < c; j++) dp[i][j] = 1e18;
        dp[r - 1][c - 1] = 0.0;
        for(int i = r - 1; i >= 0; i--){
                for(int j = c - 1; j >= 0; j--){
                        if(i < r - 1 && j < c - 1){
                                ld a = 0.0;
                                if(dp[i + 1][j] <= dp[i][j + 1]) a = dp[i + 1][j];
                                else{
                                        ld d = dp[i + 1][j] - dp[i][j + 1];
                                        ld pr = min((ld)1.0, d / (ld)p);
                                        a = pr * (dp[i][j + 1] + min(d, (ld)p) * 0.5) + (1 - pr) * dp[i + 1][j];
                                }
                                ld b = 0.0;
                                if(dp[i][j + 1] <= dp[i + 1][j]) b = dp[i][j + 1];
                                else{
                                        ld d = dp[i][j + 1] - dp[i + 1][j];
                                        ld pr = min((ld)1.0, d / (ld)p);
                                        b = pr * (dp[i + 1][j] + min(d, (ld)p) * 0.5) + (1 - pr) * dp[i][j + 1];
                                }
                                dp[i][j] = 0.5 * a + 0.5 * b;
                        }
                        else if(i < r - 1){
                                dp[i][j] = (p * 0.25) + dp[i + 1][j];
                        }
                        else if(j < c - 1){
                                dp[i][j] = (p * 0.25) + dp[i][j + 1];
                        }
                }
        }
        cout << fixed << setprecision(15) << dp[0][0] << '\n';
}

详细

Test #1:

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

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: 3896kb

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: 3880kb

input:

1 1 1

output:

0.000000000000000

result:

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

Test #4:

score: 0
Accepted
time: 11ms
memory: 19668kb

input:

1000 1000 1000000000

output:

1782317138.808375251130201

result:

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

Test #5:

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

input:

1 4 5

output:

3.750000000000000

result:

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

Test #6:

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

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: 3740kb

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: 3928kb

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: 3856kb

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: 3924kb

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: 3804kb

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: 3932kb

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: 3916kb

input:

10 1 3

output:

6.750000000000000

result:

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

Test #14:

score: 0
Accepted
time: 15ms
memory: 19624kb

input:

997 993 998244353

output:

1779941051.346162438392639

result:

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

Test #15:

score: 0
Accepted
time: 4ms
memory: 18044kb

input:

988 313 886183312

output:

78753022570.483319200575352

result:

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

Test #16:

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

input:

583 286 322190846

output:

8636356976.843714023008943

result:

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

Test #17:

score: 0
Accepted
time: 4ms
memory: 18488kb

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: 4328kb

input:

26 882 386682745

output:

78231677700.750421985983849

result:

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

Test #19:

score: 0
Accepted
time: 11ms
memory: 19128kb

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: 4112kb

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: 4004kb

input:

23 90 80

output:

860.050698735791088

result:

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

Test #22:

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

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: 6044kb

input:

93 66 43

output:

97.904840858751091

result:

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

Test #24:

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

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: 3900kb

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: 10280kb

input:

366 73 3

output:

149.486464233095968

result:

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

Test #27:

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

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: 3952kb

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: 3916kb

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: 3892kb

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: 3928kb

input:

2 8 1

output:

1.327106919465782

result:

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