結果

問題 No.2901 Logical Sum of Substring
ユーザー 👑 hos.lyrichos.lyric
提出日時 2024-09-20 21:50:28
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 390 ms / 3,000 ms
コード長 6,336 bytes
コンパイル時間 1,381 ms
コンパイル使用メモリ 117,596 KB
実行使用メモリ 73,856 KB
最終ジャッジ日時 2024-09-20 21:51:15
合計ジャッジ時間 10,733 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 4 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 4 ms
5,376 KB
testcase_05 AC 4 ms
5,376 KB
testcase_06 AC 4 ms
5,376 KB
testcase_07 AC 4 ms
5,376 KB
testcase_08 AC 326 ms
73,856 KB
testcase_09 AC 321 ms
73,808 KB
testcase_10 AC 326 ms
73,856 KB
testcase_11 AC 360 ms
73,856 KB
testcase_12 AC 360 ms
73,856 KB
testcase_13 AC 390 ms
73,728 KB
testcase_14 AC 384 ms
73,728 KB
testcase_15 AC 377 ms
73,800 KB
testcase_16 AC 370 ms
73,760 KB
testcase_17 AC 358 ms
73,856 KB
testcase_18 AC 380 ms
73,856 KB
testcase_19 AC 356 ms
73,728 KB
testcase_20 AC 355 ms
73,756 KB
testcase_21 AC 355 ms
73,856 KB
testcase_22 AC 351 ms
73,856 KB
testcase_23 AC 360 ms
73,828 KB
testcase_24 AC 329 ms
73,764 KB
testcase_25 AC 330 ms
73,856 KB
testcase_26 AC 326 ms
73,828 KB
testcase_27 AC 317 ms
73,824 KB
testcase_28 AC 316 ms
73,728 KB
testcase_29 AC 364 ms
73,808 KB
testcase_30 AC 344 ms
73,744 KB
testcase_31 AC 341 ms
73,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreePoint {
  int logN, n;
  vector<T> ts;
  SegmentTreePoint() : logN(0), n(0) {}
  explicit SegmentTreePoint(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreePoint(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Changes the value of point a to s.
  template <class S> void change(int a, const S &s) {
    assert(0 <= a); assert(a < n);
    ts[a += n] = T(s);
    for (; a >>= 1; ) pull(a);
  }

  // Applies T::f(args...) to point a.
  template <class F, class... Args>
  void ch(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a < n);
    (ts[a += n].*f)(args...);
    for (; a >>= 1; ) pull(a);
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    T prodL, prodR, t;
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) { t.pull(prodL, ts[a++]); prodL = t; }
      if (b & 1) { t.pull(ts[--b], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    auto prodL = e(), prodR = e();
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) prodL = op(prodL, (ts[a++].*f)(args...));
      if (b & 1) prodR = op((ts[--b].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};  // SegmentTreePoint<T>

////////////////////////////////////////////////////////////////////////////////


constexpr int INF = 1001001001;

int K;
struct Node {
  int sz;
  int mn;
  int pre[16], suf[16];
  Node() : sz(0), mn(INF) {
    fill(pre, pre + K, INF);
    fill(suf, suf + K, INF);
  }
  Node(int val) : sz(1), mn(INF) {
    if (val == (1 << K) - 1) mn = 1;
    fill(pre, pre + K, INF);
    fill(suf, suf + K, INF);
    for (int k = 0; k < K; ++k) if (val >> k & 1) pre[k] = suf[k] = 1;
  }
  void pull(const Node &l, const Node &r) {
    sz = l.sz + r.sz;
    mn = min(l.mn, r.mn);
    for (int k = 0; k < K; ++k) pre[k] = min(l.pre[k], l.sz + r.pre[k]);
    for (int k = 0; k < K; ++k) suf[k] = min(l.suf[k] + r.sz, r.suf[k]);
    for (int k = 0; k < K; ++k) {
      int mx = 0;
      for (int kk = 0; kk < K; ++kk) if (l.suf[kk] > l.suf[k]) chmax(mx, r.pre[kk]);
      chmin(mn, l.suf[k] + mx);
    }
  }
};


int main() {
  int N;
  for (; ~scanf("%d%d", &N, &K); ) {
    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    SegmentTreePoint<Node> seg(A);
    int Q;
    scanf("%d", &Q);
    for (; Q--; ) {
      int O;
      scanf("%d", &O);
      if (O == 1) {
        int i, v;
        scanf("%d%d", &i, &v);
        --i;
        seg.change(i, v);
      } else if (O == 2) {
        int l, r;
        scanf("%d%d", &l, &r);
        --l;
        const auto res = seg.get(l, r);
        printf("%d\n", (res.mn < INF) ? res.mn : -1);
      } else {
        assert(false);
      }
    }
  }
  return 0;
}
0