QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#748123	#8339. Rooted Tree	DepletedPrism^#	AC ✓	1387ms	3696kb	C++17	1.2kb	2024-11-14 19:25:15	2024-11-14 19:25:18

Judging History

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

[2024-11-14 19:25:18]
评测

测评结果：AC
用时：1387ms
内存：3696kb

查看

[2024-11-14 19:25:15]
提交

answer

/*
* @Author: zxxzy
* @Date:   2024-10-28 22:26:06
*/
#include <iostream>
#include <algorithm>
#include <cstring>
#include <bitset>
#include <set>
#include <cmath>
#include <vector>
#include <map>
//#define int long long
#define space ' '
#define endl '\n'
#define de(x) cout<<"** "<<x<<" **"<<endl;
#define N 200005
using namespace std;
using ll=long long;
const int mod=1e9+9;
const int INF=0x3f3f3f3f;
const double eps=1e-6;

int ppow(int a,int b){
    int res=1;
    while(b){
        if(b&1){
            res=1ll*res*a%mod;
        }
        a=1ll*a*a%mod;
        b>>=1;
    }
    return res;
}
signed main(){
    #ifdef LOCAL
        freopen("D:\\code2023\\test\\input.txt", "r", stdin);
        freopen("D:\\code2023\\test\\output.txt", "w", stdout);
    #endif
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    ll m,k;
    cin>>m>>k;
    // k--;
    ll ans=0;
    ll erzi=0;
    for(int i=1;i<=k;i++){
        ll tmp=1+(i-1)*(m-1)%mod;
        ll invtmp=ppow(tmp,mod-2);
        ll addans=erzi*(tmp-1+m)%mod*invtmp+m;
                ans+=erzi*invtmp%mod*m%mod+m;
        erzi=addans%mod;

    }
    cout<<ans%mod<<endl;
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3640kb

input:

6 2

output:

result:

ok 1 number(s): "18"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3620kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0

Accepted

time: 86ms

memory: 3596kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0

Accepted

time: 932ms

memory: 3592kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

score: 0

Accepted

time: 0ms

memory: 3584kb

input:

1 111

output:

result:

ok 1 number(s): "6216"

Test #6:

score: 0

Accepted

time: 1014ms

memory: 3528kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0

Accepted

time: 569ms

memory: 3592kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0

Accepted

time: 1377ms

memory: 3684kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0

Accepted

time: 250ms

memory: 3592kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0

Accepted

time: 752ms

memory: 3684kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0

Accepted

time: 446ms

memory: 3684kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0

Accepted

time: 406ms

memory: 3640kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0

Accepted

time: 1191ms

memory: 3684kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0

Accepted

time: 1383ms

memory: 3552kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0

Accepted

time: 1387ms

memory: 3696kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0

Accepted

time: 1387ms

memory: 3640kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0

Extra Test Passed