QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #713775 | #8339. Rooted Tree | DUDU666 | AC ✓ | 211ms | 160148kb | C++20 | 989b | 2024-11-05 20:31:22 | 2024-11-05 20:31:22 |
Judging History
answer
#include<cstdio>
#include<iostream>
#define RI register int
#define CI const int&
using namespace std;
const int N=1e7+5,mod=1e9+9;
int m,k,a[N],p[N],ip[N],inv[N];
inline int quick_pow(int x,int p=mod-2,int mul=1)
{
for (;p;p>>=1,x=1LL*x*x%mod) if (p&1) mul=1LL*mul*x%mod; return mul;
}
int main()
{
scanf("%d%d",&m,&k); int leaf=1,ans=0,E=0;
a[0]=1; for (RI i=1;i<=k;++i) a[i]=a[i-1]+m-1;
p[0]=1; for (RI i=1;i<=k;++i) p[i]=1LL*p[i-1]*a[i]%mod;
ip[k]=quick_pow(p[k]);
for (RI i=k-1;i>=1;--i) ip[i]=1LL*ip[i+1]*a[i+1]%mod;
for (RI i=1;i<=k;++i) inv[i]=1LL*ip[i]*p[i-1]%mod;
// for (RI i=1;i<=k;++i) printf("%d%c",a[i]," \n"[i==k]);
// for (RI i=1;i<=k;++i) printf("%d%c",inv[i]," \n"[i==k]);
for (RI i=1;i<=k;++i)
{
int tmp=1LL*(E+1)*m%mod;
(ans+=tmp)%=mod;
E=(1LL*E*(leaf-1)%mod+tmp)*inv[i]%mod;
// printf("E = %d\n",E);
leaf+=m-1;
}
return printf("%d",ans),0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 10012kb
input:
6 2
output:
18
result:
ok 1 number(s): "18"
Test #2:
score: 0
Accepted
time: 1ms
memory: 10012kb
input:
2 6
output:
600000038
result:
ok 1 number(s): "600000038"
Test #3:
score: 0
Accepted
time: 18ms
memory: 22776kb
input:
83 613210
output:
424200026
result:
ok 1 number(s): "424200026"
Test #4:
score: 0
Accepted
time: 158ms
memory: 117352kb
input:
48 6713156
output:
198541581
result:
ok 1 number(s): "198541581"
Test #5:
score: 0
Accepted
time: 0ms
memory: 9996kb
input:
1 111
output:
6216
result:
ok 1 number(s): "6216"
Test #6:
score: 0
Accepted
time: 165ms
memory: 122736kb
input:
28 7304152
output:
457266679
result:
ok 1 number(s): "457266679"
Test #7:
score: 0
Accepted
time: 93ms
memory: 76228kb
input:
38 4101162
output:
232117382
result:
ok 1 number(s): "232117382"
Test #8:
score: 0
Accepted
time: 211ms
memory: 159844kb
input:
51 9921154
output:
340670552
result:
ok 1 number(s): "340670552"
Test #9:
score: 0
Accepted
time: 32ms
memory: 37912kb
input:
79 1801157
output:
620550406
result:
ok 1 number(s): "620550406"
Test #10:
score: 0
Accepted
time: 115ms
memory: 93088kb
input:
22 5417157
output:
457449071
result:
ok 1 number(s): "457449071"
Test #11:
score: 0
Accepted
time: 61ms
memory: 60396kb
input:
25 3210162
output:
36368303
result:
ok 1 number(s): "36368303"
Test #12:
score: 0
Accepted
time: 74ms
memory: 59716kb
input:
67 2919160
output:
935195555
result:
ok 1 number(s): "935195555"
Test #13:
score: 0
Accepted
time: 186ms
memory: 144360kb
input:
77 8613163
output:
482832472
result:
ok 1 number(s): "482832472"
Test #14:
score: 0
Accepted
time: 209ms
memory: 160100kb
input:
90 10000000
output:
275581651
result:
ok 1 number(s): "275581651"
Test #15:
score: 0
Accepted
time: 206ms
memory: 160148kb
input:
99 9999999
output:
126087169
result:
ok 1 number(s): "126087169"
Test #16:
score: 0
Accepted
time: 207ms
memory: 160024kb
input:
100 10000000
output:
451590067
result:
ok 1 number(s): "451590067"
Extra Test:
score: 0
Extra Test Passed