QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #463157 | #8339. Rooted Tree | PlentyOfPenalty# | AC ✓ | 60ms | 3724kb | C++20 | 720b | 2024-07-04 14:36:56 | 2024-07-04 14:36:56 |
Judging History
answer
#include <bits/stdc++.h>
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;
const int mod=1e9+9;
int M,K,N,F,S,nw;
int POW(int x,int y){
int ret=1;
while(y)y&1?ret=1ll*ret*x%mod:0,x=1ll*x*x%mod,y>>=1;
return ret;
}
int main() {
#ifdef memset0
//freopen(".in", "r", stdin);
#endif
cin.tie(0)->sync_with_stdio(0);
cin>>M>>K;
N=1,F=0,S=1;
for(int i=K-1;i>=0;--i){
nw=(1+1ll*(M-1)*i)%mod;
F=(1ll*(nw-1+mod)*F+1ll*M*(F+N))%mod;
N=(1ll*(nw-1+mod)*N+1ll*M*N+S)%mod;
S=1ll*S*nw%mod;
//cerr<<"N "<<i<<"="<<N<<"/"<<S<<",F "<<i<<"="<<F<<"/"<<S<<"\n";
}
cout<<1ll*F*POW(S,mod-2)%mod<<"\n";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
input:
6 2
output:
18
result:
ok 1 number(s): "18"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3724kb
input:
2 6
output:
600000038
result:
ok 1 number(s): "600000038"
Test #3:
score: 0
Accepted
time: 4ms
memory: 3712kb
input:
83 613210
output:
424200026
result:
ok 1 number(s): "424200026"
Test #4:
score: 0
Accepted
time: 40ms
memory: 3652kb
input:
48 6713156
output:
198541581
result:
ok 1 number(s): "198541581"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
1 111
output:
6216
result:
ok 1 number(s): "6216"
Test #6:
score: 0
Accepted
time: 44ms
memory: 3652kb
input:
28 7304152
output:
457266679
result:
ok 1 number(s): "457266679"
Test #7:
score: 0
Accepted
time: 25ms
memory: 3632kb
input:
38 4101162
output:
232117382
result:
ok 1 number(s): "232117382"
Test #8:
score: 0
Accepted
time: 60ms
memory: 3712kb
input:
51 9921154
output:
340670552
result:
ok 1 number(s): "340670552"
Test #9:
score: 0
Accepted
time: 11ms
memory: 3668kb
input:
79 1801157
output:
620550406
result:
ok 1 number(s): "620550406"
Test #10:
score: 0
Accepted
time: 33ms
memory: 3588kb
input:
22 5417157
output:
457449071
result:
ok 1 number(s): "457449071"
Test #11:
score: 0
Accepted
time: 20ms
memory: 3588kb
input:
25 3210162
output:
36368303
result:
ok 1 number(s): "36368303"
Test #12:
score: 0
Accepted
time: 18ms
memory: 3652kb
input:
67 2919160
output:
935195555
result:
ok 1 number(s): "935195555"
Test #13:
score: 0
Accepted
time: 52ms
memory: 3648kb
input:
77 8613163
output:
482832472
result:
ok 1 number(s): "482832472"
Test #14:
score: 0
Accepted
time: 60ms
memory: 3668kb
input:
90 10000000
output:
275581651
result:
ok 1 number(s): "275581651"
Test #15:
score: 0
Accepted
time: 60ms
memory: 3668kb
input:
99 9999999
output:
126087169
result:
ok 1 number(s): "126087169"
Test #16:
score: 0
Accepted
time: 60ms
memory: 3676kb
input:
100 10000000
output:
451590067
result:
ok 1 number(s): "451590067"
Extra Test:
score: 0
Extra Test Passed