結果
| 問題 | No.2272 多項式乗算 mod 258280327 |
| ユーザー |
👑  potato167
|
| 提出日時 | 2023-04-14 23:07:42 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 832 ms / 2,000 ms |
| コード長 | 6,309 bytes |
| コンパイル時間 | 3,476 ms |
| コンパイル使用メモリ | 241,912 KB |
| 最終ジャッジ日時 | 2025-02-12 07:53:13 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 33 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (ll i=a;i<b;i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}typedef pair<int, int> Pii;//https://gist.github.com/math314/6a08301b8b75b8172798#define FOR(i,n) for(int i = 0; i < (n); i++)#define sz(c) ((int)(c).size())#define ten(x) ((int)1e##x)template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b-= q * a, a); } return b; }template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }ll mod_pow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }template<int mod, int primitive_root>class NTT {public:int get_mod() const { return mod; }void _ntt(vector<ll>& a, int sign) {const int n = sz(a);assert((n ^ (n&-n)) == 0); //n = 2^kconst int g = 3; //g is primitive root of modint h = (int)mod_pow(g, (mod - 1) / n, mod); // h^n = 1if (sign == -1) h = (int)mod_inv(h, mod); //h = h^-1 % mod//bit reverseint i = 0;for (int j = 1; j < n - 1; ++j) {for (int k = n >> 1; k >(i ^= k); k >>= 1);if (j < i) swap(a[i], a[j]);}for (int m = 1; m < n; m *= 2) {const int m2 = 2 * m;const ll base = mod_pow(h, n / m2, mod);ll w = 1;FOR(x, m) {for (int s = x; s < n; s += m2) {ll u = a[s];ll d = a[s + m] * w % mod;a[s] = u + d;if (a[s] >= mod) a[s] -= mod;a[s + m] = u - d;if (a[s + m] < 0) a[s + m] += mod;}w = w * base % mod;}}for (auto& x : a) if (x < 0) x += mod;}void ntt(vector<ll>& input) {_ntt(input, 1);}void intt(vector<ll>& input) {_ntt(input, -1);const int n_inv = mod_inv(sz(input), mod);for (auto& x : input) x = x * n_inv % mod;}// 畳み込み演算を行うvector<ll> convolution(const vector<ll>& a, const vector<ll>& b){int ntt_size = 1;while (ntt_size < sz(a) + sz(b)) ntt_size *= 2;vector<ll> _a = a, _b = b;_a.resize(ntt_size); _b.resize(ntt_size);ntt(_a);ntt(_b);FOR(i, ntt_size){(_a[i] *= _b[i]) %= mod;}intt(_a);return _a;}};ll garner(vector<Pii> mr, int mod){mr.emplace_back(mod, 0);vector<ll> coffs(sz(mr), 1);vector<ll> constants(sz(mr), 0);FOR(i, sz(mr) - 1){// coffs[i] * v + constants[i] == mr[i].second (mod mr[i].first) を解くll v = (mr[i].second - constants[i]) * mod_inv<ll>(coffs[i], mr[i].first) % mr[i].first;if (v < 0) v += mr[i].first;for (int j = i + 1; j < sz(mr); j++) {(constants[j] += coffs[j] * v) %= mr[j].first;(coffs[j] *= mr[i].first) %= mr[j].first;}}return constants[sz(mr) - 1];}typedef NTT<167772161, 3> NTT_1;typedef NTT<469762049, 3> NTT_2;typedef NTT<1224736769, 3> NTT_3;//任意のmodで畳み込み演算 O(n log n)vector<ll> int32mod_convolution(vector<ll> a, vector<ll> b,int mod){for (auto& x : a) x %= mod;for (auto& x : b) x %= mod;NTT_1 ntt1; NTT_2 ntt2; NTT_3 ntt3;auto x = ntt1.convolution(a, b);auto y = ntt2.convolution(a, b);auto z = ntt3.convolution(a, b);vector<ll> ret(sz(x));vector<Pii> mr(3);FOR(i, sz(x)){mr[0].first = ntt1.get_mod(), mr[0].second = (int)x[i];mr[1].first = ntt2.get_mod(), mr[1].second = (int)y[i];mr[2].first = ntt3.get_mod(), mr[2].second = (int)z[i];ret[i] = garner(mr, mod);}return ret;}// garnerのアルゴリズムを直書きしたversion，速いvector<ll> fast_int32mod_convolution(vector<ll> a, vector<ll> b,int mod){for (auto& x : a) x %= mod;for (auto& x : b) x %= mod;NTT_1 ntt1; NTT_2 ntt2; NTT_3 ntt3;assert(ntt1.get_mod() < ntt2.get_mod() && ntt2.get_mod() < ntt3.get_mod());auto x = ntt1.convolution(a, b);auto y = ntt2.convolution(a, b);auto z = ntt3.convolution(a, b);// garnerのアルゴリズムを極力高速化したconst ll m1 = ntt1.get_mod(), m2 = ntt2.get_mod(), m3 = ntt3.get_mod();const ll m1_inv_m2 = mod_inv<ll>(m1, m2);const ll m12_inv_m3 = mod_inv<ll>(m1 * m2, m3);const ll m12_mod = m1 * m2 % mod;vector<ll> ret(sz(x));FOR(i, sz(x)){ll v1 = (y[i] - x[i]) * m1_inv_m2 % m2;if (v1 < 0) v1 += m2;ll v2 = (z[i] - (x[i] + m1 * v1) % m3) * m12_inv_m3 % m3;if (v2 < 0) v2 += m3;ll constants3 = (x[i] + m1 * v1 + m12_mod * v2) % mod;if (constants3 < 0) constants3 += mod;ret[i] = constants3;}return ret;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){ll X=258280327;int N;cin>>N;N++;vector<ll> A(N);rep(i,0,N){cin>>A[i];}int M;cin>>M;M++;vector<ll> B(M);rep(i,0,M){cin>>B[i];}bool wara=0;if(N==1&&A[0]==0) wara=1;if(M==1&&B[0]==0) wara=1;if(wara) N=1,M=1;auto z=int32mod_convolution(A,B,X);cout<<N+M-2<<"\n";z.resize(N+M-1);for(auto &x:z) x=(x%X+X)%X;vec_out(z);}