QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#745758 | #8774. Manhattan Walk | MiniLong | AC ✓ | 15ms | 12652kb | C++20 | 2.9kb | 2024-11-14 11:25:57 | 2024-11-14 11:25:58 |
Judging History
answer
#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
#ifdef ONLINE_JUDGE
char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
#define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
#else
#define get() getchar()
#endif
template<typename T> inline void read(T &t){
T x = 0, f = 1;
char c = getchar();
while(!isdigit(c)){
if(c == '-') f = -f;
c = getchar();
}
while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
t = x * f;
}
template<typename T, typename ... Args> inline void read(T &t, Args&... args){
read(t);
read(args...);
}
template<typename T> void write(T t){
if(t < 0) putchar('-'), t = -t;
if(t >= 10) write(t / 10);
putchar(t % 10 + '0');
}
template<typename T, typename ... Args> void write(T t, Args... args){
write(t), putchar(' '), write(args...);
}
template<typename T> void writeln(T t){
write(t);
puts("");
}
template<typename T> void writes(T t){
write(t), putchar(' ');
}
#undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
const ll mod = 998244353;
ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
void add(ll &x, ll y){x = (x + y) % mod;}
void mul(ll &x, ll y){x = x * y % mod;}
ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1005;
int n, m;
double p;
double f[N][N];
int main(){
read(n, m), scanf("%lf", &p);
_req(i, n, 1){
_req(j, m, 1){
if(i == n && j == m) continue;
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] = a / 2 + ((b - a) / p * ((b - a) / 2 + a) + (p - b + a) / p * b) / 2;
}else if(i == n){
f[i][j] = f[i][j + 1] + p / 4.00;
}else{
f[i][j] = f[i + 1][j] + p / 4.00;
}
}
}
printf("%.10lf\n", f[1][1]);
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 6000kb
input:
2 3 8
output:
2.8750000000
result:
ok found '2.8750000', expected '2.8750000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 1ms
memory: 5940kb
input:
5 5 5
output:
2.4322338689
result:
ok found '2.4322339', expected '2.4322339', error '0.0000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3948kb
input:
1 1 1
output:
0.0000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'
Test #4:
score: 0
Accepted
time: 15ms
memory: 12652kb
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: 3796kb
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: 5936kb
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: 3948kb
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: 5932kb
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: 5928kb
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: 5996kb
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: 5916kb
input:
2 1 1
output:
0.2500000000
result:
ok found '0.2500000', expected '0.2500000', error '0.0000000'
Test #12:
score: 0
Accepted
time: 1ms
memory: 5920kb
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: 3912kb
input:
10 1 3
output:
6.7500000000
result:
ok found '6.7500000', expected '6.7500000', error '0.0000000'
Test #14:
score: 0
Accepted
time: 11ms
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: 5ms
memory: 11340kb
input:
988 313 886183312
output:
78753022570.4833526611
result:
ok found '78753022570.4833527', expected '78753022570.4833527', error '0.0000000'
Test #16:
score: 0
Accepted
time: 0ms
memory: 7936kb
input:
583 286 322190846
output:
8636356976.8437099457
result:
ok found '8636356976.8437099', expected '8636356976.8437138', error '0.0000000'
Test #17:
score: 0
Accepted
time: 3ms
memory: 12620kb
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: 6116kb
input:
26 882 386682745
output:
78231677700.7504882812
result:
ok found '78231677700.7504883', expected '78231677700.7504883', error '0.0000000'
Test #19:
score: 0
Accepted
time: 12ms
memory: 12060kb
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: 6104kb
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: 6032kb
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: 6112kb
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: 4288kb
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: 4260kb
input:
78 93 30
output:
44.8454523265
result:
ok found '44.8454523', expected '44.8454523', error '0.0000000'
Test #25:
score: 0
Accepted
time: 1ms
memory: 5964kb
input:
9 5 481032867
output:
400507342.3667383194
result:
ok found '400507342.3667383', expected '400507342.3667384', error '0.0000000'
Test #26:
score: 0
Accepted
time: 1ms
memory: 5552kb
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: 3908kb
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: 3980kb
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: 1ms
memory: 5876kb
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: 5932kb
input:
2 8 1
output:
1.3271069195
result:
ok found '1.3271069', expected '1.3271069', error '0.0000000'