QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#697795#8339. Rooted TreeUESTC_DebugSimulatorAC ✓1337ms3868kbC++17855b2024-11-01 15:47:582024-11-01 15:47:59

Judging History

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

  • [2024-11-01 15:47:59]
  • 评测
  • 测评结果:AC
  • 用时:1337ms
  • 内存:3868kb
  • [2024-11-01 15:47:58]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lowbit(i) (i&-i)
#define rand() (myrand())
using namespace std;
mt19937 myrand(time(0));
const int mod = 1e9 + 9;
int n, m;
int qpow(int a, int x) {
	int res = 1;
	while(x) {
		if (x&1) res = 1ll*res*a%mod;
		a = 1ll*a*a%mod;
		x >>= 1;
	}
	return res;
}
int Add(int x, int y) {
	if (x + y > mod) return x + y - mod;
	if (x + y < 0) return x + y + mod;
	return x + y;
}
void solve() {
	cin >> m >> n;
	int s = 1, ans = 0, w = 0;
	for (int i = 1 ; i <= n ; ++i) {
		ans = Add(ans, 1ll*(w + 1)*m%mod);
		int ni = qpow(1ll*i*(m - 1)%mod + 1, mod - 2);
		w = Add(w, 1ll*m*ni%mod);
		s = 1ll*s*(1ll*i*(m - 1)%mod + 1)%mod;
	}
	cout << ans << '\n';
}
signed main(void) {
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

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

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 82ms
memory: 3668kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 895ms
memory: 3720kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

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

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 975ms
memory: 3792kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 548ms
memory: 3660kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 1322ms
memory: 3816kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0
Accepted
time: 241ms
memory: 3800kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

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

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 425ms
memory: 3868kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 390ms
memory: 3740kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 1149ms
memory: 3796kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 1336ms
memory: 3800kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 1337ms
memory: 3812kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

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

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed