QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#706989#8339. Rooted TreeGemini7X#AC ✓1194ms3684kbC++14869b2024-11-03 14:14:562024-11-03 14:14:57

Judging History

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

  • [2024-11-03 14:14:57]
  • 评测
  • 测评结果:AC
  • 用时:1194ms
  • 内存:3684kb
  • [2024-11-03 14:14:56]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int ret=0,flg=0;
	char c=getchar();
	while(c<'0'||c>'9')flg|=c=='-',c=getchar();
	while(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',c=getchar();
	return flg?-ret:ret;
}
inline void write(int x,bool flg){
	char a[21];
	if(!x)putchar('0');
	if(x<0)putchar('-'),x=-x;
	int cnt=0;
	while(x){
		a[++cnt]=x%10+'0';
		x/=10;
	}
	while(cnt)putchar(a[cnt--]);
	putchar(flg?'\n':' ');
	return ;
}
const int mod =1e9 +9;
inline int qpow(int x,int y){
	int ret=1,p=x;
	while(y){
		if(y&1)ret=1ll*ret*p%mod;
		y>>=1;
		p=1ll*p*p%mod;
	}return ret;
}
int main(){
	int n=1,sum=0,l=1,d=0,m=read(),k=read();
	for(int i=1;i<=k;i++){
		sum=(sum+1ll*(d+1)*m)%mod;
		d=(1ll*l*d+1ll*(m-1)*(d)+m)%mod*qpow((l+m-1)%mod,mod-2)%mod;
		n=(n+m)%mod;
		l=(l+m-1);
	}write(sum,1);
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3604kb

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3684kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 74ms
memory: 3624kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 797ms
memory: 3680kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 874ms
memory: 3604kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 490ms
memory: 3596kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 1179ms
memory: 3680kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0
Accepted
time: 215ms
memory: 3604kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0
Accepted
time: 646ms
memory: 3596kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 383ms
memory: 3620kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 345ms
memory: 3592kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 1029ms
memory: 3532kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 1194ms
memory: 3684kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 1190ms
memory: 3596kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0
Accepted
time: 1189ms
memory: 3600kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed