結果

問題 No.2170 Left Addition Machine
ユーザー 👑 emthrmemthrm
提出日時 2022-12-22 16:10:12
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 932 ms / 2,000 ms
コード長 8,152 bytes
コンパイル時間 2,621 ms
コンパイル使用メモリ 219,520 KB
実行使用メモリ 21,024 KB
最終ジャッジ日時 2024-11-18 06:23:30
合計ジャッジ時間 32,036 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 138 ms
14,488 KB
testcase_04 AC 37 ms
6,816 KB
testcase_05 AC 70 ms
9,344 KB
testcase_06 AC 72 ms
10,624 KB
testcase_07 AC 105 ms
12,288 KB
testcase_08 AC 18 ms
6,820 KB
testcase_09 AC 89 ms
8,448 KB
testcase_10 AC 12 ms
6,816 KB
testcase_11 AC 56 ms
8,960 KB
testcase_12 AC 132 ms
15,452 KB
testcase_13 AC 126 ms
15,424 KB
testcase_14 AC 122 ms
15,320 KB
testcase_15 AC 125 ms
15,448 KB
testcase_16 AC 123 ms
15,404 KB
testcase_17 AC 128 ms
15,416 KB
testcase_18 AC 126 ms
15,256 KB
testcase_19 AC 121 ms
15,376 KB
testcase_20 AC 126 ms
15,316 KB
testcase_21 AC 54 ms
7,040 KB
testcase_22 AC 54 ms
7,168 KB
testcase_23 AC 56 ms
7,040 KB
testcase_24 AC 54 ms
6,912 KB
testcase_25 AC 54 ms
7,168 KB
testcase_26 AC 55 ms
7,168 KB
testcase_27 AC 55 ms
7,040 KB
testcase_28 AC 54 ms
7,040 KB
testcase_29 AC 55 ms
7,168 KB
testcase_30 AC 866 ms
20,880 KB
testcase_31 AC 885 ms
20,876 KB
testcase_32 AC 925 ms
20,884 KB
testcase_33 AC 932 ms
20,884 KB
testcase_34 AC 885 ms
20,876 KB
testcase_35 AC 896 ms
20,880 KB
testcase_36 AC 883 ms
20,864 KB
testcase_37 AC 878 ms
20,880 KB
testcase_38 AC 870 ms
21,004 KB
testcase_39 AC 457 ms
11,932 KB
testcase_40 AC 461 ms
11,720 KB
testcase_41 AC 463 ms
11,948 KB
testcase_42 AC 464 ms
11,896 KB
testcase_43 AC 471 ms
11,824 KB
testcase_44 AC 465 ms
11,840 KB
testcase_45 AC 486 ms
11,948 KB
testcase_46 AC 465 ms
11,816 KB
testcase_47 AC 491 ms
11,820 KB
testcase_48 AC 712 ms
19,960 KB
testcase_49 AC 448 ms
18,068 KB
testcase_50 AC 517 ms
19,984 KB
testcase_51 AC 522 ms
18,560 KB
testcase_52 AC 597 ms
19,808 KB
testcase_53 AC 362 ms
18,180 KB
testcase_54 AC 640 ms
19,468 KB
testcase_55 AC 885 ms
21,024 KB
testcase_56 AC 842 ms
20,772 KB
testcase_57 AC 129 ms
15,408 KB
testcase_58 AC 130 ms
15,420 KB
testcase_59 AC 133 ms
15,376 KB
testcase_60 AC 128 ms
15,400 KB
testcase_61 AC 128 ms
15,456 KB
testcase_62 AC 128 ms
15,460 KB
testcase_63 AC 129 ms
15,352 KB
testcase_64 AC 128 ms
15,436 KB
testcase_65 AC 127 ms
15,456 KB
testcase_66 AC 24 ms
6,816 KB
testcase_67 AC 111 ms
15,356 KB
testcase_68 AC 127 ms
15,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <int M>
struct MInt {
  unsigned int v;
  MInt() : v(0) {}
  MInt(const long long x) : v(x >= 0 ? x % M : x % M + M) {}
  static constexpr int get_mod() { return M; }
  static void set_mod(const int divisor) { assert(divisor == M); }
  static void init(const int x = 10000000) {
    inv(x, true);
    fact(x);
    fact_inv(x);
  }
  static MInt inv(const int n, const bool init = false) {
    // assert(0 <= n && n < M && std::__gcd(n, M) == 1);
    static std::vector<MInt> inverse{0, 1};
    const int prev = inverse.size();
    if (n < prev) {
      return inverse[n];
    } else if (init) {
      // "n!" and "M" must be disjoint.
      inverse.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        inverse[i] = -inverse[M % i] * (M / i);
      }
      return inverse[n];
    }
    int u = 1, v = 0;
    for (unsigned int a = n, b = M; b;) {
      const unsigned int q = a / b;
      std::swap(a -= q * b, b);
      std::swap(u -= q * v, v);
    }
    return u;
  }
  static MInt fact(const int n) {
    static std::vector<MInt> factorial{1};
    const int prev = factorial.size();
    if (n >= prev) {
      factorial.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        factorial[i] = factorial[i - 1] * i;
      }
    }
    return factorial[n];
  }
  static MInt fact_inv(const int n) {
    static std::vector<MInt> f_inv{1};
    const int prev = f_inv.size();
    if (n >= prev) {
      f_inv.resize(n + 1);
      f_inv[n] = inv(fact(n).v);
      for (int i = n; i > prev; --i) {
        f_inv[i - 1] = f_inv[i] * i;
      }
    }
    return f_inv[n];
  }
  static MInt nCk(const int n, const int k) {
    if (n < 0 || n < k || k < 0) return 0;
    return fact(n) * (n - k < k ? fact_inv(k) * fact_inv(n - k) :
                                  fact_inv(n - k) * fact_inv(k));
  }
  static MInt nPk(const int n, const int k) {
    return n < 0 || n < k || k < 0 ? 0 : fact(n) * fact_inv(n - k);
  }
  static MInt nHk(const int n, const int k) {
    return n < 0 || k < 0 ? 0 : (k == 0 ? 1 : nCk(n + k - 1, k));
  }
  static MInt large_nCk(long long n, const int k) {
    if (n < 0 || n < k || k < 0) return 0;
    inv(k, true);
    MInt res = 1;
    for (int i = 1; i <= k; ++i) {
      res *= inv(i) * n--;
    }
    return res;
  }
  MInt pow(long long exponent) const {
    MInt res = 1, tmp = *this;
    for (; exponent > 0; exponent >>= 1) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
    }
    return res;
  }
  MInt& operator+=(const MInt& x) {
    if (static_cast<int>(v += x.v) >= M) v -= M;
    return *this;
  }
  MInt& operator-=(const MInt& x) {
    if (static_cast<int>(v += M - x.v) >= M) v -= M;
    return *this;
  }
  MInt& operator*=(const MInt& x) {
    v = static_cast<unsigned long long>(v) * x.v % M;
    return *this;
  }
  MInt& operator/=(const MInt& x) { return *this *= inv(x.v); }
  bool operator==(const MInt& x) const { return v == x.v; }
  bool operator!=(const MInt& x) const { return v != x.v; }
  bool operator<(const MInt& x) const { return v < x.v; }
  bool operator<=(const MInt& x) const { return v <= x.v; }
  bool operator>(const MInt& x) const { return v > x.v; }
  bool operator>=(const MInt& x) const { return v >= x.v; }
  MInt& operator++() {
    if (static_cast<int>(++v) == M) v = 0;
    return *this;
  }
  MInt operator++(int) {
    const MInt res = *this;
    ++*this;
    return res;
  }
  MInt& operator--() {
    v = (v == 0 ? M - 1 : v - 1);
    return *this;
  }
  MInt operator--(int) {
    const MInt res = *this;
    --*this;
    return res;
  }
  MInt operator+() const { return *this; }
  MInt operator-() const { return MInt(v ? M - v : 0); }
  MInt operator+(const MInt& x) const { return MInt(*this) += x; }
  MInt operator-(const MInt& x) const { return MInt(*this) -= x; }
  MInt operator*(const MInt& x) const { return MInt(*this) *= x; }
  MInt operator/(const MInt& x) const { return MInt(*this) /= x; }
  friend std::ostream& operator<<(std::ostream& os, const MInt& x) {
    return os << x.v;
  }
  friend std::istream& operator>>(std::istream& is, MInt& x) {
    long long v;
    is >> v;
    x = MInt(v);
    return is;
  }
};
using ModInt = MInt<MOD>;

struct Mo {
  explicit Mo(const std::vector<int>& ls, const std::vector<int>& rs)
      : n(ls.size()), ptr(0), nl(0), nr(0), ls(ls), rs(rs) {
    const int width = std::round(std::sqrt(n));
    order.resize(n);
    std::iota(order.begin(), order.end(), 0);
    std::sort(order.begin(), order.end(),
              [&ls, &rs, width](const int a, const int b) -> bool {
                  if (ls[a] / width != ls[b] / width) return ls[a] < ls[b];
                  return (ls[a] / width) & 1 ? rs[a] < rs[b] : rs[a] > rs[b];
              });
  }

  int process() {
    if (ptr == n) return -1;
    const int id = order[ptr++];
    while (ls[id] < nl) add(--nl);
    while (nr < rs[id]) add(nr++);
    while (nl < ls[id]) del(nl++);
    while (rs[id] < nr) del(--nr);
    return id;
  }

  void add(const int idx) const;

  void del(const int idx) const;

 private:
  const int n;
  int ptr, nl, nr;
  std::vector<int> ls, rs, order;
};

int len;
ModInt v = 0;
vector<int> b;
vector<ModInt> p2;

void Mo::add(const int idx) const {
  if (idx + 1 == nr) {
    v += p2[nr - nl - 1] * b[idx];
  } else {
    v = v * 2 + b[idx];
    if (nl + 1 < nr) v -= b[nl + 1];
  }
  // REP(i, b.size()) cout << b[i] << " \n"[i + 1 == b.size()];
  // cout << nl << ' ' << nr << ": " << v << '\n';
}

