結果

問題 No.1307 Rotate and Accumulate
ユーザー stoqstoq
提出日時 2020-11-03 21:09:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 882 ms / 5,000 ms
コード長 3,874 bytes
コンパイル時間 2,261 ms
コンパイル使用メモリ 207,988 KB
実行使用メモリ 41,084 KB
最終ジャッジ日時 2023-10-12 09:52:36
合計ジャッジ時間 11,361 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,352 KB
testcase_01 AC 2 ms
4,352 KB
testcase_02 AC 2 ms
4,352 KB
testcase_03 AC 2 ms
4,352 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 2 ms
4,352 KB
testcase_06 AC 2 ms
4,352 KB
testcase_07 AC 2 ms
4,352 KB
testcase_08 AC 425 ms
23,328 KB
testcase_09 AC 427 ms
23,436 KB
testcase_10 AC 433 ms
22,060 KB
testcase_11 AC 421 ms
23,092 KB
testcase_12 AC 428 ms
22,168 KB
testcase_13 AC 54 ms
5,984 KB
testcase_14 AC 208 ms
12,892 KB
testcase_15 AC 874 ms
40,964 KB
testcase_16 AC 871 ms
41,080 KB
testcase_17 AC 882 ms
40,944 KB
testcase_18 AC 856 ms
40,904 KB
testcase_19 AC 873 ms
41,084 KB
testcase_20 AC 871 ms
40,960 KB
testcase_21 AC 2 ms
4,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 1

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

template <typename U = ld>
struct FFT
{
  void DFT(vector<complex<U>>(&f), int inv)
  {
    int n = f.size();
    if (n == 1)
      return;
    vector<complex<U>> f_[2];
    rep(i, n) f_[i % 2].push_back(f[i]);
    DFT(f_[0], inv);
    DFT(f_[1], inv);
    complex<U> zeta_pow = 1.0, zeta = polar(U(1.0), inv * 2.0 * U(PI) / n);
    rep(i, n)
    {
      f[i] = f_[0][i % (n / 2)] + zeta_pow * f_[1][i % (n / 2)];
      zeta_pow *= zeta;
    }
  }
  template <typename T>
  vector<U> multiply(vector<T> f, vector<T> g)
  {
    int n = 1;
    while (n < f.size() + g.size())
      n *= 2;
    vector<complex<U>> ft(n), gt(n);
    rep(i, f.size()) ft[i] = f[i];
    rep(i, g.size()) gt[i] = g[i];
    DFT(ft, 1);
    DFT(gt, 1);
    rep(i, n) ft[i] *= gt[i];
    DFT(ft, -1);
    vector<U> res;
    rep(i, n) res.push_back(T(ft[i].real() / n));
    return res;
  }
};

void solve()
{
  int n, q;
  assert(cin >> n >> q);
  assert(1 <= n and n <= int(1e5));
  assert(1 <= q and q <= int(2e5));
  vector<double> f(n * 2), g(n + 1, 0);
  rep(i, n)
  {
    cin >> f[i];
    assert(0 <= f[i] and f[i] <= int(1e3));
    f[i + n] = f[i];
  }
  rep(qi, q)
  {
    int r;
    assert(cin >> r);
    assert(0 <= r and r <= n - 1);
    g[n - r]++;
  }
  string temp;
  assert(!(cin >> temp));
  FFT<double> fft;
  vector<double> h = fft.multiply(f, g);
  REP(i, n, 2 * n)
  cout << (int)round(h[i]) << (i == 2 * n - 1 ? "\n" : " ");
}

int main()
{
  solve();
}
0