lmori's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub lmorinn/library

:heavy_check_mark: verify/AizuOnlineJudge/data-structure/square-root-decomposition/RangeSetRangeMin.test.cpp

Depends on

Code

#include "../../../../template/template.hpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/2/DSL_2_F"
#include "../../../../data-structure/square-root-decomposition/RangeSetRangeMin.hpp"

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    in(n, q);
    vector<lint> a(n, (1LL << 31) - 1);
    RangeSetRangeMin<lint> w(a);

    rep(i, q) {
        int com;
        in(com);
        if (com == 0) {
            int l, r, x;
            in(l, r, x);
            w.range_set(l, r + 1, x);
        } else {
            int l, r;
            in(l, r);
            out(w.range_min(l, r + 1));
        }
    }
}
#line 2 "template/template.hpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ull = unsigned long long;
using ld = long double;
using int128 = __int128_t;
#define all(x) (x).begin(), (x).end()
#define uniqv(v) v.erase(unique(all(v)), v.end())
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define logfixed(x) cout << fixed << setprecision(10) << x << endl;

ostream &operator<<(ostream &dest, __int128_t value) {
  ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(ios_base::badbit);
    }
  }
  return dest;
}

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 != (int)v.size() ? " " : "");
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const unordered_map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
  os << pair_var.first << " " << pair_var.second;
  return os;
}

void out() { cout << '\n'; }
template <class T, class... Ts>
void out(const T &a, const Ts &...b) {
  cout << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

void outf() { cout << '\n'; }
template <class T, class... Ts>
void outf(const T &a, const Ts &...b) {
  cout << fixed << setprecision(14) << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
  cin >> first;
  in(rest...);
  return;
}

template <typename T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

vector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};
vector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<lint> dx4 = {1, 0, -1, 0};
vector<lint> dy4 = {0, 1, 0, -1};

#pragma endregion
#line 2 "verify/AizuOnlineJudge/data-structure/square-root-decomposition/RangeSetRangeMin.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/2/DSL_2_F"
#line 1 "data-structure/square-root-decomposition/RangeSetRangeMin.hpp"

template <class T>
class RangeSetRangeMin {
   private:
    int n;
    vector<T> a, mi, lazy;
    int bsize;
    T ma;

    void push(int bidx) {
        if (lazy[bidx] != ma) {
            int start = bidx * bsize;
            int end = min(n, start + bsize);
            for (int i = start; i < end; i++) {
                a[i] = lazy[bidx];
            }
            lazy[bidx] = ma;
        }
    }

    void update(int bidx) {
        mi[bidx] = ma;
        int start = bidx * bsize;
        int end = min(n, start + bsize);
        for (int i = start; i < end; i++) {
            mi[bidx] = min(mi[bidx], a[i]);
        }
    }

   public:
    RangeSetRangeMin(const vector<T> &v) {
        ma = numeric_limits<T>::max();
        a = v;
        n = a.size();
        bsize = sqrt(n) + 1;
        lazy.resize(bsize, ma);
        mi.resize(bsize, ma);
        for (int i = 0; i < n; i++) mi[i / bsize] = min(mi[i / bsize], a[i]);
    }

    T range_min(int l, int r) {
        T res = ma;
        if (l / bsize == r / bsize) {
            push(l / bsize);
            for (int i = l; i < r; i++) res = min(res, a[i]);
        } else {
            push(l / bsize);
            for (int i = l; i < l / bsize * bsize + bsize; i++) res = min(res, a[i]);

            push(r / bsize);
            for (int i = r / bsize * bsize; i < r; i++) res = min(res, a[i]);

            for (int i = 0; i < bsize; i++) {
                if (l < i * bsize and (i + 1) * bsize <= r) {
                    res = min(res, mi[i]);
                }
            }
        }
        return res;
    }

    void range_set(int l, int r, T x) {
        if (l / bsize == r / bsize) {
            push(l / bsize);
            for (int i = l; i < r; i++) a[i] = x;
            update(l / bsize);
        } else {
            push(l / bsize);
            for (int i = l; i < l / bsize * bsize + bsize; i++) a[i] = x;
            update(l / bsize);

            push(r / bsize);
            for (int i = r / bsize * bsize; i < r; i++) a[i] = x;
            update(r / bsize);

            for (int i = 0; i < bsize; i++) {
                if (l < i * bsize and (i + 1) * bsize <= r) {
                    lazy[i] = x;
                    mi[i] = x;
                }
            }
        }
    }
};
#line 4 "verify/AizuOnlineJudge/data-structure/square-root-decomposition/RangeSetRangeMin.test.cpp"

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    in(n, q);
    vector<lint> a(n, (1LL << 31) - 1);
    RangeSetRangeMin<lint> w(a);

    rep(i, q) {
        int com;
        in(com);
        if (com == 0) {
            int l, r, x;
            in(l, r, x);
            w.range_set(l, r + 1, x);
        } else {
            int l, r;
            in(l, r);
            out(w.range_min(l, r + 1));
        }
    }
}
Back to top page