QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#619578#8339. Rooted TreelzyTL 1500ms3704kbC++14651b2024-10-07 14:42:092024-10-07 14:42:10

Judging History

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

  • [2024-10-07 14:42:10]
  • 评测
  • 测评结果:TL
  • 用时:1500ms
  • 内存:3704kb
  • [2024-10-07 14:42:09]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod=1e9+9;
int qpow(int a,int b){
    int res=1;
    while(b){
        if(b&1)res=res*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return res;
}
signed main() {
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,k;
    cin>>n>>k;
    int av;
    int sum=0,leave=0,siz1=1,siz2=1;
    for(int i=1;i<=k;i++){
        av=leave*qpow(siz2,mod-2)%mod;
        int t=((av+1)*n)%mod;
        sum=(sum+t)%mod;
        leave=(leave+t-av+mod)%mod;
        siz1=(siz1+n)%mod;
        siz2=(siz2+n-1)%mod;
    }
    cout<<sum<<"\n";
    return 0;
}

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: 3648kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

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

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

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

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

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

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: -100
Time Limit Exceeded

input:

28 7304152

output:


result: