結果
問題 | No.2272 多項式乗算 mod 258280327 |
ユーザー |
|
提出日時 | 2023-04-15 01:50:26 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,142 bytes |
コンパイル時間 | 1,834 ms |
コンパイル使用メモリ | 203,516 KB |
最終ジャッジ日時 | 2025-02-12 08:37:37 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 WA * 2 TLE * 3 |
ソースコード
#include <bits/stdc++.h> using namespace std; #ifdef _RUTHEN #include <debug.hpp> #else #define show(...) true #endif #define REP(i, n) for (int i = 0; i < (n); i++) template <class T> using V = vector<T>; #include <atcoder/modint> using mint = atcoder::static_modint<258280327>; ostream &operator<<(ostream &os, const mint &p) { return os << p.val(); } V<mint> convolution(V<mint> &a, V<mint> &b) { assert(a.size() == b.size()); const int n = (int)a.size(); if (n <= 60) { V<mint> c(n + n - 1); REP(i, n) REP(j, n) c[i + j] += a[i] * b[j]; return c; } const int n2 = (n + 1) / 2; V<mint> a0(n2), a1(n2), b0(n2), b1(n2); for (int i = 0; i < n2; i++) { a0[i] = a[i]; b0[i] = b[i]; } for (int i = n2; i < n; i++) { a1[i - n2] = a[i]; b1[i - n2] = b[i]; } V<mint> a01(n2), b01(n2); REP(i, n2) { a01[i] = a0[i] + a1[i]; b01[i] = b0[i] + b1[i]; } auto c0 = convolution(a0, b0); auto c1 = convolution(a1, b1); auto c2 = convolution(a01, b01); V<mint> c(n2 + n2 + n2 + n2 - 1); REP(i, n2 + n2 - 1) { c[i] += c0[i]; c[i + n2] += c2[i] - c0[i] - c1[i]; c[i + n2 + n2] += c1[i]; } return c; } int main() { ios::sync_with_stdio(false); cin.tie(0); int N; cin >> N; N++; V<mint> A(N); REP(i, N) { long long a; cin >> a; A[i] = mint(a); } int M; cin >> M; M++; V<mint> B(M); REP(i, M) { long long b; cin >> b; B[i] = mint(b); } if (N == 1 and A[0] == 0) { cout << 0 << '\n'; cout << 0 << '\n'; return 0; } if (M == 1 and B[0] == 0) { cout << 0 << '\n'; cout << 0 << '\n'; return 0; } int K = max(N, M); while (A.size() < K) A.push_back(0); while (B.size() < K) B.push_back(0); auto C = convolution(A, B); show(C); while (C.size() > N + M - 1) C.pop_back(); show(C); cout << C.size() - 1 << '\n'; REP(i, C.size()) cout << C[i] << " \n"[i + 1 == C.size()]; return 0; }