QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #668308 | #8339. Rooted Tree | kjhhjki_fan# | AC ✓ | 303ms | 238056kb | C++20 | 806b | 2024-10-23 13:31:26 | 2024-10-23 13:31:26 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define N 10000010
using namespace std;
int m,k;
ll mod=1e9+9,f[N],sum,ny[N],jc[N];
inline ll ksm(ll p,ll k){
ll rt=1;
while(k){
if(k&1) rt=rt*p%mod;
p=p*p%mod;
k>>=1;
}
return rt;
}
int main(){
cin>>m>>k;
jc[0]=1;
for(int i=1;i<=k;i++) jc[i]=jc[i-1]*(i*(m-1)+1)%mod;
ll fz=ksm(jc[k],mod-2);
for(int i=k;i>=1;i--){
ny[i]=fz*jc[i-1]%mod;
fz*=(i*(m-1)+1);
fz%=mod;
}
for(int i=1;i<=k;i++){
f[i]=((i-1)*(m-1)*f[i-1]+m*(f[i-1]+1))%mod*ny[i]%mod;
sum+=(f[i-1]+1)*m;
sum%=mod;
}
cout<<sum;
return 0;
}
/*
int main(){
cin>>m>>k;
for(int i=1;i<=k;i++){
f[i]=((i-1)*(m-1)*f[i-1]+m*(f[i-1]+1))%mod*ksm(i*(m-1)+1,mod-2)%mod;
sum+=(f[i-1]+1)*m;
sum%=mod;
}
cout<<sum;
return 0;
}
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5660kb
input:
6 2
output:
18
result:
ok 1 number(s): "18"
Test #2:
score: 0
Accepted
time: 1ms
memory: 5668kb
input:
2 6
output:
600000038
result:
ok 1 number(s): "600000038"
Test #3:
score: 0
Accepted
time: 15ms
memory: 24824kb
input:
83 613210
output:
424200026
result:
ok 1 number(s): "424200026"
Test #4:
score: 0
Accepted
time: 211ms
memory: 162780kb
input:
48 6713156
output:
198541581
result:
ok 1 number(s): "198541581"
Test #5:
score: 0
Accepted
time: 0ms
memory: 5740kb
input:
1 111
output:
6216
result:
ok 1 number(s): "6216"
Test #6:
score: 0
Accepted
time: 215ms
memory: 177356kb
input:
28 7304152
output:
457266679
result:
ok 1 number(s): "457266679"
Test #7:
score: 0
Accepted
time: 129ms
memory: 105964kb
input:
38 4101162
output:
232117382
result:
ok 1 number(s): "232117382"
Test #8:
score: 0
Accepted
time: 302ms
memory: 237364kb
input:
51 9921154
output:
340670552
result:
ok 1 number(s): "340670552"
Test #9:
score: 0
Accepted
time: 61ms
memory: 49768kb
input:
79 1801157
output:
620550406
result:
ok 1 number(s): "620550406"
Test #10:
score: 0
Accepted
time: 122ms
memory: 135004kb
input:
22 5417157
output:
457449071
result:
ok 1 number(s): "457449071"
Test #11:
score: 0
Accepted
time: 95ms
memory: 82740kb
input:
25 3210162
output:
36368303
result:
ok 1 number(s): "36368303"
Test #12:
score: 0
Accepted
time: 86ms
memory: 74556kb
input:
67 2919160
output:
935195555
result:
ok 1 number(s): "935195555"
Test #13:
score: 0
Accepted
time: 245ms
memory: 208436kb
input:
77 8613163
output:
482832472
result:
ok 1 number(s): "482832472"
Test #14:
score: 0
Accepted
time: 216ms
memory: 238056kb
input:
90 10000000
output:
275581651
result:
ok 1 number(s): "275581651"
Test #15:
score: 0
Accepted
time: 303ms
memory: 237860kb
input:
99 9999999
output:
126087169
result:
ok 1 number(s): "126087169"
Test #16:
score: 0
Accepted
time: 227ms
memory: 237980kb
input:
100 10000000
output:
451590067
result:
ok 1 number(s): "451590067"
Extra Test:
score: 0
Extra Test Passed