結果

問題 No.1548 [Cherry 2nd Tune B] 貴方と私とサイクルとモーメント
ユーザー ei1333333ei1333333
提出日時 2021-06-11 22:43:02
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 123 ms / 4,500 ms
コード長 9,210 bytes
コンパイル時間 3,395 ms
コンパイル使用メモリ 219,092 KB
実行使用メモリ 24,628 KB
最終ジャッジ日時 2023-08-21 13:27:42
合計ジャッジ時間 9,707 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 78 ms
13,600 KB
testcase_03 AC 25 ms
8,248 KB
testcase_04 AC 70 ms
24,092 KB
testcase_05 AC 8 ms
4,376 KB
testcase_06 AC 55 ms
13,648 KB
testcase_07 AC 63 ms
24,452 KB
testcase_08 AC 77 ms
13,600 KB
testcase_09 AC 54 ms
8,368 KB
testcase_10 AC 52 ms
24,168 KB
testcase_11 AC 62 ms
24,196 KB
testcase_12 AC 39 ms
5,864 KB
testcase_13 AC 37 ms
24,128 KB
testcase_14 AC 58 ms
8,408 KB
testcase_15 AC 39 ms
24,352 KB
testcase_16 AC 62 ms
13,664 KB
testcase_17 AC 80 ms
24,188 KB
testcase_18 AC 65 ms
24,332 KB
testcase_19 AC 32 ms
8,312 KB
testcase_20 AC 47 ms
24,060 KB
testcase_21 AC 50 ms
13,600 KB
testcase_22 AC 100 ms
24,432 KB
testcase_23 AC 101 ms
24,348 KB
testcase_24 AC 100 ms
24,344 KB
testcase_25 AC 98 ms
24,348 KB
testcase_26 AC 100 ms
24,324 KB
testcase_27 AC 100 ms
24,356 KB
testcase_28 AC 100 ms
24,324 KB
testcase_29 AC 99 ms
24,592 KB
testcase_30 AC 100 ms
24,332 KB
testcase_31 AC 100 ms
24,396 KB
testcase_32 AC 79 ms
24,428 KB
testcase_33 AC 78 ms
24,448 KB
testcase_34 AC 78 ms
24,364 KB
testcase_35 AC 78 ms
24,444 KB
testcase_36 AC 79 ms
24,396 KB
testcase_37 AC 123 ms
24,428 KB
testcase_38 AC 78 ms
24,348 KB
testcase_39 AC 81 ms
24,448 KB
testcase_40 AC 79 ms
24,392 KB
testcase_41 AC 80 ms
24,628 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
//const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) {
  if(b < 0)b *= -1;
  return a > b && (a = b, true);
}

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< mod >;

/**
 * @brief Lazy-Segment-Tree(遅延伝搬セグメント木)
 * @docs docs/lazy-segment-tree.md
 */
template< typename Monoid, typename OperatorMonoid, typename F, typename G, typename H >
struct LazySegmentTree {
  int sz, height;
  vector< Monoid > data;
  vector< OperatorMonoid > lazy;
  const F f;
  const G g;
  const H h;
  const Monoid M1;
  const OperatorMonoid OM0;

  LazySegmentTree(int n, const F f, const G g, const H h,
                  const Monoid &M1, const OperatorMonoid OM0)
      : f(f), g(g), h(h), M1(M1), OM0(OM0) {
    sz = 1;
    height = 0;
    while(sz < n) sz <<= 1, height++;
    data.assign(2 * sz, M1);
    lazy.assign(2 * sz, OM0);
  }

  void set(int k, const Monoid &x) {
    data[k + sz] = x;
  }

  void build() {
    for(int k = sz - 1; k > 0; k--) {
      data[k] = f(data[2 * k + 0], data[2 * k + 1]);
    }
  }

  inline void propagate(int k) {
    if(lazy[k] != OM0) {
      lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
      lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
      data[k] = apply(k);
      lazy[k] = OM0;
    }
  }

  inline Monoid apply(int k) {
    return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
  }

  inline void recalc(int k) {
    while(k >>= 1) data[k] = f(apply(2 * k + 0), apply(2 * k + 1));
  }

  inline void thrust(int k) {
    for(int i = height; i > 0; i--) propagate(k >> i);
  }

