QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#732370#8339. Rooted TreeVegetable_Dog#AC ✓1431ms3708kbC++23775b2024-11-10 14:13:392024-11-10 14:13:39

Judging History

This is the latest submission verdict.

  • [2024-11-10 14:13:39]
  • Judged
  • Verdict: AC
  • Time: 1431ms
  • Memory: 3708kb
  • [2024-11-10 14:13:39]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long

int read(){
	int f=0,s=0; char c=getchar();
	while(c>'9'||c<'0')f=(c=='-'),c=getchar();
	while(c>='0'&&c<='9')s=(s<<3)+(s<<1)+(c^'0'),c=getchar();
	return f?-s:s;
}

const int N=1e7+5;
const int mod=1e9+9;
int m,k;
int f,g;
int ksm(int a,int b=mod-2){
	int res=1;
	for(;b;b>>=1,a=1ll*a*a%mod)if(b&1)res=1ll*res*a%mod;
	return res;
}

int main(){
	m=read(); k=read();
	f=g=0;
	// int tm1=clock();
	int cnt=1;
	for(int i=1;i<=k;i++){
		int tf=f,tg=g;
		int tcnt=ksm(cnt);
		int tmp=1ll*tg*tcnt%mod;
		f=(1ll*m*(1+tmp)%mod+tf)%mod;
		cnt+=m-1;
		g=(m+1ll*cnt*tcnt%mod*tg%mod)%mod;
	}
	cout<<f<<endl;
	// int tm2=clock();
	// cout<<1.0*(tm2-tm1)/CLOCKS_PER_SEC;
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

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

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 88ms
memory: 3628kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 961ms
memory: 3640kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

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

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 1042ms
memory: 3508kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 588ms
memory: 3640kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 1421ms
memory: 3552kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

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

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0
Accepted
time: 776ms
memory: 3708kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 460ms
memory: 3640kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 418ms
memory: 3644kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 1233ms
memory: 3580kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 1431ms
memory: 3628kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 1430ms
memory: 3504kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0
Accepted
time: 1431ms
memory: 3628kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed