QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#428043#8774. Manhattan Walkucup-team228#AC ✓19ms11984kbC++202.2kb2024-06-01 17:06:552024-06-01 17:06:56

Judging History

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

  • [2024-06-01 17:06:56]
  • 评测
  • 测评结果:AC
  • 用时:19ms
  • 内存:11984kb
  • [2024-06-01 17:06:55]
  • 提交

answer

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

string to_string(string a) { return '"' + a + '"'; }
string to_string(char a) { return "'" + string(1, a) + "'"; }
string to_string(const char* a) { return to_string((string) a); }
string to_string(bool a) { return a ? "true" : "false"; }
template <class T1, class T2>
string to_string(pair<T1, T2> a) {
    return "(" + to_string(a.first) + ", " + to_string(a.second) + ")";
}
template <class T>
string to_string(T a) {
    bool first = true; string res = "{";
    for (const auto& i : a) {
        if (!first) res += ", ";
        first = false;
        res += to_string(i);
    }
    res += "}";
    return res;
}
void debug_out() { cerr << endl; }
template <class T1, class... T2>
void debug_out(T1 a, T2... b) {
    cerr << " " << to_string(a);
    debug_out(b...);
}

#ifdef LOCAL
#define out(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define out(...) 42
#endif

clock_t start_time; void start_timer() { start_time = clock(); }
double get_time() { return (double) (clock() - start_time) / CLOCKS_PER_SEC; }

void Solve();

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
    freopen("../input.txt", "r", stdin);
#endif
    start_timer();
    Solve();
#ifdef LOCAL
    cerr << fixed << setprecision(3);
    cerr << endl << "Time spent: " << get_time() << endl;
#endif
    return 0;
}

typedef  double real_t;

real_t p;

real_t inter(real_t t1, real_t t2) {
    real_t q = t2 - t1;
    if (q < 0) {
        return t2;
    }
    q = min(q, p);
    return ((p - q) * t2 + q * t1 + q * q / 2) / p;
}

const int N = 1010;
const real_t INF = 1e15;

real_t dp[N][N];

void Solve() {
    int n, m;
    cin >> n >> m >> p;
    for (int i = 0; i < N; ++i) {
        dp[i][0] = INF;
        dp[0][i] = INF;
    }
    dp[1][1] = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            double t1 = dp[i - 1][j];
            double t2 = dp[i][j - 1];
            if (i > 1 || j > 1) {
                dp[i][j] = 0.5 * (inter(t1, t2) + inter(t2, t1));
            }
        }
    }
    cout << fixed << setprecision(15) << dp[n][m] << '\n';
}

详细

Test #1:

score: 100
Accepted
time: 2ms
memory: 8040kb

input:

2 3 8

output:

2.875000000000000

result:

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

Test #2:

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

input:

5 5 5

output:

2.432233868873881

result:

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

Test #3:

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

input:

1 1 1

output:

0.000000000000000

result:

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

Test #4:

score: 0
Accepted
time: 19ms
memory: 11772kb

input:

1000 1000 1000000000

output:

1782317138.808375358581543

result:

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

Test #5:

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

input:

1 4 5

output:

3.750000000000000

result:

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

Test #6:

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

input:

4 1 5

output:

3.750000000000000

result:

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

Test #7:

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

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

input:

1 2 1000000000

output:

250000000.000000000000000

result:

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

Test #9:

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

input:

2 1 1000000000

output:

250000000.000000000000000

result:

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

Test #10:

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

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

input:

2 1 1

output:

0.250000000000000

result:

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

Test #12:

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

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

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

input:

997 993 998244353

output:

1779941051.346162796020508

result:

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

Test #15:

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

input:

988 313 886183312

output:

78753022570.483276367187500

result:

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

Test #16:

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

input:

583 286 322190846

output:

8636356976.843708038330078

result:

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

Test #17:

score: 0
Accepted
time: 9ms
memory: 11336kb

input:

892 468 494964816

output:

17125998682.729227066040039

result:

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

Test #18:

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

input:

26 882 386682745

output:

78231677700.750457763671875

result:

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

Test #19:

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

input:

867 926 422131798

output:

945100500.399106740951538

result:

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

Test #20:

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

input:

37 68 19

output:

62.284459880159076

result:

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

Test #21:

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

input:

23 90 80

output:

860.050698735791229

result:

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

Test #22:

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

input:

43 55 85

output:

118.389267967564180

result:

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

Test #23:

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

input:

93 66 43

output:

97.904840858751086

result:

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

Test #24:

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

input:

78 93 30

output:

44.845452326450598

result:

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

Test #25:

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

input:

9 5 481032867

output:

400507342.366738319396973

result:

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

Test #26:

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

input:

366 73 3

output:

149.486464233095944

result:

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

Test #27:

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

input:

6 4 5

output:

2.894645169728758

result:

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

Test #28:

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

input:

8 10 5

output:

3.397360852474908

result:

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

Test #29:

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

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

input:

10 7 10

output:

7.371646607394142

result:

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

Test #31:

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

input:

2 8 1

output:

1.327106919465782

result:

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