結果

問題 No.1234 典型RMQ
ユーザー kaage
提出日時 2020-09-18 21:35:43
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 346 ms / 2,000 ms
コード長 11,796 bytes
コンパイル時間 2,076 ms
コンパイル使用メモリ 135,696 KB
実行使用メモリ 9,344 KB
最終ジャッジ日時 2024-11-09 01:43:24
合計ジャッジ時間 9,842 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#line 2 "library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef unsigned int uint;
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
    if (lhs < rhs) {
        lhs = rhs;
        return 1;
    }
    return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
    if (lhs > rhs) {
        lhs = rhs;
        return 1;
    }
    return 0;
}
inline lint gcd(lint a, lint b) {
    while (b) {
        lint c = a;
        a = b; b = c % b;
    }
    return a;
}
inline lint lcm(lint a, lint b) {
    return a / gcd(a, b) * b;
}
bool isprime(lint n) {
    if (n == 1)return false;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0)return false;
    }
    return true;
}
template<typename T>
T mypow(T a, lint b) {
    T res(1);
    while(b){
        if(b&1)res*=a;
        a*=a;
        b>>=1;
    }
    return res;
}
lint modpow(lint a, lint b, lint m) {
    lint res(1);
    while(b){
        if(b&1){
            res*=a;res%=m;
        }
        a*=a;a%=m;
        b>>=1;
    }
    return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
    rep(i, vec.size()){
        std::cout << vec[i];
        std::cout<<(i==(int)vec.size()-1?"\n":" ");
    }
}
template<typename T>
void printArray(T l, T r) {
    T rprev = std::prev(r);
    for (T i = l; i != rprev; i++) {
        std::cout << *i << " ";
    }
    std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
    if(b==0)return {1,0};
    LP s=extGcd(b,a%b);
    std::swap(s.first,s.second);
    s.second-=a/b*s.first;
    return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
    lint p=extGcd(m1,m2).first;
    lint tmp=(b2-b1)*p%m2;
    lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
    return std::make_pair(r,m1*m2);
}
template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
    return [f=std::forward<F>(f)](auto&&... args){
        return f(f,std::forward<decltype(args)>(args)...);
    };
}
#line 3 "library/data-structure/SegTree.hpp"
template<typename T>
class SegTree {
protected:
    unsigned int n = 1, rank = 0;
    std::vector<T> node;
    T nodee;
    virtual T nodef(const T&, const T&)const = 0;
public:
    SegTree(unsigned int m, T init, T nodee):nodee(nodee) {
        while (n < m) {
            n *= 2;
            rank++;
        }
        node.resize(2 * n, nodee);
        for (unsigned int i = n; i < 2 * n; i++)node[i] = init;
    }
    SegTree(const std::vector<T>& initvec, T nodee):nodee(nodee) {
        unsigned int m = initvec.size();
        while (n < m) {
            n *= 2;
            rank++;
        }
        node.resize(2 * n, nodee);
        for (unsigned int i = n; i < 2 * n; i++) {
            if (i - n < m)node[i] = initvec[i - n];
        }
    }
    virtual void update(int i, T x) {
        i += n;
        node[i] = x;
        while (i != 1) {
            i >>= 1;
            node[i] = nodef(node[2 * i], node[2 * i + 1]);
        }
    }
    virtual T query(int l, int r) {
        l += n; r += n;
        T ls = nodee, rs = nodee;
        while (l < r) {
            if (l & 1) ls = nodef(ls, node[l++]);
            if (r & 1) rs = nodef(node[--r], rs);
            l >>= 1; r >>= 1;
        }
        return nodef(ls, rs);
    }
    virtual T operator[](const int& x) {
        return node[n + x];
    }
    void print() {
        rep(i, n)std::cout << operator[](i) << " ";
        std::cout << std::endl;
    }
};
class RSQ :public SegTree<lint> {
    lint nodef(const lint& lhs,const lint& rhs)const{return lhs+rhs;}
public:
    RSQ(int size, const lint& def = 0) :SegTree<lint>(size, def, 0) {
        for(int i=n-1;i>0;i--)node[i]=nodef(node[i<<1],node[i<<1|1]);
    }
    RSQ(const std::vector<lint>& initvec) :SegTree<lint>(initvec, 0) {
        for(int i=n-1;i>0;i--)node[i]=nodef(node[i<<1],node[i<<1|1]);
    }
};
class RMiQ :public SegTree<lint> {
    lint nodef(const lint& lhs,const lint& rhs)const{return std::min(lhs,rhs);}
public:
    RMiQ(int size, const lint& def = 0) :SegTree<lint>(size, def, LINF) {
        for(int i=n-1;i>0;i--)node[i]=nodef(node[i<<1],node[i<<1|1]);
    }
    RMiQ(const std::vector<lint>& initvec) :SegTree<lint>(initvec, LINF) {
        for(int i=n-1;i>0;i--)node[i]=nodef(node[i<<1],node[i<<1|1]);
    }
};
class RMaQ :public SegTree<lint> {
    lint nodef(const lint& lhs,const lint& rhs)const{return std::max(lhs,rhs);}
public:
    RMaQ(int size, const lint& def = 0) :SegTree<lint>(size, def, -LINF) {
        for(int i=n-1;i>0;i--)node[i]=nodef(node[i<<1],node[i<<1|1]);
    }
    RMaQ(const std::vector<lint>& initvec) :SegTree<lint>(initvec, -LINF) {
        for(int i=n-1;i>0;i--)node[i]=nodef(node[i<<1],node[i<<1|1]);
    }
};
#line 4 "library/data-structure/IntervalSegTree.hpp"
template<typename T, typename U>
class IntervalSegTree :public SegTree<T> {
protected:
    using SegTree<T>::n;
    using SegTree<T>::rank;
    using SegTree<T>::node;
    using SegTree<T>::nodef;
    using SegTree<T>::nodee;
    std::vector<U> lazy;
    std::vector<bool> lazyflag;
    std::vector<int> width;
    virtual void lazyf(U&, const U&) = 0;
    virtual void updf(T&, const U&, const unsigned int&) = 0;
    void eval(int k) {
        for (int i = rank; i > 0; i--) {
            int nk = k >> i;
            if (lazyflag[nk]) {
                updf(node[2 * nk], lazy[nk], width[2 * nk]);
                updf(node[2 * nk + 1], lazy[nk], width[2 * nk + 1]);
                if (lazyflag[2 * nk])lazyf(lazy[2 * nk], lazy[nk]);
                else lazy[2 * nk] = lazy[nk];
                if (lazyflag[2 * nk + 1])lazyf(lazy[2 * nk + 1], lazy[nk]);
                else lazy[2 * nk + 1] = lazy[nk];
                lazyflag[2 * nk] = lazyflag[2 * nk + 1] = true;
                lazyflag[nk] = false;
            }
        }
    }
public:
    IntervalSegTree(unsigned int m, T init, T nodee) :SegTree<T>(m, init, nodee) {
        lazy.resize(2 * n); lazyflag.resize(2 * n); width.resize(2 * n);
        width[1] = n;
        for (unsigned int i = 2; i < 2 * n; i++) {
            width[i] = width[i >> 1] >> 1;
        }
    }
    IntervalSegTree(T nodee, const std::vector<T>& initvec) :SegTree<T>(initvec, nodee) {
        lazy.resize(2 * n); lazyflag.resize(2 * n); width.resize(2 * n);
        width[1] = n;
        for (unsigned int i = 2; i < 2 * n; i++) {
            width[i] = width[i >> 1] >> 1;
        }
    }
    void update(int i, U x) {
        i += n;
        eval(i);
        updf(node[i], x, width[i]);
        if (lazyflag[i])lazyf(lazy[i], x);
        else {
            lazyflag[i] = true;
            lazy[i] = x;
        }
        while (i /= 2)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
    void update(int l, int r, U x) {
        l += n; r += n;
        int nl = l, nr = r;
        while (!(nl & 1))nl >>= 1;
        while (!(nr & 1))nr >>= 1;
        nr--;
        eval(nl); eval(nr);
        while (l < r) {
            if (l & 1) {
                updf(node[l], x, width[l]);
                if (lazyflag[l])lazyf(lazy[l], x);
                else {
                    lazyflag[l] = true;
                    lazy[l] = x;
                }
                l++;
            }
            if (r & 1) {
                r--;
                updf(node[r], x, width[r]);
                if (lazyflag[r])lazyf(lazy[r], x);
                else {
                    lazyflag[r] = true;
                    lazy[r] = x;
                }
            }
            l >>= 1; r >>= 1;
        }
        while (nl >>= 1)node[nl] = nodef(node[2 * nl], node[2 * nl + 1]);
        while (nr >>= 1)node[nr] = nodef(node[2 * nr], node[2 * nr + 1]);
    }
    T query(int l, int r) {
        l += n; r += n;
        eval(l); eval(r - 1);
        T ls = nodee, rs = nodee;
        while (l < r) {
            if (l & 1)ls = nodef(ls, node[l++]);
            if (r & 1)rs = nodef(node[--r], rs);
            l >>= 1; r >>= 1;
        }
        return nodef(ls, rs);
    }
    T operator[](const int& x) {
        eval(n + x);
        return node[n + x];
    }
    T queryForAll() {
        return node[1];
    }
};
class RAQRSQ :public IntervalSegTree<lint, lint> {
    lint nodef(const lint& a, const lint& b)const { return a + b; }
    void lazyf(lint& a, const lint& b) { a += b; }
    void updf(lint& a, const lint& b, const unsigned int& width) { a += width * b; }
public:
    RAQRSQ(int size, const lint& def = 0) :IntervalSegTree<lint, lint>(size, def, 0) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
    RAQRSQ(const std::vector<lint>& initvec) :IntervalSegTree<lint, lint>((lint)0, initvec) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
};
class RAQRMiQ :public IntervalSegTree<lint, lint> {
    lint nodef(const lint& a, const lint& b)const { return std::min(a, b); }
    void lazyf(lint& a, const lint& b) { a += b; }
    void updf(lint& a, const lint& b, const unsigned int& width) { a += b; }
public:
    RAQRMiQ(int size, const lint& def = 0) :IntervalSegTree<lint, lint>(size, def, LINF) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
    RAQRMiQ(const std::vector<lint>& initvec) :IntervalSegTree<lint, lint>(LINF, initvec) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
};
class RAQRMaQ :public IntervalSegTree<lint, lint> {
    lint nodef(const lint& a, const lint& b)const { return std::max(a, b); }
    void lazyf(lint& a, const lint& b) { a += b; }
    void updf(lint& a, const lint& b, const unsigned int& width) { a += b; }
public:
    RAQRMaQ(unsigned int size, const lint& def = 0) :IntervalSegTree<lint, lint>(size, def, -LINF) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
    RAQRMaQ(const std::vector<lint>& initvec) :IntervalSegTree<lint, lint>(-LINF, initvec) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
};
class RUQRSQ :public IntervalSegTree<lint, lint> {
    lint nodef(const lint& a, const lint& b)const { return a + b; }
    void lazyf(lint& a, const lint& b) { a = b; }
    void updf(lint& a, const lint& b, const unsigned int& width) { a = width * b; }
public:
    RUQRSQ(int size, const lint& def = 0) :IntervalSegTree<lint, lint>(size, def, 0) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
    RUQRSQ(const std::vector<lint>& initvec) :IntervalSegTree<lint, lint>((lint)0, initvec) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
};
class RUQRMiQ :public IntervalSegTree<lint, lint> {
    lint nodef(const lint& a, const lint& b)const { return std::min(a, b); }
    void lazyf(lint& a, const lint& b) { a = b; }
    void updf(lint& a, const lint& b, const unsigned int& width) { a = b; }
public:
    RUQRMiQ(int size, const lint& def = 0) :IntervalSegTree<lint, lint>(size, def, LINF) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
    RUQRMiQ(const std::vector<lint>& initvec) :IntervalSegTree<lint, lint>(LINF, initvec) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
};
class RUQRMaQ :public IntervalSegTree<lint, lint> {
    lint nodef(const lint& a, const lint& b)const { return std::max(a, b); }
    void lazyf(lint& a, const lint& b) { a = b; }
    void updf(lint& a, const lint& b, const unsigned int& width) { a = b; }
public:
    RUQRMaQ(int size, const lint& def = 0) :IntervalSegTree<lint, lint>(size, def, -LINF) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
    RUQRMaQ(const std::vector<lint>& initvec) :IntervalSegTree<lint, lint>(-LINF, initvec) {
        for (int i = n - 1; i > 0; i--)node[i] = nodef(node[2 * i], node[2 * i + 1]);
    }
};
#line 3 "main.cpp"
int N,Q;
std::vector<lint> a;
int main(){
    std::cin>>N;
    a.resize(N);
    rep(i,N)std::cin>>a[i];
    RAQRMiQ st(a);
    std::cin>>Q;
    rep(i,Q){
        int k,l,r,c;
        std::cin>>k>>l>>r>>c;
        l--;
        if(k==1)st.update(l,r,c);
        else std::cout<<st.query(l,r)<<std::endl;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0