QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#822186#8774. Manhattan WalkMisukiAC ✓17ms19048kbC++203.1kb2024-12-19 23:20:072024-12-19 23:20:09

Judging History

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

  • [2024-12-19 23:20:09]
  • 评测
  • 测评结果:AC
  • 用时:17ms
  • 内存:19048kb
  • [2024-12-19 23:20:07]
  • 提交

answer

#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>

//#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << (x) << '\n'
#else
#define dbg(x)
#endif

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define double ldb

template<class T>
T floorDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? a / b : (a - b + 1) / b;
}
template<class T>
T ceilDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? (a + b - 1) / b : a / b;
}

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(const T &x : s)
    os << x << ' ';
  return os;
}


signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int r, c; cin >> r >> c;
  double p; cin >> p;
  vector dp(r + 1, vector<double>(c + 1));
  dp[0][0] = 0;
  for(int i = 0; i <= r; i++) {
    for(int j = (i == 0); j <= c; j++) {
      if (i == 0) {
        dp[i][j] = dp[i][j - 1] + p / 4;
      } else if (j == 0) {
        dp[i][j] = dp[i - 1][j] + p / 4;
      } else {
        double mn = dp[i - 1][j], mx = dp[i][j - 1];
        if (mn > mx) swap(mn, mx);
        if (mn + p <= mx) {
          dp[i][j] = mn + p / 4;
        } else {
          double r = (mx - mn) / p;
          dp[i][j] = (mn + r * (mn + r * p / 2) + (1 - r) * mx) / 2;
        }
      }
    }
  }

  cout << setprecision(9) << fixed;
  cout << dp[r - 1][c - 1] << '\n';

  //for(int i = 0; i <= r; i++)
    //cout << dp[i] << '\n';

  return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 3 8

output:

2.875000000

result:

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

Test #2:

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

input:

5 5 5

output:

2.432233869

result:

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

Test #3:

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

input:

1 1 1

output:

0.000000000

result:

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

Test #4:

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

input:

1000 1000 1000000000

output:

1782317138.808375250

result:

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

Test #5:

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

input:

1 4 5

output:

3.750000000

result:

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

Test #6:

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

input:

4 1 5

output:

3.750000000

result:

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

Test #7:

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

input:

1 1 1000000000

output:

0.000000000

result:

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

Test #8:

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

input:

1 2 1000000000

output:

250000000.000000000

result:

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

Test #9:

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

input:

2 1 1000000000

output:

250000000.000000000

result:

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

Test #10:

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

input:

1 2 1

output:

0.250000000

result:

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

Test #11:

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

input:

2 1 1

output:

0.250000000

result:

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

Test #12:

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

input:

1 10 3

output:

6.750000000

result:

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

Test #13:

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

input:

10 1 3

output:

6.750000000

result:

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

Test #14:

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

input:

997 993 998244353

output:

1779941051.346162438

result:

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

Test #15:

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

input:

988 313 886183312

output:

78753022570.483319201

result:

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

Test #16:

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

input:

583 286 322190846

output:

8636356976.843714022

result:

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

Test #17:

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

input:

892 468 494964816

output:

17125998682.729238952

result:

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

Test #18:

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

input:

26 882 386682745

output:

78231677700.750422001

result:

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

Test #19:

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

input:

867 926 422131798

output:

945100500.399107266

result:

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

Test #20:

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

input:

37 68 19

output:

62.284459880

result:

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

Test #21:

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

input:

23 90 80

output:

860.050698736

result:

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

Test #22:

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

input:

43 55 85

output:

118.389267968

result:

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

Test #23:

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

input:

93 66 43

output:

97.904840859

result:

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

Test #24:

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

input:

78 93 30

output:

44.845452326

result:

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

Test #25:

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

input:

9 5 481032867

output:

400507342.366738342

result:

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

Test #26:

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

input:

366 73 3

output:

149.486464233

result:

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

Test #27:

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

input:

6 4 5

output:

2.894645170

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

result:

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

Test #29:

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

input:

10 1 7

output:

15.750000000

result:

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

Test #30:

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

input:

10 7 10

output:

7.371646607

result:

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

Test #31:

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

input:

2 8 1

output:

1.327106919

result:

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