oj.uz

Submission #712812

# Submission time Handle Problem Language Result Execution time Memory
712812 2023-03-20T07:50:06 Z ymm Asceticism (JOI18_asceticism) C++17
100 / 100
 390 ms 5584 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int mod = 1e9+7;

ll pw(ll x, ll y)
{
	ll ans = 1;
	while (y) {
		if (y%2)
			ans = ans*x % mod;
		x = x*x % mod;
		y /= 2;
	}
	return ans;
}
ll inv(ll x) { return pw(x, mod-2); }

const int N = 131072;
ll fct[N], fcti[N];

void init()
{
	fct[0] = 1;
	Loop (i,1,N)
		fct[i] = fct[i-1] * i % mod;
	fcti[N-1] = inv(fct[N-1]);
	LoopR (i,1,N)
		fcti[i-1] = fcti[i] * i % mod;
}

ll C(int n, int r)
{
	if (r < 0 || n < r)
		return 0;
	return fct[n] * fcti[r] % mod * fcti[n-r] % mod;
}

typedef vector<int> poly;
typedef unsigned long long ull;

#define MOD(x) ((x) >= mod? (x) - mod: x)
#define SMOD(x) ((x) = MOD(x))

__attribute__((optimize("O3,unroll-loops"),target("avx")))
void karatsuba(int *__restrict__ a, int *__restrict__ b, int *__restrict__ ans, int *__restrict__ tmp, int n)
{
	if (n <= 16) {
		static ull ansl[32];
		Loop (i,0,2*n-1)
			ansl[i] = 0;
		Loop (i,0,n) Loop (j,0,n)
			ansl[i+j] += (ull)a[i] * b[j];
		Loop (i,0,2*n-1)
			ans[i] = ansl[i] % mod;
		ans[2*n-1] = 0;
		return;
	}
	Loop (i,0,n) {
		tmp[i] = a[i];
		tmp[i+n] = b[i];
	}
	Loop (i,0,n/2)
		a[i+n/2] = b[i];
	karatsuba(a, a+n/2, ans, b, n/2);
	Loop (i,0,n/2) {
		a[i] = tmp[i+n/2];
		a[i+n/2] = tmp[i+n+n/2];
	}
	karatsuba(a, a+n/2, ans+n, b, n/2);
	Loop (i,0,n/2) {
		a[i] = MOD(tmp[i] + tmp[i+n/2]);
		a[i+n/2] = MOD(tmp[i+n] + tmp[i+n+n/2]);
	}
	karatsuba(a, a+n/2, b, tmp, n/2);
	Loop (i,0,n)
		b[i] = MOD(MOD(b[i] + mod - ans[i]) + mod - ans[i+n]);
	Loop (i,0,n)
		ans[i+n/2] = MOD(ans[i+n/2] + b[i]);
}

vector<int> stir;

