test/verify/aoj-dsl-2-d.test.cpp

View this file on GitHub
Last update: 2024-05-01 23:44:47+09:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D

Depends on

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D

#include "../../template/template.hpp"

#include "../../structure/segment-tree/dual-segment-tree.hpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  auto h = [](int a, int b) { return b; };
  auto seg = get_dual_segment_tree(N, h, INT_MAX);
  while(Q--) {
    int com;
    cin >> com;
    if(com == 0) {
      int l, r, x;
      cin >> l >> r >> x;
      seg.update(l, r + 1, x);
    } else if(com == 1) {
      int k;
      cin >> k;
      cout << seg[k] << "\n";
    }
  }
}

#line 1 "test/verify/aoj-dsl-2-d.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

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) {
  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 {
  explicit 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)};
}
#line 4 "test/verify/aoj-dsl-2-d.test.cpp"

#line 1 "structure/segment-tree/dual-segment-tree.hpp"
/**
 * @brief Dual-Segment-Tree(双対セグメント木)
 *
 */
template <typename E, typename H>
struct DualSegmentTree {
  int sz, height;
  vector<E> lazy;
  const H h;
  const E ei;

  DualSegmentTree(int n, const H h, const E& ei) : h(h), ei(ei) {
    sz = 1;
    height = 0;
    while (sz < n) sz <<= 1, height++;
    lazy.assign(2 * sz, ei);
  }

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

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

  void update(int a, int b, const E& x) {
    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);
    }
  }

  E operator[](int k) {
    thrust(k += sz);
    return lazy[k];
  }
};

template <typename E, typename H>
DualSegmentTree<E, H> get_dual_segment_tree(int N, const H& h, const E& ei) {
  return {N, h, ei};
}
#line 6 "test/verify/aoj-dsl-2-d.test.cpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  auto h = [](int a, int b) { return b; };
  auto seg = get_dual_segment_tree(N, h, INT_MAX);
  while(Q--) {
    int com;
    cin >> com;
    if(com == 0) {
      int l, r, x;
      cin >> l >> r >> x;
      seg.update(l, r + 1, x);
    } else if(com == 1) {
      int k;
      cin >> k;
      cout << seg[k] << "\n";
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	6 ms	4 MB
g++	00_sample_01.in	AC	6 ms	4 MB
g++	01_rand_00.in	AC	6 ms	4 MB
g++	01_rand_01.in	AC	6 ms	4 MB
g++	01_rand_02.in	AC	6 ms	4 MB
g++	01_rand_03.in	AC	6 ms	4 MB
g++	01_rand_04.in	AC	7 ms	4 MB
g++	01_rand_05.in	AC	9 ms	4 MB
g++	02_corner_00.in	AC	6 ms	4 MB
g++	02_corner_01.in	AC	7 ms	4 MB
g++	03_large_00.in	AC	9 ms	4 MB
g++	03_large_01.in	AC	10 ms	4 MB
g++	03_large_02.in	AC	9 ms	4 MB
g++	03_large_03.in	AC	10 ms	4 MB
g++	04_maximum_00.in	AC	28 ms	4 MB
g++	04_maximum_01.in	AC	28 ms	4 MB
g++	04_maximum_02.in	AC	30 ms	4 MB
g++	04_maximum_03.in	AC	30 ms	4 MB
g++	05_critical_00.in	AC	26 ms	4 MB
g++	05_critical_01.in	AC	21 ms	4 MB
g++	05_critical_02.in	AC	31 ms	4 MB
g++	05_critical_03.in	AC	29 ms	4 MB
clang++	00_sample_00.in	AC	7 ms	4 MB
clang++	00_sample_01.in	AC	6 ms	4 MB
clang++	01_rand_00.in	AC	6 ms	4 MB
clang++	01_rand_01.in	AC	6 ms	4 MB
clang++	01_rand_02.in	AC	6 ms	4 MB
clang++	01_rand_03.in	AC	6 ms	4 MB
clang++	01_rand_04.in	AC	6 ms	4 MB
clang++	01_rand_05.in	AC	8 ms	4 MB
clang++	02_corner_00.in	AC	7 ms	4 MB
clang++	02_corner_01.in	AC	6 ms	4 MB
clang++	03_large_00.in	AC	9 ms	4 MB
clang++	03_large_01.in	AC	9 ms	4 MB
clang++	03_large_02.in	AC	9 ms	4 MB
clang++	03_large_03.in	AC	8 ms	4 MB
clang++	04_maximum_00.in	AC	27 ms	4 MB
clang++	04_maximum_01.in	AC	31 ms	4 MB
clang++	04_maximum_02.in	AC	30 ms	4 MB
clang++	04_maximum_03.in	AC	29 ms	4 MB
clang++	05_critical_00.in	AC	28 ms	4 MB
clang++	05_critical_01.in	AC	22 ms	4 MB
clang++	05_critical_02.in	AC	32 ms	4 MB
clang++	05_critical_03.in	AC	32 ms	4 MB