QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#825039 | #9778. Brotato | ucup-team4474# | AC ✓ | 197ms | 8312kb | C++20 | 4.2kb | 2024-12-21 17:05:17 | 2024-12-21 17:05:18 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using i128 = __int128_t;
bool Memory_begin;
template <int mod>
unsigned int down(unsigned int x)
{
return x >= mod ? x - mod : x;
}
template <int mod>
struct Modint
{
unsigned int x;
Modint() = default;
Modint(unsigned int x) : x(x) {}
friend istream &operator>>(istream &in, Modint &a) { return in >> a.x; }
friend ostream &operator<<(ostream &out, Modint a) { return out << a.x; }
friend Modint operator+(Modint a, Modint b) { return down<mod>(a.x + b.x); }
friend Modint operator-(Modint a, Modint b) { return down<mod>(a.x - b.x + mod); }
friend Modint operator*(Modint a, Modint b) { return 1ULL * a.x * b.x % mod; }
friend Modint operator/(Modint a, Modint b) { return a * ~b; }
friend Modint operator^(Modint a, i64 b)
{
Modint ans = 1;
for (; b; b >>= 1, a *= a)
if (b & 1)
ans *= a;
return ans;
}
friend Modint operator~(Modint a) { return a ^ (mod - 2); }
friend Modint operator-(Modint a) { return down<mod>(mod - a.x); }
friend Modint &operator+=(Modint &a, Modint b) { return a = a + b; }
friend Modint &operator-=(Modint &a, Modint b) { return a = a - b; }
friend Modint &operator*=(Modint &a, Modint b) { return a = a * b; }
friend Modint &operator/=(Modint &a, Modint b) { return a = a / b; }
friend Modint &operator^=(Modint &a, i64 b) { return a = a ^ b; }
friend Modint &operator++(Modint &a) { return a += 1; }
friend Modint operator++(Modint &a, int)
{
Modint x = a;
a += 1;
return x;
}
friend Modint &operator--(Modint &a) { return a -= 1; }
friend Modint operator--(Modint &a, int)
{
Modint x = a;
a -= 1;
return x;
}
friend bool operator==(Modint a, Modint b) { return a.x == b.x; }
friend bool operator!=(Modint a, Modint b) { return !(a == b); }
};
const int mod = 998244353;
typedef Modint<mod> mint;
bool Memory_end;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cerr << (&Memory_end - &Memory_begin) / 1048576.0 << "MB" << '\n';
int n, k;
cin >> n >> k;
const long double e = 1.0;
long double p;
cin >> p;
clock_t cur = clock();
vector<long double> dp(n + 2), a = dp, b = a;
for (int i = n; i >= 1; i--)
{
a[i] = p, b[i] = e;
a[i] += (e - p) * a[i + 1];
b[i] += (e - p) * b[i + 1];
}
dp[1] = b[1] / (e - a[1]);
for (int i = n; i >= 2; i--)
dp[i] = e + p * dp[1] + (e - p) * dp[i + 1];
int idx = 0;
for (int _ = 1; _ <= 300 and k; _++, k--)
{
for (int i = n; i >= 1; i--)
dp[i] = e + p * dp[i] + (e - p) * dp[i + 1];
auto cal = [&](int c) -> long double
{
if (c == n)
return dp[1];
long double d = (e - powl(e - p, n - c)) / p;
long double b = powl(e - p, n - c) * dp[n - c + 1] + d;
long double a = d * p;
return b / (e - a);
// vector<long double> ret(n + 2);
// for (int i = n; i >= n - c + 1; i--)
// {
// ret[i] = e + p * dp[i] + (e - p) * ret[i + 1];
// a[i] = 0, b[i] = ret[i];
// }
// for (int i = n - c; i >= 1; i--)
// {
// a[i] = p, b[i] = e;
// a[i] += (e - p) * a[i + 1];
// b[i] += (e - p) * b[i + 1];
// }
// ret[1] = b[1] / (e - a[1]);
// for (int i = n - c; i >= 2; i--)
// ret[i] = e + p * ret[1] + (e - p) * ret[i + 1];
// return ret;
};
while (idx < n)
{
auto dp1 = cal(idx), dp2 = cal(idx + 1);
if (dp1 > dp2)
idx++;
else
break;
}
dp[1] = cal(idx);
for (int i = n - idx; i >= 2; i--)
dp[i] = e + p * dp[1] + (e - p) * dp[i + 1];
}
cout << fixed << setprecision(10) << dp[1] << '\n';
}
/*
*/
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3988kb
input:
5 0 0.5
output:
62.0000000000
result:
ok found '62.000000000', expected '62.000000000', error '0.000000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 4044kb
input:
5 1 0.5
output:
47.0000000000
result:
ok found '47.000000000', expected '47.000000000', error '0.000000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 4008kb
input:
10000 0 0.002
output:
247489700306.9192301482
result:
ok found '247489700306.919219971', expected '247489700298.253692627', error '0.000000000'
Test #4:
score: 0
Accepted
time: 35ms
memory: 8192kb
input:
100000 10 0.0002
output:
38767507134.1731583849
result:
ok found '38767507134.173156738', expected '38767507133.232215881', error '0.000000000'
Test #5:
score: 0
Accepted
time: 0ms
memory: 8228kb
input:
100000 0 0.0002
output:
2430683127369.9571905136
result:
ok found '2430683127369.957031250', expected '2430683127170.376953125', error '0.000000000'
Test #6:
score: 0
Accepted
time: 56ms
memory: 8232kb
input:
100000 20 0.0002
output:
801073272.2500682236
result:
ok found '801073272.250068188', expected '801073272.231680870', error '0.000000000'
Test #7:
score: 0
Accepted
time: 107ms
memory: 8208kb
input:
100000 40 0.0002
output:
478148.7184350656
result:
ok found '478148.718435066', expected '478148.718426307', error '0.000000000'
Test #8:
score: 0
Accepted
time: 31ms
memory: 8180kb
input:
99995 4 0.0001
output:
38976542.8681762424
result:
ok found '38976542.868176244', expected '38976542.868175834', error '0.000000000'
Test #9:
score: 0
Accepted
time: 56ms
memory: 8256kb
input:
99995 10 0.0001
output:
3549184.5977120507
result:
ok found '3549184.597712051', expected '3549184.597712017', error '0.000000000'
Test #10:
score: 0
Accepted
time: 83ms
memory: 8252kb
input:
99995 16 0.0001
output:
399507.4705567450
result:
ok found '399507.470556745', expected '399507.470556742', error '0.000000000'
Test #11:
score: 0
Accepted
time: 46ms
memory: 8260kb
input:
99990 8 0.0001
output:
7773463.9479307970
result:
ok found '7773463.947930797', expected '7773463.947930722', error '0.000000000'
Test #12:
score: 0
Accepted
time: 56ms
memory: 8180kb
input:
99990 10 0.0001
output:
3547428.9454723307
result:
ok found '3547428.945472331', expected '3547428.945472297', error '0.000000000'
Test #13:
score: 0
Accepted
time: 70ms
memory: 8104kb
input:
99990 12 0.0001
output:
1647102.0204344106
result:
ok found '1647102.020434411', expected '1647102.020434395', error '0.000000000'
Test #14:
score: 0
Accepted
time: 0ms
memory: 4312kb
input:
16664 1 0.0012
output:
257920044631.5096459240
result:
ok found '257920044631.509643555', expected '257920044630.860534668', error '0.000000000'
Test #15:
score: 0
Accepted
time: 11ms
memory: 4380kb
input:
16664 21 0.0012
output:
92190688.5452238461
result:
ok found '92190688.545223847', expected '92190688.544415027', error '0.000000000'
Test #16:
score: 0
Accepted
time: 19ms
memory: 4212kb
input:
16664 41 0.0012
output:
59865.0917863109
result:
ok found '59865.091786311', expected '59865.091785920', error '0.000000000'
Test #17:
score: 0
Accepted
time: 11ms
memory: 4288kb
input:
16659 5 0.0003
output:
63366.2644069548
result:
ok found '63366.264406955', expected '63366.264406955', error '0.000000000'
Test #18:
score: 0
Accepted
time: 14ms
memory: 4232kb
input:
16659 11 0.0003
output:
18120.9118635425
result:
ok found '18120.911863543', expected '18120.911863543', error '0.000000000'
Test #19:
score: 0
Accepted
time: 20ms
memory: 4308kb
input:
16659 17 0.0003
output:
16666.5554519674
result:
ok found '16666.555451967', expected '16666.555451967', error '0.000000000'
Test #20:
score: 0
Accepted
time: 19ms
memory: 4292kb
input:
16654 9 0.0001
output:
16656.0794165756
result:
ok found '16656.079416576', expected '16656.079416576', error '0.000000000'
Test #21:
score: 0
Accepted
time: 19ms
memory: 4232kb
input:
16654 11 0.0001
output:
16655.6741221724
result:
ok found '16655.674122172', expected '16655.674122172', error '0.000000000'
Test #22:
score: 0
Accepted
time: 20ms
memory: 4380kb
input:
16654 13 0.0001
output:
16655.6656953627
result:
ok found '16655.665695363', expected '16655.665695363', error '0.000000000'
Test #23:
score: 0
Accepted
time: 1ms
memory: 4044kb
input:
2774 2 0.0072
output:
28951389306.9781830031
result:
ok found '28951389306.978183746', expected '28951389306.987514496', error '0.000000000'
Test #24:
score: 0
Accepted
time: 2ms
memory: 4176kb
input:
2774 22 0.0072
output:
11312241.4506330652
result:
ok found '11312241.450633066', expected '11312241.450653942', error '0.000000000'
Test #25:
score: 0
Accepted
time: 4ms
memory: 4048kb
input:
2774 42 0.0072
output:
8222.4151084982
result:
ok found '8222.415108498', expected '8222.415108509', error '0.000000000'
Test #26:
score: 0
Accepted
time: 2ms
memory: 4100kb
input:
2769 6 0.0021
output:
13600.5823557316
result:
ok found '13600.582355732', expected '13600.582355732', error '0.000000000'
Test #27:
score: 0
Accepted
time: 3ms
memory: 4132kb
input:
2769 12 0.0021
output:
3239.5499782111
result:
ok found '3239.549978211', expected '3239.549978211', error '0.000000000'
Test #28:
score: 0
Accepted
time: 4ms
memory: 4124kb
input:
2769 18 0.0021
output:
2776.6281948752
result:
ok found '2776.628194875', expected '2776.628194875', error '0.000000000'
Test #29:
score: 0
Accepted
time: 4ms
memory: 4116kb
input:
2764 10 0.0007
output:
2765.9870739551
result:
ok found '2765.987073955', expected '2765.987073955', error '0.000000000'
Test #30:
score: 0
Accepted
time: 4ms
memory: 4136kb
input:
2764 12 0.0007
output:
2765.9373628500
result:
ok found '2765.937362850', expected '2765.937362850', error '0.000000000'
Test #31:
score: 0
Accepted
time: 4ms
memory: 4044kb
input:
2764 14 0.0007
output:
2765.9361767035
result:
ok found '2765.936176704', expected '2765.936176704', error '0.000000000'
Test #32:
score: 0
Accepted
time: 197ms
memory: 8228kb
input:
100000 1000000000 0.0001
output:
100010.0010001001
result:
ok found '100010.001000100', expected '100010.001000100', error '0.000000000'
Test #33:
score: 0
Accepted
time: 1ms
memory: 4008kb
input:
1 1000000000 0.5
output:
2.0000000000
result:
ok found '2.000000000', expected '2.000000000', error '0.000000000'
Test #34:
score: 0
Accepted
time: 1ms
memory: 3920kb
input:
50 50 0.25
output:
66.7341873337
result:
ok found '66.734187334', expected '66.734187334', error '0.000000000'
Test #35:
score: 0
Accepted
time: 1ms
memory: 4072kb
input:
40 100 0.5
output:
788.6331239663
result:
ok found '788.633123966', expected '788.633123966', error '0.000000000'
Test #36:
score: 0
Accepted
time: 1ms
memory: 4000kb
input:
40 160 0.5
output:
80.0000002552
result:
ok found '80.000000255', expected '80.000000255', error '0.000000000'
Test #37:
score: 0
Accepted
time: 1ms
memory: 3976kb
input:
40 162 0.5
output:
80.0000000982
result:
ok found '80.000000098', expected '80.000000098', error '0.000000000'
Test #38:
score: 0
Accepted
time: 0ms
memory: 3984kb
input:
40 1000000000 0.5
output:
80.0000000000
result:
ok found '80.000000000', expected '80.000000000', error '0.000000000'
Test #39:
score: 0
Accepted
time: 0ms
memory: 4004kb
input:
40 0 0.5000
output:
2199023255550.0000000000
result:
ok found '2199023255550.000000000', expected '2199023255550.000000000', error '0.000000000'
Test #40:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
40 1 0.5000
output:
1649267441663.0000000000
result:
ok found '1649267441663.000000000', expected '1649267441663.000000000', error '0.000000000'
Test #41:
score: 0
Accepted
time: 0ms
memory: 4064kb
input:
40 2 0.5000
output:
1236950581248.2500000000
result:
ok found '1236950581248.250000000', expected '1236950581248.250000000', error '0.000000000'
Test #42:
score: 0
Accepted
time: 0ms
memory: 3984kb
input:
40 3 0.5000
output:
962072674305.0000000000
result:
ok found '962072674305.000000000', expected '962072674305.000000000', error '0.000000000'
Test #43:
score: 0
Accepted
time: 0ms
memory: 4056kb
input:
40 4 0.5000
output:
738734374914.2187500000
result:
ok found '738734374914.218750000', expected '738734374914.218750000', error '0.000000000'
Test #44:
score: 0
Accepted
time: 0ms
memory: 4004kb
input:
40 5 0.5000
output:
575525617666.9531250000
result:
ok found '575525617666.953125000', expected '575525617666.953125000', error '0.000000000'
Test #45:
score: 0
Accepted
time: 0ms
memory: 3940kb
input:
40 10 0.5000
output:
173409304583.1325683594
result:
ok found '173409304583.132568359', expected '173409304583.132568359', error '0.000000000'
Test #46:
score: 0
Accepted
time: 0ms
memory: 3980kb
input:
40 15 0.5000
output:
55390502923.0735082626
result:
ok found '55390502923.073509216', expected '55390502923.073509216', error '0.000000000'
Test #47:
score: 0
Accepted
time: 0ms
memory: 3932kb
input:
40 20 0.5000
output:
18180087821.7474045008
result:
ok found '18180087821.747406006', expected '18180087821.747406006', error '0.000000000'
Test #48:
score: 0
Accepted
time: 1ms
memory: 3980kb
input:
40 25 0.5000
output:
5963269457.3187836017
result:
ok found '5963269457.318783760', expected '5963269457.318783760', error '0.000000000'
Test #49:
score: 0
Accepted
time: 1ms
memory: 3984kb
input:
40 30 0.5000
output:
2008652291.2097989810
result:
ok found '2008652291.209799051', expected '2008652291.209799051', error '0.000000000'
Test #50:
score: 0
Accepted
time: 1ms
memory: 3980kb
input:
40 35 0.5000
output:
676323760.7668040633
result:
ok found '676323760.766804099', expected '676323760.766804099', error '0.000000000'
Test #51:
score: 0
Accepted
time: 1ms
memory: 4048kb
input:
40 40 0.5000
output:
231036317.1178015730
result:
ok found '231036317.117801577', expected '231036317.117801577', error '0.000000000'
Test #52:
score: 0
Accepted
time: 1ms
memory: 3984kb
input:
40 45 0.5000
output:
79224360.2456898969
result:
ok found '79224360.245689899', expected '79224360.245689899', error '0.000000000'
Test #53:
score: 0
Accepted
time: 1ms
memory: 3920kb
input:
40 50 0.5000
output:
27134304.8508336109
result:
ok found '27134304.850833610', expected '27134304.850833610', error '0.000000000'
Test #54:
score: 0
Accepted
time: 0ms
memory: 4052kb
input:
2 1 0.0001
output:
2.0002000300
result:
ok found '2.000200030', expected '2.000200030', error '0.000000000'
Test #55:
score: 0
Accepted
time: 1ms
memory: 3988kb
input:
2 0 0.0001
output:
2.0003000400
result:
ok found '2.000300040', expected '2.000300040', error '0.000000000'
Test #56:
score: 0
Accepted
time: 0ms
memory: 4044kb
input:
2 2 0.0001
output:
2.0002000200
result:
ok found '2.000200020', expected '2.000200020', error '0.000000000'
Test #57:
score: 0
Accepted
time: 0ms
memory: 3920kb
input:
2 3 0.0001
output:
2.0002000200
result:
ok found '2.000200020', expected '2.000200020', error '0.000000000'
Test #58:
score: 0
Accepted
time: 128ms
memory: 8312kb
input:
100000 60 0.0002
output:
100020.2748383051
result:
ok found '100020.274838305', expected '100020.274838305', error '0.000000000'
Test #59:
score: 0
Accepted
time: 139ms
memory: 8244kb
input:
100000 80 0.0002
output:
100020.0040008003
result:
ok found '100020.004000800', expected '100020.004000800', error '0.000000000'
Test #60:
score: 0
Accepted
time: 145ms
memory: 8216kb
input:
100000 100 0.0002
output:
100020.0040008002
result:
ok found '100020.004000800', expected '100020.004000800', error '0.000000000'
Test #61:
score: 0
Accepted
time: 147ms
memory: 8248kb
input:
100000 120 0.0002
output:
100020.0040008002
result:
ok found '100020.004000800', expected '100020.004000800', error '0.000000000'
Test #62:
score: 0
Accepted
time: 156ms
memory: 8272kb
input:
100000 140 0.0002
output:
100020.0040008002
result:
ok found '100020.004000800', expected '100020.004000800', error '0.000000000'
Test #63:
score: 0
Accepted
time: 168ms
memory: 8244kb
input:
100000 180 0.0002
output:
100020.0040008002
result:
ok found '100020.004000800', expected '100020.004000800', error '0.000000000'
Test #64:
score: 0
Accepted
time: 131ms
memory: 8240kb
input:
100000 55 0.0002
output:
100070.8503282062
result:
ok found '100070.850328206', expected '100070.850328203', error '0.000000000'
Test #65:
score: 0
Accepted
time: 127ms
memory: 8256kb
input:
100000 50 0.0002
output:
103207.6841932131
result:
ok found '103207.684193213', expected '103207.684193091', error '0.000000000'
Extra Test:
score: 0
Extra Test Passed