oj.uz

Submission #712847

# Submission time Handle Problem Language Result Execution time Memory
712847 2023-03-20T08:17:02 Z ymm Asceticism (JOI18_asceticism) C++17
100 / 100
 396 ms 5100 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 = 100'010;
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)

template<int n>
void karatsuba(int *__restrict__ a, int *__restrict__ b, int *__restrict__ ans, int *__restrict__ tmp, int rem)
{
	if (rem <= 0) {
		fill(ans, ans+2*n, 0);
		return;
	}
	if constexpr (n <= 8) {
		static ull ansl[2*n];
		Loop (i,0,2*n)
			ansl[i] = 0;
		Loop (i,0,n) Loop (j,0,n)
			ansl[i+j] += (ull)a[i] * b[j];
		Loop (i,0,2*n)
			ans[i] = ansl[i] % mod;
		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<n/2>(a, a+n/2, ans, b, rem);
	Loop (i,0,n/2) {
		a[i] = tmp[i+n/2];
		a[i+n/2] = tmp[i+n+n/2];
	}
	karatsuba<n/2>(a, a+n/2, ans+n, b, rem - 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<n/2>(a, a+n/2, b, tmp, rem - 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)
{
	const int M = 131072;
	poly A(M), B(M);
	Loop (i,0,N) {
		A[i] = pw(i, m) * fcti[i] % mod;
		B[i] = i%2? mod-fcti[i]: fcti[i];
	}
	stir.resize(2*M);
	vector<int> tmp(2*M);
	karatsuba<M>(&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';
}

Compilation message

asceticism.cpp: In instantiation of 'void karatsuba(int*, int*, int*, int*, int) [with int n = 1]':
asceticism.cpp:72:16:   recursively required from 'void karatsuba(int*, int*, int*, int*, int) [with int n = 65536]'
asceticism.cpp:72:16:   required from 'void karatsuba(int*, int*, int*, int*, int) [with int n = 131072]'
asceticism.cpp:101:49:   required from here
asceticism.cpp:72:16: warning: passing argument 1 to 'restrict'-qualified parameter aliases with argument 2 [-Wrestrict]
   72 |  karatsuba<n/2>(a, a+n/2, ans, b, rem);
      |  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
asceticism.cpp:77:16: warning: passing argument 1 to 'restrict'-qualified parameter aliases with argument 2 [-Wrestrict]
   77 |  karatsuba<n/2>(a, a+n/2, ans+n, b, rem - n/2);
      |  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
asceticism.cpp:82:16: warning: passing argument 1 to 'restrict'-qualified parameter aliases with argument 2 [-Wrestrict]
   82 |  karatsuba<n/2>(a, a+n/2, b, tmp, rem - n/2);
      |  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
asceticism.cpp: In instantiation of 'void karatsuba(int*, int*, int*, int*, int) [with int n = 0]':
asceticism.cpp:72:16:   recursively required from 'void karatsuba(int*, int*, int*, int*, int) [with int n = 65536]'
asceticism.cpp:72:16:   required from 'void karatsuba(int*, int*, int*, int*, int) [with int n = 131072]'
asceticism.cpp:101:49:   required from here
asceticism.cpp:72:16: warning: passing argument 1 to 'restrict'-qualified parameter aliases with argument 2 [-Wrestrict]
   72 |  karatsuba<n/2>(a, a+n/2, ans, b, rem);
      |  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
asceticism.cpp:77:16: warning: passing argument 1 to 'restrict'-qualified parameter aliases with argument 2 [-Wrestrict]
   77 |  karatsuba<n/2>(a, a+n/2, ans+n, b, rem - n/2);
      |  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
asceticism.cpp:82:16: warning: passing argument 1 to 'restrict'-qualified parameter aliases with argument 2 [-Wrestrict]
   82 |  karatsuba<n/2>(a, a+n/2, b, tmp, rem - n/2);
      |  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 4964 KB Output is correct
2 Correct 394 ms 4976 KB Output is correct
3 Correct 395 ms 4972 KB Output is correct
4 Correct 390 ms 4948 KB Output is correct
5 Correct 393 ms 4976 KB Output is correct
6 Correct 384 ms 4948 KB Output is correct
7 Correct 380 ms 4964 KB Output is correct
8 Correct 368 ms 4964 KB Output is correct
9 Correct 372 ms 4968 KB Output is correct
10 Correct 379 ms 4948 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 4964 KB Output is correct
2 Correct 394 ms 4976 KB Output is correct
3 Correct 395 ms 4972 KB Output is correct
4 Correct 390 ms 4948 KB Output is correct
5 Correct 393 ms 4976 KB Output is correct
6 Correct 384 ms 4948 KB Output is correct
7 Correct 380 ms 4964 KB Output is correct
8 Correct 368 ms 4964 KB Output is correct
9 Correct 372 ms 4968 KB Output is correct
10 Correct 379 ms 4948 KB Output is correct
11 Correct 378 ms 4972 KB Output is correct
12 Correct 382 ms 4984 KB Output is correct
13 Correct 378 ms 4968 KB Output is correct
14 Correct 371 ms 4948 KB Output is correct
15 Correct 377 ms 4968 KB Output is correct
16 Correct 385 ms 4968 KB Output is correct
17 Correct 396 ms 4948 KB Output is correct
18 Correct 375 ms 4964 KB Output is correct
19 Correct 390 ms 5100 KB Output is correct
20 Correct 377 ms 4972 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 4964 KB Output is correct
2 Correct 394 ms 4976 KB Output is correct
3 Correct 395 ms 4972 KB Output is correct
4 Correct 390 ms 4948 KB Output is correct
5 Correct 393 ms 4976 KB Output is correct
6 Correct 384 ms 4948 KB Output is correct
7 Correct 380 ms 4964 KB Output is correct
8 Correct 368 ms 4964 KB Output is correct
9 Correct 372 ms 4968 KB Output is correct
10 Correct 379 ms 4948 KB Output is correct
11 Correct 378 ms 4972 KB Output is correct
12 Correct 382 ms 4984 KB Output is correct
13 Correct 378 ms 4968 KB Output is correct
14 Correct 371 ms 4948 KB Output is correct
15 Correct 377 ms 4968 KB Output is correct
16 Correct 385 ms 4968 KB Output is correct
17 Correct 396 ms 4948 KB Output is correct
18 Correct 375 ms 4964 KB Output is correct
19 Correct 390 ms 5100 KB Output is correct
20 Correct 377 ms 4972 KB Output is correct
21 Correct 384 ms 5068 KB Output is correct
22 Correct 383 ms 4972 KB Output is correct
23 Correct 381 ms 4980 KB Output is correct
24 Correct 371 ms 4980 KB Output is correct
25 Correct 376 ms 4968 KB Output is correct
26 Correct 376 ms 4976 KB Output is correct
27 Correct 378 ms 4964 KB Output is correct
28 Correct 380 ms 4972 KB Output is correct
29 Correct 385 ms 4976 KB Output is correct
30 Correct 381 ms 4972 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 4964 KB Output is correct
2 Correct 394 ms 4976 KB Output is correct
3 Correct 395 ms 4972 KB Output is correct
4 Correct 390 ms 4948 KB Output is correct
5 Correct 393 ms 4976 KB Output is correct
6 Correct 384 ms 4948 KB Output is correct
7 Correct 380 ms 4964 KB Output is correct
8 Correct 368 ms 4964 KB Output is correct
9 Correct 372 ms 4968 KB Output is correct
10 Correct 379 ms 4948 KB Output is correct
11 Correct 378 ms 4972 KB Output is correct
12 Correct 382 ms 4984 KB Output is correct
13 Correct 378 ms 4968 KB Output is correct
14 Correct 371 ms 4948 KB Output is correct
15 Correct 377 ms 4968 KB Output is correct
16 Correct 385 ms 4968 KB Output is correct
17 Correct 396 ms 4948 KB Output is correct
18 Correct 375 ms 4964 KB Output is correct
19 Correct 390 ms 5100 KB Output is correct
20 Correct 377 ms 4972 KB Output is correct
21 Correct 384 ms 5068 KB Output is correct
22 Correct 383 ms 4972 KB Output is correct
23 Correct 381 ms 4980 KB Output is correct
24 Correct 371 ms 4980 KB Output is correct
25 Correct 376 ms 4968 KB Output is correct
26 Correct 376 ms 4976 KB Output is correct
27 Correct 378 ms 4964 KB Output is correct
28 Correct 380 ms 4972 KB Output is correct
29 Correct 385 ms 4976 KB Output is correct
30 Correct 381 ms 4972 KB Output is correct
31 Correct 382 ms 4972 KB Output is correct
32 Correct 382 ms 4972 KB Output is correct
33 Correct 378 ms 5096 KB Output is correct
34 Correct 374 ms 4980 KB Output is correct
35 Correct 377 ms 4972 KB Output is correct
36 Correct 383 ms 4980 KB Output is correct
37 Correct 389 ms 5068 KB Output is correct
38 Correct 380 ms 4968 KB Output is correct
39 Correct 384 ms 4968 KB Output is correct
40 Correct 388 ms 4948 KB Output is correct