QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#384868 | #8339. Rooted Tree | triple_dogs# | AC ✓ | 569ms | 120776kb | C++14 | 539b | 2024-04-10 13:24:23 | 2024-04-10 13:24:24 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e7+3;
const int M=1000000009;
int inv[maxn],f[maxn],p[maxn],n,m;
int get_inv(int x){
if (x<maxn) return inv[x];
return M-1ll*(M/x)*get_inv(M%x)%M;
}
int main(){
inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
cin >> m >> n;
p[0]=0; f[0]=0;
for (int i=1;i<=n;i++){
p[i]=(1ll*m*(p[i-1]+1)+1ll*(m-1)*(i-1)*p[i-1])%M*get_inv(i*(m-1)+1)%M;
f[i]=(f[i-1]+1ll*m*(p[i-1]+1))%M;
}
cout << f[n] << endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 38ms
memory: 45772kb
input:
6 2
output:
18
result:
ok 1 number(s): "18"
Test #2:
score: 0
Accepted
time: 40ms
memory: 46580kb
input:
2 6
output:
600000038
result:
ok 1 number(s): "600000038"
Test #3:
score: 0
Accepted
time: 58ms
memory: 51252kb
input:
83 613210
output:
424200026
result:
ok 1 number(s): "424200026"
Test #4:
score: 0
Accepted
time: 346ms
memory: 100268kb
input:
48 6713156
output:
198541581
result:
ok 1 number(s): "198541581"
Test #5:
score: 0
Accepted
time: 36ms
memory: 46156kb
input:
1 111
output:
6216
result:
ok 1 number(s): "6216"
Test #6:
score: 0
Accepted
time: 308ms
memory: 104372kb
input:
28 7304152
output:
457266679
result:
ok 1 number(s): "457266679"
Test #7:
score: 0
Accepted
time: 187ms
memory: 75812kb
input:
38 4101162
output:
232117382
result:
ok 1 number(s): "232117382"
Test #8:
score: 0
Accepted
time: 509ms
memory: 120776kb
input:
51 9921154
output:
340670552
result:
ok 1 number(s): "340670552"
Test #9:
score: 0
Accepted
time: 104ms
memory: 59332kb
input:
79 1801157
output:
620550406
result:
ok 1 number(s): "620550406"
Test #10:
score: 0
Accepted
time: 209ms
memory: 92140kb
input:
22 5417157
output:
457449071
result:
ok 1 number(s): "457449071"
Test #11:
score: 0
Accepted
time: 126ms
memory: 73788kb
input:
25 3210162
output:
36368303
result:
ok 1 number(s): "36368303"
Test #12:
score: 0
Accepted
time: 153ms
memory: 71520kb
input:
67 2919160
output:
935195555
result:
ok 1 number(s): "935195555"
Test #13:
score: 0
Accepted
time: 469ms
memory: 112556kb
input:
77 8613163
output:
482832472
result:
ok 1 number(s): "482832472"
Test #14:
score: 0
Accepted
time: 569ms
memory: 120672kb
input:
90 10000000
output:
275581651
result:
ok 1 number(s): "275581651"
Test #15:
score: 0
Accepted
time: 562ms
memory: 120744kb
input:
99 9999999
output:
126087169
result:
ok 1 number(s): "126087169"
Test #16:
score: 0
Accepted
time: 545ms
memory: 120744kb
input:
100 10000000
output:
451590067
result:
ok 1 number(s): "451590067"
Extra Test:
score: 0
Extra Test Passed