QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#547846#8339. Rooted TreeShirasuAzusaAC ✓1097ms159932kbC++201.1kb2024-09-05 11:10:452024-09-05 11:10:45

Judging History

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

  • [2024-09-05 11:10:45]
  • 评测
  • 测评结果:AC
  • 用时:1097ms
  • 内存:159932kb
  • [2024-09-05 11:10:45]
  • 提交

answer

#include <bits/stdc++.h>

#define endl "\n"
#define int long long
using namespace std;

typedef pair<int,int> PII;
const int N = 10000000 + 5, MOD = 1e9 + 9;
int k, m;
PII a[N];
int dp[N], f[N];

int read(){
    int x = 0,f = 1;
    char ch = getchar();
    while(!isdigit(ch)){
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while(isdigit(ch)){
        x = (x << 1) + (x << 3) + ch - '0';
        ch = getchar();
    }
    return x * f;
}

int ksm(int a,int b){
    int r = 1;
    while (b){
        if (b & 1) r = r * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return r;
}

void solve(){
    cin >> m >> k;
    f[0] = 1;
    int ans = 0;
    for(int i = 1; i <= k; i++){
        f[i] = (f[i - 1] + m - 1) % MOD;
        dp[i] = ((dp[i - 1] * f[i] % MOD + m) % MOD * ksm(f[i], MOD - 2) % MOD) % MOD;
        ans = (ans + dp[i - 1] % MOD) % MOD;
    }
    cout << (ans + dp[k] * f[k] % MOD) % MOD;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _ = 1;
    // cin >> _;
    while(_--){
        solve();
    }
}


Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3656kb

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 65ms
memory: 16580kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 743ms
memory: 110228kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3628kb

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 790ms
memory: 121412kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 444ms
memory: 69852kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 1070ms
memory: 158568kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0
Accepted
time: 201ms
memory: 33452kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0
Accepted
time: 591ms
memory: 90416kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 354ms
memory: 55128kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 313ms
memory: 51356kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 948ms
memory: 138164kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 1095ms
memory: 159868kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 1097ms
memory: 159932kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0
Accepted
time: 1096ms
memory: 159800kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed