QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#428321 | #8774. Manhattan Walk | ucup-team3564# | AC ✓ | 15ms | 11792kb | C++20 | 2.2kb | 2024-06-01 18:42:49 | 2024-06-01 18:42:50 |
Judging History
answer
// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\033[32m[" << __LINE__ << "]\033[0m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
x = 0; int f = 1; char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
return x *= f;
}
const int N = 1010;
const double eps = 1e-6;
int n, m, p;
double f[N][N];
signed main() {
read(n), read(m), read(p);
n--, m--;
F(i, 0, n)
F(j, 0, m) {
if (!i && !j) continue;
if (!i) {
f[i][j] = f[i][j - 1] + (p) / 4.0;
// debug << "~ " << f[i][j] << endl;
// debug << "~ " << f[i][j] << endl;
// continue;
} else if (!j) {
f[i][j] = f[i - 1][j] + (p) / 4.0;
// continue;
} else {
// if (i == n && j == m) {
// double a = f[i - 1][j], b = f[i][j - 1];
// if (a > b) swap(a, b);
// f[i][j] += 0.5 * a;
// double delta = b - a;
// int t = delta + eps;
// chkmin(t, p);
// // debug << "! " << a << " " << b << " " << t << endl;
// // debug << "~ " << i << " " << j << ' ' << t << endl;
// f[i][j] += (double) (t + 1) / ((p + 1) * 2) * (a + t / 2.0) + (double) (p - t) / ((p + 1) * 2) * b;
// continue;
// }
double a = f[i - 1][j], b = f[i][j - 1];
if (a > b) swap(a, b);
f[i][j] += 0.5 * a;
double t = b - a;
// t t = delta + eps;
chkmin(t, (double) p);
// debug << "! " << a << " " << b << " " << t << endl;
// debug << "~ " << i << " " << j << ' ' << t << endl;
f[i][j] += (double) (t) / (p * 2) * (a + (t) / 2.0) + (double) (p - t) / (p * 2) * b;
// f[i][j] = max(f[i][j])
}
// debug << i << " " << j << " " << f[i][j] << endl;
}
cout << fixed << setprecision(10) << f[n][m];
return 0;
}
/* why?
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3788kb
input:
2 3 8
output:
2.8750000000
result:
ok found '2.8750000', expected '2.8750000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
5 5 5
output:
2.4322338689
result:
ok found '2.4322339', expected '2.4322339', error '0.0000000'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3916kb
input:
1 1 1
output:
0.0000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'
Test #4:
score: 0
Accepted
time: 9ms
memory: 11792kb
input:
1000 1000 1000000000
output:
1782317138.8083758354
result:
ok found '1782317138.8083758', expected '1782317138.8083761', error '0.0000000'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
1 4 5
output:
3.7500000000
result:
ok found '3.7500000', expected '3.7500000', error '0.0000000'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
4 1 5
output:
3.7500000000
result:
ok found '3.7500000', expected '3.7500000', error '0.0000000'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
1 1 1000000000
output:
0.0000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3872kb
input:
1 2 1000000000
output:
250000000.0000000000
result:
ok found '250000000.0000000', expected '250000000.0000000', error '0.0000000'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
2 1 1000000000
output:
250000000.0000000000
result:
ok found '250000000.0000000', expected '250000000.0000000', error '0.0000000'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
1 2 1
output:
0.2500000000
result:
ok found '0.2500000', expected '0.2500000', error '0.0000000'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
2 1 1
output:
0.2500000000
result:
ok found '0.2500000', expected '0.2500000', error '0.0000000'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3864kb
input:
1 10 3
output:
6.7500000000
result:
ok found '6.7500000', expected '6.7500000', error '0.0000000'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3908kb
input:
10 1 3
output:
6.7500000000
result:
ok found '6.7500000', expected '6.7500000', error '0.0000000'
Test #14:
score: 0
Accepted
time: 15ms
memory: 11784kb
input:
997 993 998244353
output:
1779941051.3461608887
result:
ok found '1779941051.3461609', expected '1779941051.3461628', error '0.0000000'
Test #15:
score: 0
Accepted
time: 4ms
memory: 10640kb
input:
988 313 886183312
output:
78753022570.4833526611
result:
ok found '78753022570.4833527', expected '78753022570.4833527', error '0.0000000'
Test #16:
score: 0
Accepted
time: 5ms
memory: 9104kb
input:
583 286 322190846
output:
8636356976.8437099457
result:
ok found '8636356976.8437099', expected '8636356976.8437138', error '0.0000000'
Test #17:
score: 0
Accepted
time: 2ms
memory: 10804kb
input:
892 468 494964816
output:
17125998682.7292385101
result:
ok found '17125998682.7292385', expected '17125998682.7292328', error '0.0000000'
Test #18:
score: 0
Accepted
time: 1ms
memory: 4108kb
input:
26 882 386682745
output:
78231677700.7504882812
result:
ok found '78231677700.7504883', expected '78231677700.7504883', error '0.0000000'
Test #19:
score: 0
Accepted
time: 11ms
memory: 10704kb
input:
867 926 422131798
output:
945100500.3991073370
result:
ok found '945100500.3991073', expected '945100500.3991071', error '0.0000000'
Test #20:
score: 0
Accepted
time: 1ms
memory: 4004kb
input:
37 68 19
output:
62.2844598802
result:
ok found '62.2844599', expected '62.2844599', error '0.0000000'
Test #21:
score: 0
Accepted
time: 1ms
memory: 3840kb
input:
23 90 80
output:
860.0506987358
result:
ok found '860.0506987', expected '860.0506987', error '0.0000000'
Test #22:
score: 0
Accepted
time: 1ms
memory: 4064kb
input:
43 55 85
output:
118.3892679676
result:
ok found '118.3892680', expected '118.3892680', error '0.0000000'
Test #23:
score: 0
Accepted
time: 1ms
memory: 6292kb
input:
93 66 43
output:
97.9048408588
result:
ok found '97.9048409', expected '97.9048409', error '0.0000000'
Test #24:
score: 0
Accepted
time: 1ms
memory: 4208kb
input:
78 93 30
output:
44.8454523265
result:
ok found '44.8454523', expected '44.8454523', error '0.0000000'
Test #25:
score: 0
Accepted
time: 0ms
memory: 3956kb
input:
9 5 481032867
output:
400507342.3667383194
result:
ok found '400507342.3667383', expected '400507342.3667384', error '0.0000000'
Test #26:
score: 0
Accepted
time: 2ms
memory: 8328kb
input:
366 73 3
output:
149.4864642331
result:
ok found '149.4864642', expected '149.4864642', error '0.0000000'
Test #27:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
6 4 5
output:
2.8946451697
result:
ok found '2.8946452', expected '2.8946452', error '0.0000000'
Test #28:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
8 10 5
output:
3.3973608525
result:
ok found '3.3973609', expected '3.3973609', error '0.0000000'
Test #29:
score: 0
Accepted
time: 0ms
memory: 3952kb
input:
10 1 7
output:
15.7500000000
result:
ok found '15.7500000', expected '15.7500000', error '0.0000000'
Test #30:
score: 0
Accepted
time: 0ms
memory: 4004kb
input:
10 7 10
output:
7.3716466074
result:
ok found '7.3716466', expected '7.3716466', error '0.0000000'
Test #31:
score: 0
Accepted
time: 0ms
memory: 3964kb
input:
2 8 1
output:
1.3271069195
result:
ok found '1.3271069', expected '1.3271069', error '0.0000000'