vector> dp; vector> C; void rec(int i, int j0, int j1, int m0, int m1) { if (j1 < j0) return; int jmid = (j0 + j1) / 2; dp[i][jmid] = INF; int bestk = m0; for (int k = m0; k < min(jmid, m1 + 1); ++k) { if (dp[i - 1][k] + C[k + 1][jmid] < dp[i][jmid]) { dp[i][jmid] = dp[i - 1][k] + C[k + 1][jmid]; bestk = k; }} rec(i, j0, jmid - 1, m0, bestk); rec(i, jmid + 1, j1, bestk, m1); } ll calc(int n, int m) { dp = vector>(m, vector(n, INF)); for (int i = 0; i < n; i++) dp[0][i] = C[0][i]; for (int i = 1; i < m; i++) { rec(i, 0, n - 1, 0, n - 1); } return dp[m - 1][n - 1]; } src='/static/cgit.png' alt='cgit logo'/> index : tcr
Team Contest Reference
summaryrefslogtreecommitdiff
blob: 79fe120611567e5c6ab445adf1e3630e3b97bdb4 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include "../../util.h"
#include <math/transforms/bitwiseTransforms.cpp>

void stress_test() {
	ll queries = 0;
	for (ll i = 0; i < 10'000; i++) {
		int n = 1ll << Random::integer<int>(0, 10);
		auto expected = Random::integers<ll>(n, -1000, 1000);
		auto got = expected;
		bitwiseConv(got, false);
		bitwiseConv(got, true);
		if (got != expected) cerr << "error" << FAIL;
		queries += n;
	}
	cerr << "tested queries: " << queries << endl;
}

constexpr int N = 1ll << 23;
void performance_test() {
	timer t;
	vector<ll> a = Random::integers<ll>(N, -1000, 1000);
	vector<ll> b = Random::integers<ll>(N, -1000, 1000);
	t.start();
	bitwiseConv(a, true);
	bitwiseConv(b, false);
	t.stop();
	hash_t hash = 0;
	for (ll i = 0; i < N; i++) hash += i * a[i];
	for (ll i = 0; i < N; i++) hash += i * b[i];
	if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
	cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}

int main() {
	stress_test();
	if (!sanitize) performance_test();
}