chore: update minified library versions

Author: github-actions[bot]

cp-algo/min/math/multivar.hpp

@@ -5,6 +5,6 @@
 #include "../math/fft.hpp"
 #pragma GCC push_options
 #pragma GCC target("avx2")
-namespace cp_algo::math::fft{template<modint_type base>struct multivar{big_vector<base>data;big_vector<size_t>ranks;big_vector<size_t>dim;size_t N;size_t rank(size_t i){size_t cur=1,res=0,K=size(dim);for(auto ni:dim){cur*=ni;res+=i/cur;}return res%K;}multivar(auto const&dim):dim(begin(dim),end(dim)),N(std::ranges::fold_left(dim,1,std::multiplies{})){data.resize(N);ranks.resize(N);for(auto[i,x]:ranks|std::views::enumerate){x=rank(i);}checkpoint("multivar init");}void read(){for(auto&it:data){std::cin>>it;}checkpoint("multivar read");}void print(){for(auto&it:data){std::cout<<it<<" ";}std::cout<<"\n";checkpoint("multivar write");}void mul(multivar<base>const&b){assert(dim==b.dim);size_t K=size(dim);if(K==0){data[0]*=b.data[0];return;}big_vector<dft<base>>A,B;size_t M=std::max(flen,std::bit_ceil(2*N-1)/2);for(size_t i=0;i<K;i++){A.emplace_back(data|std::views::enumerate|std::views::transform([&](auto jx)__attribute__((always_inline)){auto[j,x]=jx;return ranks[j]==i?x:base(0);}),M,false);B.emplace_back(b.data|std::views::enumerate|std::views::transform([&](auto jx)__attribute__((always_inline)){auto[j,x]=jx;return ranks[j]==i?x:base(0);}),M,false);}for(size_t i=0;i<K;i++){dft<base>C(M);cvector X=C.A;for(size_t j=0;j<K;j++){size_t tj=(i-j+K)%K;A[j].template dot<false,false>(B[tj].A,B[tj].B,C.A,C.B,X);}checkpoint("dot");big_vector<base>res((N+flen-1)/flen*flen);C.A.template ifft<false>();C.B.template ifft<false>();X.template ifft<false>();C.recover_mod(X,res,N);for(size_t j=0;j<N;j++){if(i==ranks[j]){data[j]=res[j];}}checkpoint("store");}}};}
+namespace cp_algo::math::fft{template<modint_type base>struct multivar{big_vector<base>data;big_vector<size_t>ranks;big_vector<size_t>dim;size_t N;size_t rank(size_t i){size_t cur=1,res=0,K=size(dim);for(auto ni:dim){cur*=ni;res+=i/cur;}return res%K;}multivar(auto const&dim):dim(begin(dim),end(dim)),N(std::ranges::fold_left(dim,1,std::multiplies{})){data.resize(N);ranks.resize(N);for(auto[i,x]:ranks|std::views::enumerate){x=rank(i);}checkpoint("multivar init");}void read(){for(auto&it:data){std::cin>>it;}checkpoint("multivar read");}void print(){for(auto&it:data){std::cout<<it<<" ";}std::cout<<"\n";checkpoint("multivar write");}void mul(multivar<base>const&b){assert(dim==b.dim);size_t K=size(dim);if(K==0){data[0]*=b.data[0];return;}big_vector<dft<base>>A,B;size_t M=std::max(flen,std::bit_ceil(2*N-1)/2);for(size_t i=0;i<K;i++){A.emplace_back(data|std::views::enumerate|std::views::transform([&](auto jx){auto[j,x]=jx;return ranks[j]==i?x:base(0);}),M,false);B.emplace_back(b.data|std::views::enumerate|std::views::transform([&](auto jx){auto[j,x]=jx;return ranks[j]==i?x:base(0);}),M,false);}for(size_t i=0;i<K;i++){dft<base>C(M);cvector X=C.A;for(size_t j=0;j<K;j++){size_t tj=(i-j+K)%K;A[j].template dot<false,false>(B[tj].A,B[tj].B,C.A,C.B,X);}checkpoint("dot");big_vector<base>res((N+flen-1)/flen*flen);C.A.template ifft<false>();C.B.template ifft<false>();X.template ifft<false>();C.recover_mod(X,res,N);for(size_t j=0;j<N;j++){if(i==ranks[j]){data[j]=res[j];}}checkpoint("store");}}};}
 #pragma GCC pop_options
 #endif

cp-algo/min/util/bit.hpp

@@ -4,5 +4,8 @@
 #include <cstdint>
 #include <array>
 #include <bit>
+#pragma GCC push_options
+#pragma GCC target("avx2")
 namespace cp_algo{template<typename Uint>constexpr size_t bit_width=sizeof(Uint)*8;uint64_t mask(size_t n){return(1ULL<<n)-1;}size_t order_of_bit(auto x,size_t k){return k?std::popcount(x<<(bit_width<decltype(x)>-k)):0;}[[gnu::target("bmi2")]]inline size_t kth_set_bit(uint64_t x,size_t k){return std::countr_zero(_pdep_u64(1ULL<<k,x));}template<int fl=0>void with_bit_floor(size_t n,auto&&callback){if constexpr(fl>=63){return;}else if(n>>(fl+1)){with_bit_floor<fl+1>(n,callback);}else{callback.template operator()<1ULL<<fl>();}}void with_bit_ceil(size_t n,auto&&callback){with_bit_floor(n,[&]<size_t N>(){if(N==n){callback.template operator()<N>();}else{callback.template operator()<N<<1>();}});}inline uint32_t read_bits(char const*p){return _mm256_movemask_epi8(__m256i(vector_cast<u8x32 const>(p[0])+(127-'0')));}inline uint64_t read_bits64(char const*p){return read_bits(p)|(uint64_t(read_bits(p+32))<<32);}inline void write_bits(char*p,uint32_t bits){static constexpr u8x32 shuffler={0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3};auto shuffled=u8x32(_mm256_shuffle_epi8(__m256i()+bits,__m256i(shuffler)));static constexpr u8x32 mask={1,2,4,8,16,32,64,128,1,2,4,8,16,32,64,128,1,2,4,8,16,32,64,128,1,2,4,8,16,32,64,128};for(int z=0;z<32;z++){p[z]=shuffled[z]&mask[z]?'1':'0';}}inline void write_bits64(char*p,uint64_t bits){write_bits(p,uint32_t(bits));write_bits(p+32,uint32_t(bits>>32));}}
+#pragma GCC pop_options
 #endif

cp-algo/min/util/simd.hpp

@@ -1,8 +1,5 @@
 #ifndef CP_ALGO_UTIL_SIMD_HPP
 #define CP_ALGO_UTIL_SIMD_HPP
-#define _GLIBCXX_USE_DEPRECATED 0
-#pragma GCC push_options
-#pragma GCC target("avx2")
 #include <experimental/simd>
 #include <cstdint>
 #include <cstddef>