QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#456181#8774. Manhattan Walkucup-team3699#AC ✓14ms19512kbC++202.2kb2024-06-27 12:50:122024-06-27 12:50:13

Judging History

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

  • [2024-06-27 12:50:13]
  • 评测
  • 测评结果：AC
  • 用时：14ms
  • 内存：19512kb
查看
  • [2024-06-27 12:50:12]
  • 提交

answer

#include<iostream>
#include<iomanip>
using namespace std;
#define int long long 
#define INF 1e13
#define N 1005
double dp[N][N][2];
inline double avg(int i, int j){
    return (dp[i][j][0] + dp[i][j][1]) / 2;
}
void solve(){
    int n, m;
    double p;
    cin >> n >> m >> p;
    // for (int i = 0; i <= n; i++)
    //     for (int j = 0; j <= m; j++)
    //         dp[i][j] = INF;
    for (int i = n; i; i--){
        for (int j = m; j; j--){
            if(i == n && j == m)
                continue;
            if(i == n){
                dp[i][j][0] = p / 2 + avg(i, j + 1);
                dp[i][j][1] = avg(i, j + 1);
            }
            else if(j == m){
                dp[i][j][0] = avg(i + 1, j);
                dp[i][j][1] = p / 2 + avg(i + 1, j);
            }
            else{
                if(avg(i + 1, j) < avg(i, j + 1)){
                    dp[i][j][0] = avg(i + 1, j);
                    double d = avg(i, j + 1) - avg(i + 1, j);
                    if(d > p)
                        dp[i][j][1] = avg(i + 1, j) + p / 2;
                    else{
                        double pro = d / p;
                        dp[i][j][1] = pro * (avg(i + 1, j) + avg(i, j + 1)) / 2 + (1 - pro) * avg(i, j + 1);
                    }
                }
                else{
                    dp[i][j][1] = avg(i, j + 1);
                    double d = avg(i + 1, j) - avg(i, j + 1);
                    if(d > p)
                        dp[i][j][0] = avg(i, j + 1) + p / 2;
                    else{
                        double pro = d / p;
                        dp[i][j][0] = pro * (avg(i + 1, j) + avg(i, j + 1)) / 2 + (1 - pro) * avg(i + 1, j);
                    }                    
                }
            }
        }
    }
    // cout << fixed << setprecision(10);
    // for (int i = 1; i <= n; i++){
    //     for (int j = 1; j <= m; j++)
    //         cout << avg(i, j) << " ";
    //     cout << "\n";
    // }
    cout << fixed << setprecision(10) << avg(1, 1) << "\n";
}
signed main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 3 8

output:

2.8750000000

result:

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

Test #2:

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

input:

5 5 5

output:

2.4322338689

result:

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

Test #3:

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

input:

1 1 1

output:

0.0000000000

result:

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

Test #4:

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

input:

1000 1000 1000000000

output:

1782317138.8083753586

result:

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

Test #5:

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

input:

1 4 5

output:

3.7500000000

result:

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

Test #6:

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

input:

4 1 5

output:

3.7500000000

result:

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

Test #7:

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

input:

1 1 1000000000

output:

0.0000000000

result:

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

Test #8:

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

input:

1 2 1000000000

output:

250000000.0000000000

result:

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

Test #9:

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

input:

2 1 1000000000

output:

250000000.0000000000

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.2500000000

result:

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

Test #11:

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

input:

2 1 1

output:

0.2500000000

result:

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

Test #12:

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

input:

1 10 3

output:

6.7500000000

result:

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

Test #13:

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

input:

10 1 3

output:

6.7500000000

result:

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

Test #14:

score: 0
Accepted
time: 10ms
memory: 19464kb

input:

997 993 998244353

output:

1779941051.3461599350

result:

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

Test #15:

score: 0
Accepted
time: 7ms
memory: 17904kb

input:

988 313 886183312

output:

78753022570.4833374023

result:

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

Test #16:

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

input:

583 286 322190846

output:

8636356976.8437118530

result:

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

Test #17:

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

input:

892 468 494964816

output:

17125998682.7292423248

result:

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

Test #18:

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

input:

26 882 386682745

output:

78231677700.7504882812

result:

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

Test #19:

score: 0
Accepted
time: 14ms
memory: 17496kb

input:

867 926 422131798

output:

945100500.3991063833

result:

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

Test #20:

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

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

input:

23 90 80

output:

860.0506987358

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.3892679676

result:

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

Test #23:

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

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

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

input:

9 5 481032867

output:

400507342.3667383194

result:

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

Test #26:

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

input:

366 73 3

output:

149.4864642331

result:

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

Test #27:

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

input:

6 4 5

output:

2.8946451697

result:

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

Test #28:

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

input:

8 10 5

output:

3.3973608525

result:

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

Test #29:

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

input:

10 1 7

output:

15.7500000000

result:

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

Test #30:

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

input:

10 7 10

output:

7.3716466074

result:

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

Test #31:

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

input:

2 8 1

output:

1.3271069195

result:

ok found '1.3271069', expected '1.3271069', error '0.0000000'
English 繁體中文 简体中文

Server Time: 2024-12-05 04:47:50 | OpenSource Project