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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
#include "../../util.h"
#include <math/modPowIterativ.cpp>
#include <math/transforms/bitwiseTransforms.cpp>
#include <math/transforms/multiplyBitwise.cpp>
vector<ll> naive(const vector<ll>& a, const vector<ll>& b) {
vector<ll> res;
for (ll i = 1;; i *= 2) {
if (ssize(a) <= i && ssize(b) <= i) {
res.resize(i, 0);
break;
}
}
for (int i = 0; i < ssize(a); i++) {
for (int j = 0; j < ssize(b); j++) {
res[i&j] += a[i] * b[j];
}
}
return res;
}
void stress_test() {
ll queries = 0;
for (ll i = 0; i < 10'000; i++) {
int n = Random::integer<int>(1, 100);
int m = Random::integer<int>(1, 100);
auto a = Random::integers<ll>(n, -1000, 1000);
auto b = Random::integers<ll>(m, -1000, 1000);
auto expected = naive(a, b);
auto got = mul(a, b);
if (got != expected) cerr << "error" << FAIL;
queries += n;
}
cerr << "tested queries: " << queries << endl;
}
constexpr int N = 1ll << 22;
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();
auto got = mul(a, b);
t.stop();
hash_t hash = 0;
for (ll i = 0; i < N; i++) hash += i * got[i];
if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}
int main() {
stress_test();
performance_test();
}
|