  void update(int a, int b, const OperatorMonoid &x) {
    if(a >= b) return;
    thrust(a += sz);
    thrust(b += sz - 1);
    for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if(l & 1) lazy[l] = h(lazy[l], x), ++l;
      if(r & 1) --r, lazy[r] = h(lazy[r], x);
    }
    recalc(a);
    recalc(b);
  }

  Monoid query(int a, int b) {
    if(a >= b) return M1;
    thrust(a += sz);
    thrust(b += sz - 1);
    Monoid L = M1, R = M1;
    for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if(l & 1) L = f(L, apply(l++));
      if(r & 1) R = f(apply(--r), R);
    }
    return f(L, R);
  }

  Monoid operator[](const int &k) {
    return query(k, k + 1);
  }

  template< typename C >
  int find_subtree(int a, const C &check, Monoid &M, bool type) {
    while(a < sz) {
      propagate(a);
      Monoid nxt = type ? f(apply(2 * a + type), M) : f(M, apply(2 * a + type));
      if(check(nxt)) a = 2 * a + type;
      else M = nxt, a = 2 * a + 1 - type;
    }
    return a - sz;
  }

  template< typename C >
  int find_first(int a, const C &check) {
    Monoid L = M1;
    if(a <= 0) {
      if(check(f(L, apply(1)))) return find_subtree(1, check, L, false);
      return -1;
    }
    thrust(a + sz);
    int b = sz;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) {
        Monoid nxt = f(L, apply(a));
        if(check(nxt)) return find_subtree(a, check, L, false);
        L = nxt;
        ++a;
      }
    }
    return -1;
  }

  template< typename C >
  int find_last(int b, const C &check) {
    Monoid R = M1;
    if(b >= sz) {
      if(check(f(apply(1), R))) return find_subtree(1, check, R, true);
      return -1;
    }
    thrust(b + sz - 1);
    int a = sz;
    for(b += sz; a < b; a >>= 1, b >>= 1) {
      if(b & 1) {
        Monoid nxt = f(apply(--b), R);
        if(check(nxt)) return find_subtree(b, check, R, true);
        R = nxt;
      }
    }
    return -1;
  }
};

template< typename Monoid, typename OperatorMonoid, typename F, typename G, typename H >
LazySegmentTree< Monoid, OperatorMonoid, F, G, H > get_lazy_segment_tree
    (int N, const F &f, const G &g, const H &h, const Monoid &M1, const OperatorMonoid &OM0) {
  return {N, f, g, h, M1, OM0};
}

int main() {
  int N;
  cin >> N;

  vector< modint > A(N);
  cin >> A;
  int Q;
  cin >> Q;
  using arr = array< modint, 5 >;
  arr base;
  for(int i = 0; i < 5; i++) base[i] = 0;

  auto f = [](const arr &a, const arr &b) {
    arr md;
    for(int i = 0; i < 5; i++) md[i] = a[i] + b[i];
    return md;
  };
  auto g = [](const arr &a, const arr &b) {
    arr md = a;
    for(int i = 1; i < 5; i++)md[i] = b[i] * a[0];
    return md;
  };
  auto h = [](const arr &a, const arr &b) {
    return b;
  };
  auto seg = get_lazy_segment_tree(N, f, g, h, base, base);

  for(int i = 0; i < N; i++) {
    arr v;
    v[0] = 1;
    modint a = A[i];
    for(int j = 1; j < 5; j++) {
      v[j] = a;
      a *= A[i];
    }
    seg.set(i, v);
  }
  seg.build();

  while(Q--) {
    int t, u, v, w;
    cin >> t >> u >> v >> w;
    --u, --v, --w;

    if(u > v) {
      swap(u, v);
    }
    if(t == 0) {
      modint b;
      cin >> b;

      arr vv;
      vv[0] = 0;
      modint a = b;
      for(int j = 1; j < 5; j++) {
        vv[j] = a;
        a *= b;
      }
      if(u < w and w < v) {
        seg.update(u, v + 1, vv);
      } else {
        seg.update(0, u + 1, vv);
        seg.update(v, N, vv);
      }
    } else {
      arr ans = base;
      if(u < w and w < v) {
        ans = f(ans, seg.query(u, v + 1));
      } else {
        ans = f(ans, seg.query(0, u + 1));
        ans = f(ans, seg.query(v, N));
      }
      modint l = ans[0];
      modint m = ans[1] / l;
      if(t == 1) {
        cout << (ans[1] - m * l) / l << "\n";
      } else if(t == 2) {
        cout << (ans[2] - ans[1] * m * 2 + m * m * l) / l << "\n";
      } else if(t == 3) {
        cout << (ans[3] - ans[2] * m * 3 + ans[1] * m * m * 3 - m * m * m * l) / l << "\n";
      } else {
        cout << (ans[4] - ans[3] * m * 4 + ans[2] * m * m * 6 - ans[1] * m * m * m * 4 + m * m * m * m * l) / l << "\n";
      }
    }
  }
}
0