QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#433899#8774. Manhattan Walkmendicillin2#AC ✓15ms11828kbC++142.1kb2024-06-08 13:49:012024-06-08 13:49:17

Judging History

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

  • [2024-06-08 13:49:17]
  • 评测
  • 测评结果:AC
  • 用时:15ms
  • 内存:11828kb
  • [2024-06-08 13:49:01]
  • 提交

answer

#include <bits/stdc++.h>

#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

double dp[1010][1010];

int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int n, m, P;
    read(n); read(m); read(P);
    double p = P;
    F(i, 1, n)
        F(j, 1, m) {
            if (i == 1 && j == 1) { dp[i][j] = 0; continue; }
            if (i == 1) { dp[i][j] = dp[i][j - 1] + 0.25 * p; continue; }
            if (j == 1) { dp[i][j] = dp[i - 1][j] + 0.25 * p; continue; }
            if (dp[i - 1][j] < dp[i][j - 1]) {
                double cur = min(dp[i][j - 1] - dp[i - 1][j], p);
                dp[i][j] = 0.5 * dp[i - 1][j] + 0.5 * cur / p * (dp[i - 1][j] + 0.5 * cur) + 0.5 * (1 - cur / p) * dp[i][j - 1];
            }
            else {
                double cur = min(dp[i - 1][j] - dp[i][j - 1], p);
                dp[i][j] = 0.5 * dp[i][j - 1] + 0.5 * cur / p * (dp[i][j - 1] + 0.5 * cur) + 0.5 * (1 - cur / p) * dp[i - 1][j];
            }
        }
    cout << fixed << setprecision(10) << dp[n][m] << '\n';
    return 0;
}

詳細信息

Test #1:

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

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

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

input:

1 1 1

output:

0.0000000000

result:

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

Test #4:

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

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

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

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

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

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

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

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

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

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

input:

10 1 3

output:

6.7500000000

result:

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

Test #14:

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

input:

997 993 998244353

output:

1779941051.3461599350

result:

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

Test #15:

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

input:

988 313 886183312

output:

78753022570.4833068848

result:

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

Test #16:

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

input:

583 286 322190846

output:

8636356976.8437156677

result:

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

Test #17:

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

input:

892 468 494964816

output:

17125998682.7292442322

result:

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

Test #18:

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

input:

26 882 386682745

output:

78231677700.7503814697

result:

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

Test #19:

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

input:

867 926 422131798

output:

945100500.3991073370

result:

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

Test #20:

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

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

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

input:

43 55 85

output:

118.3892679676

result:

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

Test #23:

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

input:

93 66 43

output:

97.9048408588

result:

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

Test #24:

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

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

input:

9 5 481032867

output:

400507342.3667383194

result:

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

Test #26:

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

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

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

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

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

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

input:

2 8 1

output:

1.3271069195

result:

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