QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#772839#8339. Rooted Treequannguyen2009AC ✓1118ms3712kbC++23965b2024-11-22 22:19:432024-11-22 22:19:44

Judging History

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

  • [2024-11-22 22:19:44]
  • 评测
  • 测评结果:AC
  • 用时:1118ms
  • 内存:3712kb
  • [2024-11-22 22:19:43]
  • 提交

answer

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;

const int N=1e5+5, mod = 1e9+9, inf = 1e18;

int m, k;

int binpow(int x, int y) {
    int res = 1;
    while(y) {
        if(y&1) res = (res*x)%mod;
        y>>=1;
        x = (x*x)%mod;
    }
    return res;
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> m >> k;
    int ans = 0, cnt = 1, sum = 0;
    for (int i=1; i<=k; i++) {
        int tmp = (sum+1)*m%mod;
        ans = (ans+tmp)%mod;
        tmp = cnt*sum%mod;
        int tmp1 = m*(sum+1)%mod;
        sum = (tmp+tmp1-sum+mod)%mod;
        sum = sum*binpow(cnt+m-1, mod-2)%mod;
        cnt += m-1;
    }
    cout << ans;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

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

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 69ms
memory: 3664kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 750ms
memory: 3588kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

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

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 817ms
memory: 3588kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 460ms
memory: 3584kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 1109ms
memory: 3664kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0
Accepted
time: 202ms
memory: 3672kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0
Accepted
time: 605ms
memory: 3712kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 359ms
memory: 3632kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 326ms
memory: 3588kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 963ms
memory: 3648kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 1117ms
memory: 3652kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 1113ms
memory: 3700kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0
Accepted
time: 1118ms
memory: 3652kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed