test/aoj/dsl/dsl_2_d.test.cpp

• View this file on GitHub
• Last update: 2022-07-19 22:43:05+09:00
• Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D

Depends on

• 可換双対セグメント木 (らて木) (data_structure/sequence/commutative_dual_segment_tree.hpp)

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D"
#include <bits/stdc++.h>
using namespace std;
#include "../../../data_structure/sequence/commutative_dual_segment_tree.hpp"
int main(){
  int n, q;
  cin >> n >> q;
  commutative_dual_segment_tree<pair<int, int>> ST(n, [](pair<int, int> a, pair<int, int> b){return  max(a, b);}, make_pair(-1, 2147483647));
  for (int i = 0; i < q; i++){
    int c;
    cin >> c;
    if (c == 0){
      int s, t, x;
      cin >> s >> t >> x;
      t++;
      ST.range_apply(s, t, make_pair(i, x));
    }
    if (c == 1){
      int t;
      cin >> t;
      cout << ST[t].second << endl;
    }
  }
}

#line 1 "test/aoj/dsl/dsl_2_d.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_D"
#include <bits/stdc++.h>
using namespace std;
#line 2 "data_structure/sequence/commutative_dual_segment_tree.hpp"
/**
 * @brief 可換双対セグメント木 (らて木)
*/
template <typename T>
struct commutative_dual_segment_tree{
  int N;
  vector<T> ST;
  function<T(T, T)> f;
  T E;
  commutative_dual_segment_tree(int n, function<T(T, T)> f, T E): f(f), E(E){
    N = 1;
    while (N < n){
      N *= 2;
    }
    ST = vector<T>(N * 2 - 1, E);
  }
  commutative_dual_segment_tree(vector<T> A, function<T(T, T)> f, T E): f(f), E(E){
    int n = A.size();
    N = 1;
    while (N < n){
      N *= 2;
    }
    ST = vector<T>(N * 2 - 1, E);
    for (int i = 0; i < n; i++){
      ST[N - 1 + i] = A[i];
    }
  }
  T operator [](int k){
    k += N - 1;
    T ans = ST[k];
    while (k > 0){
      k = (k - 1) / 2;
      ans = f(ans, ST[k]);
    }
    return ans;
  }
  void range_apply(int L, int R, T x, int i, int l, int r){
    if (r <= L || R <= l){
    } else if (L <= l && r <= R){
      ST[i] = f(ST[i], x);
    } else {
      int m = (l + r) / 2;
      range_apply(L, R, x, i * 2 + 1, l, m);
      range_apply(L, R, x, i * 2 + 2, m, r);
    }
  }
  void range_apply(int L, int R, T x){
    range_apply(L, R, x, 0, 0, N);
  }
};
#line 5 "test/aoj/dsl/dsl_2_d.test.cpp"
int main(){
  int n, q;
  cin >> n >> q;
  commutative_dual_segment_tree<pair<int, int>> ST(n, [](pair<int, int> a, pair<int, int> b){return  max(a, b);}, make_pair(-1, 2147483647));
  for (int i = 0; i < q; i++){
    int c;
    cin >> c;
    if (c == 0){
      int s, t, x;
      cin >> s >> t >> x;
      t++;
      ST.range_apply(s, t, make_pair(i, x));
    }
    if (c == 1){
      int t;
      cin >> t;
      cout << ST[t].second << endl;
    }
  }
}

Back to top page