I decided to write a blog on this as I was doing a problem on our local judge and I decided to try to speed up my brute force code. However, it was quite difficult to find resources on SIMD vectorisation, so I decided to try to compile some of the resources I found to hopefully allow more people to learn to scam brute force solutions
Thanks to iLoveIOI and jamessngg for proof reading.
Introduction
SIMD stands for single instruction, multiple data. SIMD allows us to give vector instructions which will allow the code to run faster. Vector instructions are instructions that handle short (length 2-16) vectors of integers / floats / characters in a parallel way by making use of the extra bits of space to do operations simultaneously.
The most common form of vectorisation is making use of pragmas such as
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
This form of vectorisation is known as auto-vectorisation as the compiler vectorises the code for you. However, for more complicated examples, the compiler might be unable to detect what to vectorise automatically, so in this case we have to vectorise our code manually by using SIMD vectorisation.
Syntax
The compilation of all the code given in the syntax section is given here
To make use of SIMD, we have to add the following at the top of the code.
#include <nmmintrin.h>
#pragma GCC target("avx2")
Data types
There are three 128 bit data types for integers, floats and doubles respectively.
__m128i i; // stores 4 integers since each integer is 32 bit and 128/32=4
__m128 f; // stores 4 floats since each float is 32 bit and 128/32=4
__m128d d; // stores 2 doubles since each double is 64 bit and 128/64=2
Note that __m128i can also be used to store 32 characters.
256 and 512 bit data types also exist, however, they are quite similar to 128 bit and are not as supported as 128 bit (Codeforces does not support 512 bit) so I will not go through them in much details.
Intrinsics
In order to do operations on these data types, we will make use of SIMD intrinsics.
All the intrinsic functions have the following form _mm_{instruction}_{datatype}, for example, _mm_add_epi32(a, b) is a function to add 32-bit integers from $$$a$$$ and $$$b$$$ together.
Some examples of data-types are
si128— signed 128-bit integerepi8,epi32,epi64,epu8,epu32,epu64— vector of signed 8-bit integers (character), signed 32-bit integers, signed 64-bit integers, together with their unsigned variantsps— 32-bit floatspd— 64-bit doubles
In the following examples, I will be focusing on signed 32-bit integers (i.e. epi32) as it is most commonly used.
Loading
To make use of our __m128i data structure, we first have to load data into it.
__m128i zero = _mm_setzero_si128(); // set everything to 0
__m128i eight = _mm_set1_epi32(8); // set the vector of 4 integers to be equal to 8
__m128i pi = _mm_setr_epi32(3, 1, 4, 1); // NOTE: set and setr are opposites of each other
// mm_setr_epi32(3, 1, 4, 1) -> first value == 3, second value == 1, third value == 4, forth value == 1
// mm_set_epi32(3, 1, 4, 1) -> first value == 1, second value == 4, third value == 1, forth value == 3
int arr[8] = {0, 1, 2, 3, 4, 5, 6, 7};
__m128i a0 = _mm_loadu_si128((__m128i*) &arr[0]); // [0, 1, 2, 3]
__m128i a4 = _mm_loadu_si128((__m128i*) &arr[4]); // [4, 5, 6, 7]
__m128i a2 = _mm_loadu_si128((__m128i*) &arr[2]); // [2, 3, 4, 5]
// _mm_insert_epi32(a, i, j) changes j-th number of a to value i
a2 = _mm_insert_epi32(a2, 99, 1); // [2, 99, 4, 5]
Arithmetic
// Continue from previous code block
__m128i sm = _mm_add_epi32(a0, a4); // [4, 6, 8, 10] (sum i-th element of a0 with i-th element of a4)
__m128i mx = _mm_max_epi32(pi, a0); // [3, 1, 4, 3] (maximum of the i-th element of pi and i-th element of a0)
__m128i sb = _mm_sub_epi32(pi, a0); // [3, 0, 2, -2] (subtract i-th element of a0 from i-th element of pi)
__m128i smallmul = _mm_mullo_epi32(sm, mx); // [12, 6, 32, 30] (multiply i-th element of sm with mx)
__m128i mul = _mm_mul_epi32(sm, mx); // [12, 32] (4*3=12, 8*4=32) (more details below)
Most of the simpler arithmetic operations work by doing the arithmetic operation on each index from 0 to 3. However, for _mm_mul_epi32, since the multiplication of two 32-bit integers will become 64-bit integers, we can only store two 64-bit integers in the result. Hence, _mm_mul_epi32 works by multiplying the 0-th index and 2-nd index.
However, if you are very sure that the multiplication of the numbers do not exceed a 32-bit integer, you can use _mm_mullo_epi32 which will do the multiplication for each index from 0 to 3 but store the result as a 32-bit integer.
Logical Arithmetic
// Continue from previous code block
__m128i three = _mm_set1_epi32(3);
// _mm_cmplt_epi32(a, b) returns mask containing a less than b
__m128i mskl = _mm_cmplt_epi32(pi, three); // contains [0, 2^32-1, 0, 2^32-1] as only 1 < 3
// _mm_cmpgt_epi32(a, b) returns mask containing a greater than b
__m128i mskg = _mm_cmpgt_epi32(pi, three); // contains [0, 0, 2^32-1, 0]
// _mm_cmpeq_epi32(a, b) returns mask containing a equal to b
__m128i mske = _mm_cmpeq_epi32(pi, three); // contains [2^32-1, 0, 0, 0]
__m128i mix = _mm_blendv_epi8(eight, pi, mskl); // contains [8, 1, 8, 1] (more details below)
Most comparison functions are in the form _mm_cmpxx_epi32. Since the functions compare 32-bit integers, if the comparison evaluates to true, all 32 bits will become 1, which is why it is equals to $$$2^{32}-1$$$.
__m128i _mm_blendv_epi8 (__m128i a, __m128i b, __m128i mask)
This function blends 2 vectors together by using the mask. If position $$$i$$$ of the mask is $$$0$$$, position $$$i$$$ of the result will be equals to $$$a$$$. Otherwise if position $$$i$$$ of mask is $$$2^{32}-1$$$, position $$$i$$$ of the result will be equals to $$$b$$$.
Reordering
Sometimes we might need to change the order of the 4 numbers
_mm128i _mm_shuffle_epi32 (__m128i a, int imm8)
imm8 is an 8-bit mask that represents which value is at which position. The position of the first element will be the value formed by the first two bits of imm8, the position of the second element will be the value formed by the third and fourth bits, and so on.
For example, if $$$a = [1, 2, 3, 4]$$$ and $$$\text{imm8} = 39 = \text{0b00100111}$$$, the result is equal to $$$[4, 2, 3, 1]$$$ as the first 2 bits is $$$\text{0b11} = 3$$$, the next 2 bits is $$$\text{0b01} = 1$$$, the following 2 bits is $$$\text{0b10} = 2$$$ and the last 2 bits is $$$\text{0b00} = 0$$$. If $$$\text{imm8} = 170 = \text{0b10101010}$$$, the result is equal to $$$[3, 3, 3, 3]$$$.
_mm128i _mm_slli_si128 (__m128i a, int imm8)
This function can shift the numbers to the left (think of it as left-shift in binary form). However, this function shifts 8 bits at a time, so since we are using 32-bit integers, if we want to shift by 1 position, imm8 has to be equals to 4. For example, if $$$a = [1, 2, 3, 4]$$$ and $$$\text{imm8} = 4$$$, the result is equal to $$$[0, 1, 2, 3]$$$, and if $$$\text{imm8} = 8$$$, the result is equal to $$$[0, 0, 1, 2]$$$.
_mm128i _mm_srli_si128 (__m128i a, int imm8)
Instead of shifting to the left, this function shifts to the right. For example, if $$$a = [1, 2, 3, 4]$$$ and $$$\text{imm8} = 4$$$, the result is equal to $$$[2, 3, 4, 0]$$$.
_mm128i _mm_alignr_epi8 (__m128i a, __m128i b, int imm8)
This function concatenates $$$a$$$ and $$$b$$$ to form 8 elements $$$[b_0, b_1, b_2, b_3, a_0, a_1, a_2, a_3]$$$, then right-shift the 256 bits by $$$\text{imm8} \times 8$$$ bits, and then return the lowest 128 bits. Note that b is before a . Similar to the previous function, since this function shifts 8 bits at a time, if we want to shift by 1 position, imm8 has to be equals to 4.
For example, if $$$a = [1, 2, 3, 4]$$$, $$$b = [5, 6, 7, 8]$$$ and $$$\text{imm8} = 4$$$, the concatenated intermediate will be $$$[5, 6, 7, 8, 1, 2, 3, 4]$$$, so after right shifting by 1 position and taking the first 4 elements, the result is equal to $$$[6, 7, 8, 1]$$$. If $$$\text{imm8} = 8$$$ instead, the result is equal to $$$[7, 8, 1, 2]$$$
Extracting
// Continue from previous code block
int mxarr[4];
_mm_storeu_si128((__m128i*) mxarr, mx); // stores values of mx into mxarr
long long mularr[2];
_mm_storeu_si128((__m128i*) mularr, mul); // stores values of mul into mularr
// mul = [12, 32]
long long mul0 = _mm_extract_epi64(mul, 0); // extract the 0-th element of mul (= 12)
// sm = [4, 6, 8, 10]
int sm0 = _mm_extract_epi32(sm, 2); // extract the 2-nd element of sum (= 8)
Others
// Continue from previous code block
__m128i llsm = _mm_cvtepi32_epi64(sm); // converts first 2 numbers of sm into 64-bit integers
// _mm_extract_epi64(llsm, 0) == 4 && _mm_extract_epi64(llsm, 1) == 6
Examples
Multiplication
Given 2 arrays $$$A$$$ and $$$B$$$ ($$$1 \le A_i, B_i \le 10^9$$$) of length $$$N$$$ ($$$1 \le N \le 2 \cdot 10^5$$$), compute array $$$C$$$ where for all $$$1 \le i \le N$$$, $$$C_i = A_i \cdot B_i$$$.
Solution
Since _mm_mul_epi32 can only multiply 2 numbers at a time, we make use of _mm_shuffle_epi32 to load the integers to the correct position and store the result after multiplication using mm_storeu_si128.
Take note to buffer the array by at least 3 spaces as 4 integers are processed at a time.
Maximum Prefix
Given an array $$$A$$$ ($$$-10^4 \le A_i \le 10^4$$$) of length $$$N$$$ ($$$1 \le N \le 2 \cdot 10^5$$$), we define the prefix sum of $$$A$$$ as an array $$$P$$$ where $$$P_i = \sum_{j=1}^i A_j$$$ for all $$$1 \le i \le N$$$. Find the maximum value in array $$$P$$$.
Solution
Let us observe how we can get the prefix sums of 4 integers $$$[a, b, c, d]$$$ quickly. If we follow a fenwick tree / binary-indexed tree structure, we can observe that we only have to do the following
- Add $$$[0, a, b, c]$$$ to $$$[a, b, c, d]$$$ to get $$$[a, a + b, b + c, c + d]$$$
- Add $$$[0, 0, a, a + b]$$$ to $$$[a, a + b, b + c, c + d]$$$ to get $$$[a, a + b, a + b + c, a + b + c + d]$$$
Notice that the added array in step 1 is basically _mm_slli_si128(a, 4) and step 2 is mm_slli_si128(a, 8).
We can store the maximum by using the function _mm_max_epi32.
At the end, since we stored the maximum in 4 integers, to get the maximum integer among the 4 integers, we can use the same method for prefix sum but replace addition with maximum.
855F - Nagini
Snakes have values $$$l$$$, $$$r$$$ and $$$k$$$ ($$$1 \le l \le r \le 10^5$$$, $$$-10^9 \le k \le 10^9$$$, $$$k \neq 0$$$), indicating that the snake occupies the number line from $$$l$$$ to $$$r$$$ and has a danger value of $$$|k|$$$. If $$$k$$$ is positive, the snake is a type 1 snake, otherwise, it is a type 2 snake. We will define a function $$$f(x)$$$ to be equal to $$$0$$$ if either type 1 or type 2 or both snakes are not present at position $$$x$$$. Otherwise, $$$f(x)$$$ is the sum of the minimum $$$|k|$$$ value of all type 1 snakes at position $$$x$$$ and the minimum $$$|k|$$$ value of all type 2 snakes at position $$$x$$$. There are $$$Q$$$ ($$$1 \le Q \le 5 \cdot 10 ^ 4$$$) queries of 2 types, first is to add a snake, and the second is to calculate sum of $$$f(x)$$$ for all $$$l \le x \le r$$$.
Solution
In order to add a snake, we can make use of the function _mm_min_epi32 to update the minimum $$$|k|$$$ for each type of snake.
To answer the query, we can make use of _mm_cmplt_epi32 to check whether there is a snake occupying the position, and then use _mm_and_epi32 to combine type 1 and type 2 snakes. Using _mm_blendv_epi8 will allow us to set the positions where snakes are gone to be equal to $$$0$$$. Since $$$k$$$ can be up to $$$10^9$$$, we have to store the result in a 64-bit integer, so we use _mm_cvtepi32_epi64 to convert the first 2 integers into a 64-bit integer and add it to the answer.
911G - Mass Change Queries
You have an array $$$A$$$ ($$$1 \le A_i \le 100$$$) of $$$N$$$ ($$$1 \le N \le 2 \cdot 10 ^ 5$$$) integers. You have to process $$$Q$$$ ($$$1 \le Q \le 2 \cdot 10^5$$$) queries, each one in the form $$$l, r, x, y$$$, ($$$1 \le l \le r \le N$$$, $$$1 \le x, y \le 100$$$), meaning that for all $$$l \le i \le r$$$, if $$$A_i = x$$$ change it to $$$A_i = y$$$. Output array $$$A$$$ after all the queries are completed.
Solution
For the replacement of $$$x$$$ to $$$y$$$, we can simply use _mm_cmpeq_epi32 and _mm_blendv_epi8. However, if we try to code it, we will realise that it causes a TLE verdict. To optimise our code even further, we will use 256-bit vectors and store 8-bit integers inside as $$$A_i, x, y \le 100 \le 2^8-1$$$.
To make use of 256-bit vectors, we need to #include <immintrin.h>. Then, replace all __m128i data type with __m256i data type, and rename the functions _mm_... with _mm256_... and ..._si128 with ..._si256.
To use 8-bit integers, we will store the arrays with char and rename the functions ..._epi32 with ..._epi8.
Conclusion
All in all this blog is mostly useless 🤡 However, it might be useful for problem setters to code these SIMD solution to make sure that brute force doesn't pass or if the problem setters troll and this is the intended solution. Please feel free to correct me in the comments below if you find any mistakes or ask any questions in relation to this topic.
If you would like to explore more SIMD functions, you can scroll through the first link in the references section. It is a very clear documentation of all the functions, and it also provides all the required targets for it to work (Codeforces does not support AVX-512, if you want to use it in Atcoder, you need to add #pragma GCC target("avx512vl") at the start)
Also, don't forget to upvote this blog if you learned something new.
References
- https://www.intel.com/content/www/us/en/docs/intrinsics-guide/index.html
- https://www.cs.virginia.edu/~cr4bd/3330/F2018/simdref.html
- https://users.ece.cmu.edu/~franzf/teaching/slides-18-645-simd.pdf
- https://stackoverflow.com/questions/10587598/simd-prefix-sum-on-intel-cpu
- https://codeforces.net/contest/573/submission/12760770
- https://usaco.guide/adv/vectorization?lang=cpp
