QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#515638#8339. Rooted TreeyaoyAC ✓272ms120836kbC++201.2kb2024-08-11 19:54:122024-08-11 19:54:13

Judging History

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

  • [2024-08-11 19:54:13]
  • 评测
  • 测评结果:AC
  • 用时:272ms
  • 内存:120836kb
  • [2024-08-11 19:54:12]
  • 提交

answer

#include <bits/stdc++.h>

using i64 = long long;

constexpr int P = 1E9 + 9;
constexpr int N = 1E7 + 1;
int pre[N], inv[N], E[N];

int norm(int x) {
    if (x >= P) {
        x -= P;
    } else if (x < 0) {
        x += P;
    }
    return x;
}

int power(int x, int exp) {
    int ans = 1;
    x = norm(x);
    while (exp > 0) {
        if (exp % 2) {
            ans = 1LL * ans * x % P;
        }
        x = 1LL * x * x % P;
        exp /= 2;
    }
    return ans;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int M, K;
    std::cin >> M >> K;

    inv[0] = pre[0] = 1;
    for (int i = 1; i < N; i++) {
        pre[i] = 1LL * pre[i - 1] * ((M - 1LL) * i % P + 1) % P;
    }

    int suf = power(pre[N - 1], P - 2);
    for (int i = N - 1; i >= 1; i--) {
        inv[i] = 1LL * suf * pre[i - 1] % P;
        suf = 1LL * suf * ((M - 1LL) * i % P + 1) % P;
    }

    int ans = 0;
    E[0] = 0;
    for (int i = 1; i <= K; i++) {
        int E_dep = 1LL * E[i - 1] * inv[i - 1] % P;
        ans = norm(ans + (E_dep + 1LL) * M % P);
        E[i] = norm(norm(E[i - 1] + E_dep * (M - 1LL) % P) + M);
    }
    std::cout << ans << "\n";

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 99ms
memory: 83388kb

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

score: 0
Accepted
time: 104ms
memory: 83488kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 106ms
memory: 85956kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 215ms
memory: 110576kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

score: 0
Accepted
time: 80ms
memory: 82728kb

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 225ms
memory: 110532kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 170ms
memory: 100340kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 242ms
memory: 120824kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0
Accepted
time: 131ms
memory: 92072kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0
Accepted
time: 173ms
memory: 106532kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 159ms
memory: 96192kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 122ms
memory: 96244kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 224ms
memory: 118752kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 271ms
memory: 120836kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 272ms
memory: 120824kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0
Accepted
time: 267ms
memory: 120808kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed