QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#418488	#8339. Rooted Tree	TMM233^#	AC ✓	1151ms	3720kb	C++20	802b	2024-05-23 14:13:37	2024-05-23 14:13:38

Judging History

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

[2024-05-23 14:13:38]
评测

测评结果：AC
用时：1151ms
内存：3720kb

查看

[2024-05-23 14:13:37]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define IOS ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> p;
const int N=1e7+10;
ll ans[2],leaf[2];
ll ksm(ll x,ll y)
{
    ll ans=1;
    for(;y;)
    {
        if(y&1) ans=ans*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return ans;
}
ll get_inv(ll x) {return ksm(x,mod-2);}
int main()
{
    IOS;
    ll m,k;
    cin>>m>>k;
    ans[0]=0;
    leaf[0]=0;
    ll res=0;
    for(int i=1,ii=1;i<=k;i++,ii^=1)
    {
        ans[ii]=(ans[ii^1]+(leaf[ii^1]+1)*m%mod)%mod;
        leaf[ii]=(leaf[ii^1]*(1-1+(i-1)*(m-1)%mod)%mod+(leaf[ii^1]+1)*m%mod)*get_inv(1+i*(m-1)%mod)%mod;
        if(i==k)
        res=ans[ii];
    }
    cout<<res<<'\n';
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3648kb

input:

6 2

output:

result:

ok 1 number(s): "18"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3584kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0

Accepted

time: 71ms

memory: 3580kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0

Accepted

time: 769ms

memory: 3632kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

1 111

output:

result:

ok 1 number(s): "6216"

Test #6:

score: 0

Accepted

time: 837ms

memory: 3644kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0

Accepted

time: 472ms

memory: 3584kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0

Accepted

time: 1142ms

memory: 3656kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0

Accepted

time: 208ms

memory: 3716kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0

Accepted

time: 624ms

memory: 3636kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0

Accepted

time: 370ms

memory: 3640kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0

Accepted

time: 336ms

memory: 3648kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0

Accepted

time: 991ms

memory: 3660kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0

Accepted

time: 1151ms

memory: 3664kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0

Accepted

time: 1147ms

memory: 3720kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0

Accepted

time: 1151ms

memory: 3652kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0

Extra Test Passed