QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#624151 | #8339. Rooted Tree | Fiatiustitia# | AC ✓ | 1141ms | 3720kb | C++20 | 1.1kb | 2024-10-09 15:06:26 | 2024-10-09 15:06:27 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
const ull P = (1ull << 61) - 1;
const ull B = 131;
const int sz = 100;
const int mod = 1e9 + 9;
ll qpower(ll a, ll b)
{
ll res = 1;
while (b)
{
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b = b / 2;
}
return res;
}
void solve()
{
ll m, k;
ll ans = 0;
ll cnt = 1;
cin >> m >> k;
ll now = 0;
for (int i = 1; i <= k; i++)
{
ans = (ans + now) % mod;
now = (now * (cnt - 1) % mod + (now + 1) * m % mod) % mod;
cnt += (m - 1);
// cout<<now<<'\n';
now = now * qpower(cnt, mod - 2) % mod;
}
ans = (ans + now * cnt % mod) % mod;
cout << ans << '\n';
}
int main()
{
#ifdef LOCAL
freopen("data.in", "r", stdin);
freopen("data.out", "w", stdout);
auto _ = clock();
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
#ifdef LOCAL
cerr << clock() - _ << '\n';
#endif
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
input:
6 2
output:
18
result:
ok 1 number(s): "18"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
2 6
output:
600000038
result:
ok 1 number(s): "600000038"
Test #3:
score: 0
Accepted
time: 71ms
memory: 3616kb
input:
83 613210
output:
424200026
result:
ok 1 number(s): "424200026"
Test #4:
score: 0
Accepted
time: 767ms
memory: 3632kb
input:
48 6713156
output:
198541581
result:
ok 1 number(s): "198541581"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
1 111
output:
6216
result:
ok 1 number(s): "6216"
Test #6:
score: 0
Accepted
time: 834ms
memory: 3712kb
input:
28 7304152
output:
457266679
result:
ok 1 number(s): "457266679"
Test #7:
score: 0
Accepted
time: 468ms
memory: 3664kb
input:
38 4101162
output:
232117382
result:
ok 1 number(s): "232117382"
Test #8:
score: 0
Accepted
time: 1132ms
memory: 3592kb
input:
51 9921154
output:
340670552
result:
ok 1 number(s): "340670552"
Test #9:
score: 0
Accepted
time: 206ms
memory: 3588kb
input:
79 1801157
output:
620550406
result:
ok 1 number(s): "620550406"
Test #10:
score: 0
Accepted
time: 618ms
memory: 3660kb
input:
22 5417157
output:
457449071
result:
ok 1 number(s): "457449071"
Test #11:
score: 0
Accepted
time: 367ms
memory: 3660kb
input:
25 3210162
output:
36368303
result:
ok 1 number(s): "36368303"
Test #12:
score: 0
Accepted
time: 330ms
memory: 3596kb
input:
67 2919160
output:
935195555
result:
ok 1 number(s): "935195555"
Test #13:
score: 0
Accepted
time: 983ms
memory: 3592kb
input:
77 8613163
output:
482832472
result:
ok 1 number(s): "482832472"
Test #14:
score: 0
Accepted
time: 1140ms
memory: 3584kb
input:
90 10000000
output:
275581651
result:
ok 1 number(s): "275581651"
Test #15:
score: 0
Accepted
time: 1141ms
memory: 3588kb
input:
99 9999999
output:
126087169
result:
ok 1 number(s): "126087169"
Test #16:
score: 0
Accepted
time: 1141ms
memory: 3720kb
input:
100 10000000
output:
451590067
result:
ok 1 number(s): "451590067"
Extra Test:
score: 0
Extra Test Passed