QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#643045#8774. Manhattan Walkticking_away#AC ✓17ms11148kbC++201.9kb2024-10-15 18:16:502024-10-15 18:16:54

Judging History

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

  • [2024-10-15 18:16:54]
  • 评测
  • 测评结果:AC
  • 用时:17ms
  • 内存:11148kb
  • [2024-10-15 18:16:50]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 0;

#define int long long
using db = double;
void solve()
{
    int r, c;
    cin >> r >> c;
    int p;
    cin >> p;
    vector<vector<db>> f(r + 2, vector<db>(c + 2, 1e13));
    f[r][c] = 0;
    for (int i = r; i >= 1; i--)
    {
        for (int j = c; j >= 1; j--)
        {
            if (r == i && c == j)
                continue;
            db x = min(f[i][j + 1], f[i + 1][j]);
            db y = max(f[i][j + 1], f[i + 1][j]);
            db z = min(1.0 * (y - x), 1.0 * p);
            db t = 1.0 * p * x + 1.0 * z * x + 1.0 * (z)*z / 2.0 + 1.0 * y * (p - z);
            f[i][j] = t / (2.0 * p);
            // if (i == 4 && j == 4)
            //     cout << x << " " << y << " " << z << " " << t << endl;
            // cout << i << " " << j << " " << f[i][j] << "\n";
        }
        // cout << endl;
    }
    cout << fixed << setprecision(6) << f[1][1] << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3720kb

input:

2 3 8

output:

2.875000

result:

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

Test #2:

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

input:

5 5 5

output:

2.432234

result:

ok found '2.4322340', expected '2.4322339', error '0.0000001'

Test #3:

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

input:

1 1 1

output:

0.000000

result:

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

Test #4:

score: 0
Accepted
time: 13ms
memory: 11148kb

input:

1000 1000 1000000000

output:

1782317138.808376

result:

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

Test #5:

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

input:

1 4 5

output:

3.750000

result:

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

Test #6:

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

input:

4 1 5

output:

3.750000

result:

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

Test #7:

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

input:

1 1 1000000000

output:

0.000000

result:

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

Test #8:

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

input:

1 2 1000000000

output:

250000000.000000

result:

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

Test #9:

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

input:

2 1 1000000000

output:

250000000.000000

result:

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

Test #10:

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

input:

1 2 1

output:

0.250000

result:

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

Test #11:

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

input:

2 1 1

output:

0.250000

result:

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

Test #12:

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

input:

1 10 3

output:

6.750000

result:

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

Test #13:

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

input:

10 1 3

output:

6.750000

result:

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

Test #14:

score: 0
Accepted
time: 17ms
memory: 10908kb

input:

997 993 998244353

output:

1779941051.346160

result:

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

Test #15:

score: 0
Accepted
time: 5ms
memory: 5672kb

input:

988 313 886183312

output:

78753022570.483292

result:

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

Test #16:

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

input:

583 286 322190846

output:

8636356976.843716

result:

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

Test #17:

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

input:

892 468 494964816

output:

17125998682.729239

result:

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

Test #18:

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

input:

26 882 386682745

output:

78231677700.750443

result:

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

Test #19:

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

input:

867 926 422131798

output:

945100500.399107

result:

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

Test #20:

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

input:

37 68 19

output:

62.284460

result:

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

Test #21:

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

input:

23 90 80

output:

860.050699

result:

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

Test #22:

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

input:

43 55 85

output:

118.389268

result:

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

Test #23:

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

input:

93 66 43

output:

97.904841

result:

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

Test #24:

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

input:

78 93 30

output:

44.845452

result:

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

Test #25:

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

input:

9 5 481032867

output:

400507342.366738

result:

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

Test #26:

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

input:

366 73 3

output:

149.486464

result:

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

Test #27:

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

input:

6 4 5

output:

2.894645

result:

ok found '2.8946450', expected '2.8946452', error '0.0000001'

Test #28:

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

input:

8 10 5

output:

3.397361

result:

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

Test #29:

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

input:

10 1 7

output:

15.750000

result:

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

Test #30:

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

input:

10 7 10

output:

7.371647

result:

ok found '7.3716470', expected '7.3716466', error '0.0000001'

Test #31:

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

input:

2 8 1

output:

1.327107

result:

ok found '1.3271070', expected '1.3271069', error '0.0000001'