void Mo::del(const int idx) const {
  if (idx == nr) {
    v -= p2[nr - nl] * b[idx];
  } else {
    v -= b[idx];
    if (nl < nr) v = (v - b[nl]) / 2 + b[nl];
  }
  // REP(i, b.size()) cout << b[i] << " \n"[i + 1 == b.size()];
  // cout << nl << ' ' << nr << ": " << v << '\n';
}

int main() {
  int n, q; cin >> n >> q;
  vector<int> a(n), l(q), r(q);
  REP(i, n) cin >> a[i];
  REP(i, q) cin >> l[i] >> r[i], --l[i], --r[i];
  p2.assign(n, 1);
  FOR(i, 2, n) p2[i] = p2[i - 1] * 2;
  vector<vector<int>> queries(n);
  REP(i, q) queries[r[i]].emplace_back(i);
  vector<ModInt> ans(q, 0);
  for (int i = n - 1; i >= 0;) {
    int j = i;
    while (j > 0 && a[j - 1] < a[j]) --j;
    vector<int> ls, rs, ids;
    FOR(k, j, i + 1) {
      for (const int id : queries[k]) {
        ls.emplace_back(max(l[id], j) - j);
        rs.emplace_back(r[id] - j + 1);
        ids.emplace_back(id);
      }
    }
    if (!ls.empty()) {
      len = i - j + 1;
      v = 0;
      b.resize(len);
      copy(next(a.begin(), j), next(a.begin(), i + 1), b.begin());
      Mo mo(ls, rs);
      while (true) {
        const int id = mo.process();
        if (id == -1) break;
        ans[ids[id]] = v;
      }
    }
    // for (const int id : queries[i]) {
    //   for (int fib_index = 0, p = max(j, l[id]); p <= i; ++fib_index, ++p) {
    //     ans[id] += fib[fib_index] * a[p];
    //   }
    // }
    i = j - 1;
  }
  REP(i, q) cout << ans[i] << '\n';
  // REP(i, q) {
  //   vector<ll> b(r[i] - l[i] + 1);
  //   copy(next(a.begin(), l[i]), next(a.begin(), r[i] + 1), b.begin());
  //   while (b.size() > 1) {
  //     const int x = distance(b.begin(), max_element(ALL(b)));
  //     REP(j, x) b[j] += b[x];
  //     b.erase(next(b.begin(), x));
  //   }
  //   assert(ans[i] == b.front());
  // }
  return 0;
}
0