void init_stir(int m)
{
	poly A(N), B(N);
	Loop (i,0,N) {
		A[i] = pw(i, m) * fcti[i] % mod;
		B[i] = i%2? mod-fcti[i]: fcti[i];
	}
	stir.resize(2*N);
	vector<int> tmp(2*N);
	karatsuba(&A[0], &B[0], &stir[0], &tmp[0], N);
	stir.resize(N);
	Loop (i,0,N)
		stir[i] = fct[i] * stir[i] % mod;
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	ll a, b;
	cin >> b >> a;
	init();
	init_stir(b);
	ll ans = 0;
	Loop (x,0,a) {
		ll dard = stir[a-x] * C(b-a+x, x) % mod;
		ans += x%2? -dard: dard;
	}
	ans = (ans%mod+mod) % mod;
	cout << ans << '\n';
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 5460 KB Output is correct
2 Correct 368 ms 5460 KB Output is correct
3 Correct 367 ms 5460 KB Output is correct
4 Correct 367 ms 5464 KB Output is correct
5 Correct 364 ms 5460 KB Output is correct
6 Correct 361 ms 5580 KB Output is correct
7 Correct 377 ms 5460 KB Output is correct
8 Correct 376 ms 5460 KB Output is correct
9 Correct 366 ms 5460 KB Output is correct
10 Correct 365 ms 5460 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 5460 KB Output is correct
2 Correct 368 ms 5460 KB Output is correct
3 Correct 367 ms 5460 KB Output is correct
4 Correct 367 ms 5464 KB Output is correct
5 Correct 364 ms 5460 KB Output is correct
6 Correct 361 ms 5580 KB Output is correct
7 Correct 377 ms 5460 KB Output is correct
8 Correct 376 ms 5460 KB Output is correct
9 Correct 366 ms 5460 KB Output is correct
10 Correct 365 ms 5460 KB Output is correct
11 Correct 370 ms 5460 KB Output is correct
12 Correct 364 ms 5464 KB Output is correct
13 Correct 367 ms 5580 KB Output is correct
14 Correct 369 ms 5580 KB Output is correct
15 Correct 377 ms 5460 KB Output is correct
16 Correct 371 ms 5464 KB Output is correct
17 Correct 371 ms 5460 KB Output is correct
18 Correct 373 ms 5472 KB Output is correct
19 Correct 371 ms 5580 KB Output is correct
20 Correct 364 ms 5464 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 5460 KB Output is correct
2 Correct 368 ms 5460 KB Output is correct
3 Correct 367 ms 5460 KB Output is correct
4 Correct 367 ms 5464 KB Output is correct
5 Correct 364 ms 5460 KB Output is correct
6 Correct 361 ms 5580 KB Output is correct
7 Correct 377 ms 5460 KB Output is correct
8 Correct 376 ms 5460 KB Output is correct
9 Correct 366 ms 5460 KB Output is correct
10 Correct 365 ms 5460 KB Output is correct
11 Correct 370 ms 5460 KB Output is correct
12 Correct 364 ms 5464 KB Output is correct
13 Correct 367 ms 5580 KB Output is correct
14 Correct 369 ms 5580 KB Output is correct
15 Correct 377 ms 5460 KB Output is correct
16 Correct 371 ms 5464 KB Output is correct
17 Correct 371 ms 5460 KB Output is correct
18 Correct 373 ms 5472 KB Output is correct
19 Correct 371 ms 5580 KB Output is correct
20 Correct 364 ms 5464 KB Output is correct
21 Correct 370 ms 5460 KB Output is correct
22 Correct 372 ms 5468 KB Output is correct
23 Correct 366 ms 5460 KB Output is correct
24 Correct 363 ms 5460 KB Output is correct
25 Correct 375 ms 5584 KB Output is correct
26 Correct 374 ms 5464 KB Output is correct
27 Correct 367 ms 5580 KB Output is correct
28 Correct 365 ms 5580 KB Output is correct
29 Correct 365 ms 5476 KB Output is correct
30 Correct 369 ms 5480 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 5460 KB Output is correct
2 Correct 368 ms 5460 KB Output is correct
3 Correct 367 ms 5460 KB Output is correct
4 Correct 367 ms 5464 KB Output is correct
5 Correct 364 ms 5460 KB Output is correct
6 Correct 361 ms 5580 KB Output is correct
7 Correct 377 ms 5460 KB Output is correct
8 Correct 376 ms 5460 KB Output is correct
9 Correct 366 ms 5460 KB Output is correct
10 Correct 365 ms 5460 KB Output is correct
11 Correct 370 ms 5460 KB Output is correct
12 Correct 364 ms 5464 KB Output is correct
13 Correct 367 ms 5580 KB Output is correct
14 Correct 369 ms 5580 KB Output is correct
15 Correct 377 ms 5460 KB Output is correct
16 Correct 371 ms 5464 KB Output is correct
17 Correct 371 ms 5460 KB Output is correct
18 Correct 373 ms 5472 KB Output is correct
19 Correct 371 ms 5580 KB Output is correct
20 Correct 364 ms 5464 KB Output is correct
21 Correct 370 ms 5460 KB Output is correct
22 Correct 372 ms 5468 KB Output is correct
23 Correct 366 ms 5460 KB Output is correct
24 Correct 363 ms 5460 KB Output is correct
25 Correct 375 ms 5584 KB Output is correct
26 Correct 374 ms 5464 KB Output is correct
27 Correct 367 ms 5580 KB Output is correct
28 Correct 365 ms 5580 KB Output is correct
29 Correct 365 ms 5476 KB Output is correct
30 Correct 369 ms 5480 KB Output is correct
31 Correct 377 ms 5460 KB Output is correct
32 Correct 376 ms 5460 KB Output is correct
33 Correct 379 ms 5464 KB Output is correct
34 Correct 365 ms 5468 KB Output is correct
35 Correct 388 ms 5580 KB Output is correct
36 Correct 390 ms 5460 KB Output is correct
37 Correct 371 ms 5468 KB Output is correct
38 Correct 367 ms 5468 KB Output is correct
39 Correct 367 ms 5476 KB Output is correct
40 Correct 366 ms 5476 KB Output is correct