QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#353989#8339. Rooted TreeVengeful_Spirit#AC ✓1410ms81760kbC++14843b2024-03-14 20:18:072024-03-14 20:18:08

Judging History

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

  • [2024-03-14 20:18:08]
  • 评测
  • 测评结果:AC
  • 用时:1410ms
  • 内存:81760kb
  • [2024-03-14 20:18:07]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;

int M,K;
const int mod = 1e9 + 9;
int Add(int x, int y) {return (x + y) % mod;}
int Mul(int x, int y) {return 1ll * x * y % mod;}

int inv(int x) {
    x = x % mod;
    int y = mod - 2, r = 1;
    for(; y; y >>= 1, x = Mul(x, x)) if(y & 1) r = Mul(r, x);
    return r;
}

const int MN = 1e7 + 5;
int E[MN], N[MN];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> M >> K;
    
    int sum = 0;
    N[0] = 1;
    E[0] = 0;
    for(int i = 1; i <= K; ++i) {
        N[i] = Add(N[i-1], M - 1);
        sum = Add(sum, E[i-1]);
        E[i] = Mul(Add(1 + Mul(N[i-1], E[i-1]), Mul(E[i-1]+1, M-1)), inv(N[i]));
        // std::cerr << N[i] << " " << E[i] << " " << sum << "\n";
    }

    cout << Add(sum, Mul(N[K], E[K])) << "\n";
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5684kb

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

score: 0
Accepted
time: 1ms
memory: 5620kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 88ms
memory: 10580kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 927ms
memory: 56672kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

score: 0
Accepted
time: 1ms
memory: 5684kb

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 1000ms
memory: 63972kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 556ms
memory: 39212kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 1383ms
memory: 81452kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0
Accepted
time: 254ms
memory: 20004kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0
Accepted
time: 757ms
memory: 51124kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 446ms
memory: 32624kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 404ms
memory: 27760kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 1207ms
memory: 72404kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 1408ms
memory: 81692kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 1406ms
memory: 81760kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0
Accepted
time: 1410ms
memory: 81728kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed