結果
問題 | No.2211 Frequency Table of GCD |
ユーザー |
👑 ![]() |
提出日時 | 2023-02-10 21:28:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 41 ms / 2,000 ms |
コード長 | 4,966 bytes |
コンパイル時間 | 1,176 ms |
コンパイル使用メモリ | 89,044 KB |
最終ジャッジ日時 | 2025-02-10 12:13:18 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#line 1 "Main.cpp"#include <iostream>#include <string>#include <vector>#include <algorithm>#include <atcoder/modint>#line 2 "nachia\\array\\divisor-convolution.hpp"#line 4 "nachia\\array\\divisor-convolution.hpp"#include <cassert>#line 2 "nachia\\math\\prime-sieve-explicit.hpp"#line 7 "nachia\\math\\prime-sieve-explicit.hpp"namespace nachia{namespace prime_sieve_explicit_internal{std::vector<bool> isprime = { false }; // a[x] := isprime(2x+1)void CalcIsPrime(int z){if((int)isprime.size() *2+1 < z+1){int new_z = isprime.size();while(new_z*2+1 < z+1) new_z *= 2;z = new_z-1;isprime.resize(z+1, true);for(int i=1; i*(i+1)*2<=z; i++) if(isprime[i]){for(int j=i*(i+1)*2; j<=z; j+=i*2+1) isprime[j] = false;}}}std::vector<int> prime_list = {2};int prime_list_max = 0;void CalcPrimeList(int z){while((int)prime_list.size() < z){if((int)isprime.size() <= prime_list_max + 1) CalcIsPrime(prime_list_max + 1);for(int p=prime_list_max+1; p<(int)isprime.size(); p++){if(isprime[p]) prime_list.push_back(p*2+1);}prime_list_max = isprime.size() - 1;}}void CalcPrimeListUntil(int z){if(prime_list_max < z){CalcIsPrime(z);for(int p=prime_list_max+1; p<(int)isprime.size(); p++){if(isprime[p]) prime_list.push_back(p*2+1);}prime_list_max = isprime.size() - 1;}}}bool IsprimeExplicit(int n){using namespace prime_sieve_explicit_internal;if(n == 2) return true;if(n % 2 == 0) return false;CalcIsPrime(n);return isprime[(n-1)/2];}int NthPrimeExplicit(int n){using namespace prime_sieve_explicit_internal;CalcPrimeList(n);return prime_list[n];}int PrimeCountingExplicit(int n){using namespace prime_sieve_explicit_internal;if(n < 2) return 0;CalcPrimeListUntil(n);auto res = std::upper_bound(prime_list.begin(), prime_list.end(), n) - prime_list.begin();return (int)res;}// [l, r)std::vector<bool> SegmentedSieveExplicit(long long l, long long r){assert(0 <= l); assert(l <= r);long long d = r - l;if(d == 0) return {};std::vector<bool> res(d, true);for(long long p=2; p*p<=r; p++) if(IsprimeExplicit(p)){long long il = (l+p-1)/p, ir = (r+p-1)/p;if(il <= p) il = p;for(long long i=il; i<ir; i++) res[i*p-l] = false;}if(l < 2) for(long long p=l; p<2 && p<r; p++) res[l-p] = false;return res;}} // namespace nachia#line 7 "nachia\\array\\divisor-convolution.hpp"namespace nachia{template<class Elem>void DivisorZeta(::std::vector<Elem>& a){int n = a.size() - 1;for(int d=2; d<=n; d++) if(IsprimeExplicit(d)) for(int i=1; i*d<=n; i++) a[i*d] += a[i];}template<class Elem>void DivisorReversedZeta(::std::vector<Elem>& a){int n = a.size() - 1;for(int d=2; d<=n; d++) if(IsprimeExplicit(d)) for(int i=n/d; i>=1; i--) a[i] += a[i*d];}template<class Elem>void DivisorMobius(::std::vector<Elem>& a){int n = a.size() - 1;for(int d=2; d<=n; d++) if(IsprimeExplicit(d)) for(int i=n/d; i>=1; i--) a[i*d] -= a[i];}template<class Elem>void DivisorReversedMobius(::std::vector<Elem>& a){int n = a.size() - 1;for(int d=2; d<=n; d++) if(IsprimeExplicit(d)) for(int i=1; i*d<=n; i++) a[i] -= a[i*d];}template<class Elem>::std::vector<Elem> GcdConvolution(::std::vector<Elem> a, ::std::vector<Elem> b){assert(a.size() == b.size());assert(1 <= a.size());DivisorReversedZeta(a);DivisorReversedZeta(b);for(int i=1; i<(int)a.size(); i++) a[i] *= b[i];DivisorReversedMobius(a);return a;}template<class Elem>::std::vector<Elem> LcmConvolution(::std::vector<Elem> a, ::std::vector<Elem> b){assert(a.size() == b.size());assert(1 <= a.size());DivisorZeta(a);DivisorZeta(b);for(int i=1; i<(int)a.size(); i++) a[i] *= b[i];DivisorMobius(a);return a;}} // namespace nachia#line 7 "Main.cpp"using namespace std;using i32 = int;using u32 = unsigned int;using i64 = long long;using u64 = unsigned long long;#define rep(i,n) for(int i=0; i<(int)(n); i++)const i64 INF = 1001001001001001001;using Modint = atcoder::static_modint<998244353>;int main(){int N,M; cin >> N >> M;vector<int> A(N); rep(i,N) cin >> A[i];vector<int> C(M+1);rep(i,N) C[A[i]]++;nachia::DivisorReversedZeta(C);vector<Modint> PC(M+1);rep(i,M+1) PC[i] = Modint(2).pow(C[i])-1;nachia::DivisorReversedMobius(PC);for(int i=1; i<=M; i++){cout << PC[i].val() << '\n';}return 0;}struct ios_do_not_sync{ios_do_not_sync(){ios::sync_with_stdio(false);cin.tie(nullptr);}} ios_do_not_sync_instance;