kyopro-lib

This documentation is automatically generated by online-judge-tools/verification-helper

View on GitHub

:x: test/aoj/DSL_2_D/main.test.cpp

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D"

#include <climits>
#include <iostream>
#include "Mylib/AlgebraicStructure/Monoid/update.cpp"
#include "Mylib/DataStructure/SegmentTree/dual_segment_tree.cpp"
#include "Mylib/IO/input_tuples.cpp"

namespace hl = haar_lib;

int main() {
  int n, q;
  std::cin >> n >> q;

  auto seg = hl::dual_segment_tree<hl::update_monoid<int>>(n);
  seg.init(INT_MAX);

  for (auto [type] : hl::input_tuples<int>(q)) {
    if (type == 0) {
      int s, t, x;
      std::cin >> s >> t >> x;
      seg.update(s, t + 1, x);
    } else {
      int i;
      std::cin >> i;
      std::cout << *seg[i] << std::endl;
    }
  }

  return 0;
}
#line 1 "test/aoj/DSL_2_D/main.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D"

#include <climits>
#include <iostream>
#line 2 "Mylib/AlgebraicStructure/Monoid/update.cpp"
#include <optional>

namespace haar_lib {
  template <typename T>
  struct update_monoid {
    using value_type = std::optional<T>;
    value_type operator()() const { return std::nullopt; }
    value_type operator()(const value_type &a, const value_type &b) const { return (a ? a : b); }
  };
}  // namespace haar_lib
#line 2 "Mylib/DataStructure/SegmentTree/dual_segment_tree.cpp"
#include <cassert>
#include <vector>

namespace haar_lib {
  template <typename Monoid>
  class dual_segment_tree {
  public:
    using value_type = typename Monoid::value_type;

  private:
    Monoid M_;
    int depth_, size_, hsize_;
    std::vector<value_type> data_;

    void propagate(int i) {
      if (i < hsize_) {
        data_[i << 1 | 0] = M_(data_[i], data_[i << 1 | 0]);
        data_[i << 1 | 1] = M_(data_[i], data_[i << 1 | 1]);
        data_[i]          = M_();
      }
    }

    void propagate_top_down(int i) {
      std::vector<int> temp;
      while (i > 1) {
        i >>= 1;
        temp.push_back(i);
      }

      for (auto it = temp.rbegin(); it != temp.rend(); ++it) propagate(*it);
    }

  public:
    dual_segment_tree() {}
    dual_segment_tree(int n) : depth_(n > 1 ? 32 - __builtin_clz(n - 1) + 1 : 1),
                               size_(1 << depth_),
                               hsize_(size_ / 2),
                               data_(size_, M_()) {}

    void update(int l, int r, const value_type &x) {
      assert(0 <= l and l <= r and r <= hsize_);
      propagate_top_down(l + hsize_);
      propagate_top_down(r + hsize_);

      int L = l + hsize_;
      int R = r + hsize_;

      while (L < R) {
        if (R & 1) --R, data_[R] = M_(x, data_[R]);
        if (L & 1) data_[L] = M_(x, data_[L]), ++L;
        L >>= 1, R >>= 1;
      }
    }

    value_type operator[](int i) {
      assert(0 <= i and i < hsize_);
      propagate_top_down(i + hsize_);
      return data_[i + hsize_];
    }

    template <typename T>
    void init_with_vector(const std::vector<T> &a) {
      data_.assign(size_, M_());
      for (int i = 0; i < (int) a.size(); ++i) data_[hsize_ + i] = a[i];
    }

    template <typename T>
    void init(const T &val) {
      init_with_vector(std::vector<value_type>(hsize_, val));
    }
  };
}  // namespace haar_lib
#line 2 "Mylib/IO/input_tuples.cpp"
#include <initializer_list>
#line 4 "Mylib/IO/input_tuples.cpp"
#include <tuple>
#include <utility>
#line 6 "Mylib/IO/input_tuple.cpp"

namespace haar_lib {
  template <typename T, size_t... I>
  static void input_tuple_helper(std::istream &s, T &val, std::index_sequence<I...>) {
    (void) std::initializer_list<int>{(void(s >> std::get<I>(val)), 0)...};
  }

  template <typename T, typename U>
  std::istream &operator>>(std::istream &s, std::pair<T, U> &value) {
    s >> value.first >> value.second;
    return s;
  }

  template <typename... Args>
  std::istream &operator>>(std::istream &s, std::tuple<Args...> &value) {
    input_tuple_helper(s, value, std::make_index_sequence<sizeof...(Args)>());
    return s;
  }
}  // namespace haar_lib
#line 8 "Mylib/IO/input_tuples.cpp"

namespace haar_lib {
  template <typename... Args>
  class InputTuples {
    struct iter {
      using value_type = std::tuple<Args...>;
      value_type value;
      bool fetched = false;
      int N, c = 0;

      value_type operator*() {
        if (not fetched) {
          std::cin >> value;
        }
        return value;
      }

      void operator++() {
        ++c;
        fetched = false;
      }

      bool operator!=(iter &) const {
        return c < N;
      }

      iter(int N) : N(N) {}
    };

    int N;

  public:
    InputTuples(int N) : N(N) {}

    iter begin() const { return iter(N); }
    iter end() const { return iter(N); }
  };

  template <typename... Args>
  auto input_tuples(int N) {
    return InputTuples<Args...>(N);
  }
}  // namespace haar_lib
#line 8 "test/aoj/DSL_2_D/main.test.cpp"

namespace hl = haar_lib;

int main() {
  int n, q;
  std::cin >> n >> q;

  auto seg = hl::dual_segment_tree<hl::update_monoid<int>>(n);
  seg.init(INT_MAX);

  for (auto [type] : hl::input_tuples<int>(q)) {
    if (type == 0) {
      int s, t, x;
      std::cin >> s >> t >> x;
      seg.update(s, t + 1, x);
    } else {
      int i;
      std::cin >> i;
      std::cout << *seg[i] << std::endl;
    }
  }

  return 0;
}
Back to top page