#794830 (C++17) No.2065 Sum of Min

• 問題: No.2065 Sum of Min
• ユーザー: first_vil
• 提出日時: 2022-09-02 22:11:16
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 110 ms / 2,000 ms
• コード長: 5,790 bytes
• コンパイル時間: 2,411 ms
• コンパイル使用メモリ: 215,732 KB
• 実行使用メモリ: 17,420 KB
• 最終ジャッジ日時: 2024-11-16 03:48:28
• 合計ジャッジ時間: 6,918 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	85 ms; 17,292 KB
testcase_05	AC	86 ms; 17,288 KB
testcase_06	AC	97 ms; 17,288 KB
testcase_07	AC	106 ms; 17,156 KB
testcase_08	AC	110 ms; 17,160 KB
testcase_09	AC	104 ms; 17,416 KB
testcase_10	AC	99 ms; 17,288 KB
testcase_11	AC	95 ms; 17,288 KB
testcase_12	AC	104 ms; 17,164 KB
testcase_13	AC	105 ms; 17,292 KB
testcase_14	AC	104 ms; 17,416 KB
testcase_15	AC	104 ms; 17,312 KB
testcase_16	AC	104 ms; 17,288 KB
testcase_17	AC	105 ms; 17,160 KB
testcase_18	AC	104 ms; 17,288 KB
testcase_19	AC	103 ms; 17,420 KB
testcase_20	AC	103 ms; 17,288 KB
testcase_21	AC	106 ms; 17,288 KB

ソースコード

// clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using G = V<VI>;
template<class T> using WG = V<V<pair<int, T>>>;
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=0;i<(n);++i)
#define rep3(i,a,b) for(ll i=(a);i<(b);++i)
#define rep4(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i=n;i>0;--i)
#define rrep2(i,n) for(ll i=n;i>0;--i)
#define rrep3(i,a,b) for(ll i=b;i>a;--i)
#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define debug(...) print(__VA_ARGS__)
#else
#define line
#define debug
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 };
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T> inline V<T> vec(size_t a) { return V<T>(a); }
template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T> inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T> inline constexpr const T cum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r]
template<class T> inline constexpr const auto min(const T& v) { return *min_element(all(v)); }
template<class T> inline constexpr const auto max(const T& v) { return *max_element(all(v)); }
template<class T> inline V<T>& operator++(V<T>& v) { for (T& a : v)++a; return v; }
template<class T> inline V<T>& operator--(V<T>& v) { for (T& a : v)--a; return v; }
// clang-format on

template<class T> class compress {
    vector<T> xs;

public:
    compress() {}
    compress(const vector<T>& vs) { add(vs); }
    inline void add(const vector<T>& vs) { copy(all(vs), back_inserter(xs)); }
    inline void add(const T& x) { xs.emplace_back(x); }
    inline void build() {
        sort(all(xs));
        xs.erase(unique(all(xs)), xs.end());
    }
    inline int idx(const T& x) const {
        return lower_bound(all(xs), x) - xs.begin();
    }
    inline T operator[](int k) const { return xs[k]; }
    inline int size() const { return xs.size(); }
};

template<class T> class BinaryIndexedTree {
    int n;
    vector<T> dat;

public:
    BinaryIndexedTree(int n) : n(n), dat(n + 1){};
    BinaryIndexedTree(int n, T a) : n(n), dat(n + 1) {
        for (int i = 1; i <= n; ++i) {
            dat[i] += a;
            if (i + (i & -i) <= n) dat[i + (i & -i)] += dat[i];
        }
    }
    BinaryIndexedTree(V<T> v) : n(v.size()), dat(n + 1) {
        for (int i = 1; i <= n; ++i) {
            dat[i] += v[i - 1];
            if (i + (i & -i) <= n) dat[i + (i & -i)] += dat[i];
        }
    }
    void add(int i, T a) {
        for (++i; i <= n; i += i & -i) dat[i] += a;
    }
    T sum(int r) {  // sum of [0,r)
        T res = 0;
        for (; r; r -= r & -r) res += dat[r];
        return res;
    }
    T sum(int l, int r) {  // sum of [l,r)
        if (l < 0 || n < r || l > r) return 0;
        return sum(r) - sum(l);
    }
    int lower_bound(T a) {
        int res = 0, k = 1;
        while (k * 2 <= n) k *= 2;
        for (; k; k /= 2) {
            if (res + k <= n && a > dat[res + k]) {
                a -= dat[res + k];
                res += k;
            }
        }
        return res;
    }
};

int main() {
    init();

    int n, q;
    cin >> n >> q;
    VL a(n);
    cin >> a;

    VL ans(q);
    V<tuple<ll, int, int, int>> task;  // x(lr)i
    rep(i, n) task.emplace_back(a[i], 0, i, 0);
    rep(i, q) {
        int l, r;
        ll x;
        cin >> l >> r >> x;
        ans[i] += (r - l + 1) * x;
        task.emplace_back(x, l - 1, i, -1);
        task.emplace_back(x, r, i, +1);
    }
    sort(all(task));
    BinaryIndexedTree<ll> bit(n), cnt(n);
    for (auto [x, r, i, p] : task) {
        if (p == 0) {
            bit.add(i, x);
            cnt.add(i, 1);
        }
        else {
            ans[i] += bit.sum(r) * p;
            ans[i] += cnt.sum(r) * x * p * -1;
        }
    }
    for (auto x : ans) print(x);

    return 0;
}