結果
| 問題 | No.1234 典型RMQ |
| ユーザー |
 minato
|
| 提出日時 | 2020-09-18 21:55:52 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 113 ms / 2,000 ms |
| コード長 | 7,931 bytes |
| コンパイル時間 | 3,323 ms |
| コンパイル使用メモリ | 220,352 KB |
| 最終ジャッジ日時 | 2025-01-14 17:05:32 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 27 |
ソースコード
//#pragma GCC target("avx2,avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")//#include <atcoder/all>//using namespace atcoder;//using mint = modint998244353;//using mint = modint1000000007;#include <bits/stdc++.h>using namespace std;//#include <ext/pb_ds/assoc_container.hpp>//#include <ext/pb_ds/tree_policy.hpp>//using namespace __gnu_pbds;//using i128 = __int128_t;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;using pll = pair<long long, long long>;#define rep(i, n) for(int i = 0; i < (n); ++i)#define all(x) (x).begin(),(x).end()#define SZ(x) ((int)(x).size())constexpr char ln = '\n';template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}inline int popcount(int x) {return __builtin_popcount(x);}inline int popcount(long long x) {return __builtin_popcountll(x);}inline int kthbit(long long x, int k) {return (x>>k)&1;}inline void print() {cout << "\n";}template<class T>inline void print(const vector<T> &v) {for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";print();}template<class T, class... Args>inline void print(const T &x, const Args &... args) {cout << x << " ";print(args...);}#ifdef MINATO_LOCAL#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;inline void debug() {cerr << endl;}template<class T>inline void debug(const vector<T> &v) {for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";debug();}template<class T, class... Args>inline void debug(const T &x, const Args &... args) {cerr << x << " ";debug(args...);}#else#define dump(x) void(0)inline void debug() {}template<class T> inline void debug(const vector<T> &v) {}template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}#endifstruct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////template<typename T, typename U, typename F, typename G, typename H>struct LazySegmentTree {private:F op;G mapping;H composition;T e;U id;int _n, size ,log;vector<T> node;vector<U> lazy;public:LazySegmentTree() {}LazySegmentTree(const F& op, const G& mapping, const H& composition, T e, U id, int n): LazySegmentTree(op, mapping, composition, e, id, vector<T>(n, e)) {}LazySegmentTree(const F& op, const G& mapping, const H& composition, T e, U id, const vector<T>& v): op(op), mapping(mapping), composition(composition), e(e), id(id),_n(int(v.size())), log(0) {while ((1<<log) < _n) log++;size = 1 << log;node = vector<T>(2 * size, e);lazy = vector<U>(size, id);for (int i = 0; i < _n; i++) node[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, T x) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);node[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}// [l, r) (0-indexed)T get(int l, int r) {if (l >= r) return e;l += size;r += size;for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push(r >> i);}T sml = e, smr = e;while (l < r) {if (l & 1) sml = op(sml, node[l++]);if (r & 1) smr = op(node[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}T all_get() { return node[1]; }void apply(int p, U val) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);node[p] = mapping(node[p], val);for (int i = 1; i <= log; i++) update(p >> i);}void apply(int l, int r, U val) {if (l >= r) return;l += size;r += size;for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push((r - 1) >> i);}{int l2 = l, r2 = r;while (l < r) {if (l & 1) all_apply(l++, val);if (r & 1) all_apply(--r, val);l >>= 1;r >>= 1;}l = l2;r = r2;}for (int i = 1; i <= log; i++) {if (((l >> i) << i) != l) update(l >> i);if (((r >> i) << i) != r) update((r - 1) >> i);}}template <typename C>int max_right(int l, const C& check) {assert(0 <= l && l <= _n);assert(check(e));if (l == _n) return _n;l += size;for (int i = log; i >= 1; i--) push(l >> i);T sm = e;do {while (~l & 1) l >>= 1;if (!check(op(sm, node[l]))) {while (l < size) {push(l);l = (2 * l);if (check(op(sm, node[l]))) {sm = op(sm, node[l]);l++;}}return l - size;}sm = op(sm, node[l]);l++;} while ((l & -l) != l);return _n;}template <typename C>int min_left(int r, const C& check) {assert(0 <= r && r <= _n);assert(check(e));if (r == 0) return 0;r += size;for (int i = log; i >= 1; i--) push((r - 1) >> i);T sm = e;do {r--;while (r > 1 && (r & 1)) r >>= 1;if (!check(op(node[r], sm))) {while (r < size) {push(r);r = (2 * r + 1);if (check(op(node[r], sm))) {sm = op(node[r], sm);r--;}}return r + 1 - size;}sm = op(node[r], sm);} while ((r & -r) != r);return 0;}T operator[](int p) {assert(0 <= p && p < _n);p += size;for (int i = log; i >= 1; i--) push(p >> i);return node[p];}private:void update(int k) { node[k] = op(node[2 * k], node[2 * k + 1]); }void all_apply(int k, U val) {node[k] = mapping(node[k], val);if (k < size) lazy[k] = composition(lazy[k], val);}void push(int k) {all_apply(2 * k, lazy[k]);all_apply(2 * k + 1, lazy[k]);lazy[k] = id;}};int main() {int N; cin >> N;vector<ll> A(N);rep(i,N) cin >> A[i];auto f=[](ll a, ll b) {return min(a,b);};auto g=[](ll a, ll val) {return a+val;};const ll e = 1e18;const ll id = 0;LazySegmentTree seg(f,g,g,e,id,A);int Q; cin >> Q;while (Q--) {ll k,l,r,c; cin >> k >> l >> r >> c;l--;if (k==1) {seg.apply(l,r,c);} else {cout << seg.get(l,r) << ln;}}}