QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#624529	#8339. Rooted Tree	QSteve_Paul	AC ✓	1193ms	3712kb	C++23	1.0kb	2024-10-09 16:02:21	2024-10-09 16:02:21

Judging History

你现在查看的是最新测评结果

[2024-10-09 16:02:21]
评测

测评结果：AC
用时：1193ms
内存：3712kb

查看

[2024-10-09 16:02:21]
提交

answer

#include <bits/stdc++.h>

using namespace std;
using i64 = long long;
constexpr i64 P = 1e9 + 9;

i64 qpow(i64 a, i64 n)
{
    i64 ans = 1;
    a = a % P;
    while (n)
    {
        if (n & 1)
            ans = ans * a % P;
        a = a * a % P;
        n >>= 1;
    }
    return ans;
}

i64 inv(i64 a)
{
    return qpow(a, P - 2);
}

void solve()
{
    i64 m, k;
    cin >> m >> k;
    i64 e = 0;
    i64 ans = 0;
    for (int i = 1; i <= k; i++)
    {
        i64 tmp = inv(((m - 1) % P * (i - 1) % P + 1) % P);
        ans = ans + (e * tmp % P + 1) % P;
        e = (((m - 1) % P * i % P + 1) % P * tmp % P * e % P + m) % P;
    }
    ans = ans * m % P;
    cout << ans << "\n";
}

int main()
{
#ifdef lijn
    freopen("/home/lijn/acm_practice/.build/input.in", "r", stdin);
    freopen("/home/lijn/acm_practice/.build/output.out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3652kb

input:

6 2

output:

result:

ok 1 number(s): "18"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3652kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0

Accepted

time: 74ms

memory: 3652kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0

Accepted

time: 801ms

memory: 3636kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

score: 0

Accepted

time: 0ms

memory: 3648kb

input:

1 111

output:

result:

ok 1 number(s): "6216"

Test #6:

score: 0

Accepted

time: 871ms

memory: 3712kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0

Accepted

time: 490ms

memory: 3584kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0

Accepted

time: 1184ms

memory: 3640kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0

Accepted

time: 215ms

memory: 3584kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0

Accepted

time: 646ms

memory: 3656kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0

Accepted

time: 379ms

memory: 3644kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0

Accepted

time: 348ms

memory: 3648kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0

Accepted

time: 1028ms

memory: 3648kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0

Accepted

time: 1189ms

memory: 3648kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0

Accepted

time: 1192ms

memory: 3700kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0

Accepted

time: 1193ms

memory: 3576kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0

Extra Test Passed