QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#680480 | #8774. Manhattan Walk | ahsoltan# | AC ✓ | 17ms | 11172kb | C++20 | 2.1kb | 2024-10-26 21:11:29 | 2024-10-26 21:11:30 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
o << "{";
for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
return o << "}";
}
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
return o << "(" << x.first << ", " << x.second << ")";
}
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif
using db = double;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, m;
cin >> n >> m;
db p;
cin >> p;
--n;
--m;
vector dp(n + 1, vector(m + 1, db(0)));
auto calka = [&](db a, db b) {
if(b < a)
return b * p;
db odl = min(b - a, p);
return (a + a + odl) * odl / 2 + (p - odl) * b;
};
const db inf = 1e18;
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= m; j++) {
if(!i && !j)
continue;
db a = i ? dp[i - 1][j] : inf;
db b = j ? dp[i][j - 1] : inf;
db c0 = calka(a, b);
db c1 = calka(b, a);
db ans = (c0 + c1) / 2 / p;
debug(c0, c1);
debug(i, j, a, b, ans);
dp[i][j] = ans;
}
}
cout << setprecision(9) << fixed << dp[n][m] << endl;
}
/*
[c0, c1]: 0 32
[i, j, a, b, ans]: 0 1 1e+18 0 2
[c0, c1]: 16 48
[i, j, a, b, ans]: 0 2 1e+18 2 4
[c0, c1]: 32 64
[i, j, a, b, ans]: 0 3 1e+18 4 6
[c0, c1]: 32 0
[i, j, a, b, ans]: 1 0 0 1e+18 2
[c0, c1]: 16 16
[i, j, a, b, ans]: 1 1 2 2 2
[c0, c1]: 16 30
[i, j, a, b, ans]: 1 2 4 2 2.875
[c0, c1]: 23 43.1172
[i, j, a, b, ans]: 1 3 6 2.875 4.13232
[c0, c1]: 48 16
[i, j, a, b, ans]: 2 0 2 1e+18 4
[c0, c1]: 30 16
[i, j, a, b, ans]: 2 1 2 4 2.875
[c0, c1]: 23 23
[i, j, a, b, ans]: 2 2 2.875 2.875 2.875
[c0, c1]: 23 32.2682
[i, j, a, b, ans]: 2 3 4.13232 2.875 3.45426
3.454260103
w
w
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
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: 3904kb
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: 3860kb
input:
1 1 1
output:
0.000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'
Test #4:
score: 0
Accepted
time: 14ms
memory: 11172kb
input:
1000 1000 1000000000
output:
1782317138.808377266
result:
ok found '1782317138.8083773', expected '1782317138.8083761', error '0.0000000'
Test #5:
score: 0
Accepted
time: 0ms
memory: 4024kb
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: 3804kb
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: 3808kb
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: 3808kb
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: 3904kb
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: 3812kb
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: 3804kb
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: 3936kb
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: 3816kb
input:
10 1 3
output:
6.750000000
result:
ok found '6.7500000', expected '6.7500000', error '0.0000000'
Test #14:
score: 0
Accepted
time: 17ms
memory: 11140kb
input:
997 993 998244353
output:
1779941051.346163988
result:
ok found '1779941051.3461640', expected '1779941051.3461628', error '0.0000000'
Test #15:
score: 0
Accepted
time: 6ms
memory: 5896kb
input:
988 313 886183312
output:
78753022570.483352661
result:
ok found '78753022570.4833527', expected '78753022570.4833527', error '0.0000000'
Test #16:
score: 0
Accepted
time: 3ms
memory: 4568kb
input:
583 286 322190846
output:
8636356976.843713760
result:
ok found '8636356976.8437138', expected '8636356976.8437138', error '0.0000000'
Test #17:
score: 0
Accepted
time: 3ms
memory: 6624kb
input:
892 468 494964816
output:
17125998682.729236603
result:
ok found '17125998682.7292366', expected '17125998682.7292328', error '0.0000000'
Test #18:
score: 0
Accepted
time: 1ms
memory: 4164kb
input:
26 882 386682745
output:
78231677700.750427246
result:
ok found '78231677700.7504272', expected '78231677700.7504883', error '0.0000000'
Test #19:
score: 0
Accepted
time: 10ms
memory: 9480kb
input:
867 926 422131798
output:
945100500.399106860
result:
ok found '945100500.3991069', expected '945100500.3991071', error '0.0000000'
Test #20:
score: 0
Accepted
time: 0ms
memory: 3884kb
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: 3944kb
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: 3920kb
input:
43 55 85
output:
118.389267968
result:
ok found '118.3892680', expected '118.3892680', error '0.0000000'
Test #23:
score: 0
Accepted
time: 0ms
memory: 3948kb
input:
93 66 43
output:
97.904840859
result:
ok found '97.9048409', expected '97.9048409', error '0.0000000'
Test #24:
score: 0
Accepted
time: 0ms
memory: 3804kb
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: 3832kb
input:
9 5 481032867
output:
400507342.366738439
result:
ok found '400507342.3667384', expected '400507342.3667384', error '0.0000000'
Test #26:
score: 0
Accepted
time: 1ms
memory: 4044kb
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: 3792kb
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: 3800kb
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: 3868kb
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: 3896kb
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: 3808kb
input:
2 8 1
output:
1.327106919
result:
ok found '1.3271069', expected '1.3271069', error '0.0000000'