QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#428484#8774. Manhattan Walkucup-team3646#AC ✓15ms19080kbC++172.0kb2024-06-01 19:47:152024-06-01 19:47:17

Judging History

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

  • [2024-06-01 19:47:17]
  • 评测
  • 测评结果:AC
  • 用时:15ms
  • 内存:19080kb
  • [2024-06-01 19:47:15]
  • 提交

answer

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

#define ll long long
#define elif else if
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int,int>


#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))





struct ScalarInput {
    template<class T>
    operator T(){
        T ret;
        cin >> ret;
        return ret;
    }
};
struct VectorInput {
    size_t n;
    VectorInput(size_t n): n(n) {}
    template<class T>
    operator vector<T>(){
        vector<T> ret(n);
        for(T &x : ret) cin >> x;
        return ret;
    }
};
ScalarInput input(){ return ScalarInput(); }
VectorInput input(size_t n){ return VectorInput(n); }

template<typename T>
void print(vector<T> a){
  for(int i=0;i<a.size();i++){
    cout<<a[i]<<" \n"[i+1==a.size()];
  }
}

template<class T>
void print(T x){
    cout << x << '\n';
}
 
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail){
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

using D=long double;

D calc(D t1,D t2,D p){
  if(t1>t2)swap(t1,t2);
  if(t1+p<t2)return (t1/2.0)+(t1+p/2.0)/2.0;
  else return (t1/2.0)+(t2-(t2-t1)*(t2-t1)/(2.0*p))/2;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(15);

  int h,w;
  D p;
  cin>>h>>w>>p;
  vector<vector<D>>dp(h+1,vector<D>(w+1,1e15));
  dp[h-1][w-1]=0;
  for(int x=h-1;x>=0;x--){
    for(int y=w-1;y>=0;y--){
      if(x==(h-1)&&y==w-1)continue;
      dp[x][y]=calc(dp[x+1][y],dp[x][y+1],p);
    }
  }
  print(dp[0][0]);
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 3 8

output:

2.875000000000000

result:

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

Test #2:

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

input:

5 5 5

output:

2.432233868873881

result:

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

Test #3:

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

input:

1 1 1

output:

0.000000000000000

result:

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

Test #4:

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

input:

1000 1000 1000000000

output:

1782317138.808375250897370

result:

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

Test #5:

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

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

input:

4 1 5

output:

3.750000000000000

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

result:

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

Test #8:

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

input:

1 2 1000000000

output:

250000000.000000000000000

result:

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

Test #9:

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

input:

2 1 1000000000

output:

250000000.000000000000000

result:

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

Test #10:

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

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

input:

2 1 1

output:

0.250000000000000

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

result:

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

Test #13:

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

input:

10 1 3

output:

6.750000000000000

result:

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

Test #14:

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

input:

997 993 998244353

output:

1779941051.346162438392639

result:

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

Test #15:

score: 0
Accepted
time: 6ms
memory: 8232kb

input:

988 313 886183312

output:

78753022570.483319215476513

result:

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

Test #16:

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

input:

583 286 322190846

output:

8636356976.843714024871588

result:

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

Test #17:

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

input:

892 468 494964816

output:

17125998682.729238956235349

result:

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

Test #18:

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

input:

26 882 386682745

output:

78231677700.750421971082687

result:

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

Test #19:

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

input:

867 926 422131798

output:

945100500.399107266217470

result:

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

Test #20:

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

input:

37 68 19

output:

62.284459880159053

result:

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

Test #21:

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

input:

23 90 80

output:

860.050698735791088

result:

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

Test #22:

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

input:

43 55 85

output:

118.389267967564183

result:

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

Test #23:

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

input:

93 66 43

output:

97.904840858751091

result:

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

Test #24:

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

input:

78 93 30

output:

44.845452326450609

result:

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

Test #25:

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

input:

9 5 481032867

output:

400507342.366738342010649

result:

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

Test #26:

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

input:

366 73 3

output:

149.486464233095968

result:

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

Test #27:

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

input:

6 4 5

output:

2.894645169728758

result:

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

Test #28:

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

input:

8 10 5

output:

3.397360852474909

result:

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

Test #29:

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

input:

10 1 7

output:

15.750000000000000

result:

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

Test #30:

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

input:

10 7 10

output:

7.371646607394142

result:

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

Test #31:

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

input:

2 8 1

output:

1.327106919465782

result:

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