結果

問題 No.2065 Sum of Min
ユーザー haruki_Kharuki_K
提出日時 2022-09-24 06:59:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 170 ms / 2,000 ms
コード長 11,802 bytes
コンパイル時間 2,560 ms
コンパイル使用メモリ 225,020 KB
実行使用メモリ 26,436 KB
最終ジャッジ日時 2023-08-23 21:17:02
合計ジャッジ時間 9,627 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 119 ms
25,960 KB
testcase_05 AC 114 ms
25,624 KB
testcase_06 AC 101 ms
25,228 KB
testcase_07 AC 86 ms
26,432 KB
testcase_08 AC 115 ms
25,512 KB
testcase_09 AC 160 ms
26,100 KB
testcase_10 AC 140 ms
26,124 KB
testcase_11 AC 140 ms
25,472 KB
testcase_12 AC 169 ms
26,060 KB
testcase_13 AC 168 ms
25,620 KB
testcase_14 AC 168 ms
25,744 KB
testcase_15 AC 168 ms
25,844 KB
testcase_16 AC 169 ms
26,132 KB
testcase_17 AC 170 ms
26,172 KB
testcase_18 AC 167 ms
25,936 KB
testcase_19 AC 169 ms
25,408 KB
testcase_20 AC 169 ms
26,436 KB
testcase_21 AC 169 ms
26,212 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
using pii = pair<int, int>;
#define rep(i, n) if (const int _rep_n = n; true) for (int i = 0; i < _rep_n; i++)
#define rep1(i, n) if (const int _rep_n = n; true) for (int i = 1; i <= _rep_n; i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#define oj_local(x, y) (y)
#else
#define dump(...) (void)(0)
#define debug if (0)
#define oj_local(x, y) (x)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t)
{ bool f = true; apply([&](auto&&... x) { ((os << (f ? f = false, "" : " ") << x), ...); }, t); return os; }
template <class... T> istream& operator>>(istream& is, tuple<T...>& t) { apply([&](auto&&... x) { ((is >> x), ...); }, t); return is; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define def(name, ...) auto name = MakeFixPoint() | [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << '\n'; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T, class = decltype(begin(declval<T&>()))> constexpr auto min(T const& a) { return *min_element(begin(a), end(a)); }
template <class T, class = decltype(begin(declval<T&>()))> constexpr auto max(T const& a) { return *max_element(begin(a), end(a)); }
template <class T> constexpr T min(set<T> const& st) { assert(st.size()); return *st.begin(); }
template <class T> constexpr T max(set<T> const& st) { assert(st.size()); return *prev(st.end()); }
template <class T> constexpr T min(multiset<T> const& st) { assert(st.size()); return *st.begin(); }
template <class T> constexpr T max(multiset<T> const& st) { assert(st.size()); return *prev(st.end()); }
constexpr ll max(signed x, ll y) { return max<ll>(x, y); }
constexpr ll max(ll x, signed y) { return max<ll>(x, y); }
constexpr ll min(signed x, ll y) { return min<ll>(x, y); }
constexpr ll min(ll x, signed y) { return min<ll>(x, y); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
auto four_nbd(int n, int m) {
    static vector<pair<int, int>> v;
    return [n, m](int i, int j) {
        const int dx[] = { 1, 0, -1, 0 }, dy[] = { 0, 1, 0, -1 };
        v.clear();
        rep (dir, 4) {
            int ni = i+dx[dir], nj = j+dy[dir];
            if (0 <= ni and ni < n and 0 <= nj and nj < m) {
                v.emplace_back(ni, nj);
            }
        }
        return v;
    };
};
template <class Comp> vector<int> iota(int n, Comp comp) {
    vector<int> idx(n);
    iota(begin(idx), end(idx), 0);
    stable_sort(begin(idx), end(idx), comp);
    return idx;
}
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
bool next_product(vector<int> &v, int m) {
    repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0;
    return false;
}
bool next_product(vector<int> &v, vector<int> const& s) {
    repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0;
    return false;
}
template <class vec> int sort_unique(vec &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
    return v.size();
}
template <class It> auto prefix_sum(It l, It r) {
    vector<typename It::value_type> s = { 0 };
    while (l != r) s.emplace_back(s.back() + *l++);
    return s;
}
template <class It> auto suffix_sum(It l, It r) {
    vector<typename It::value_type> s = { 0 };
    while (l != r) s.emplace_back(*--r + s.back());
    reverse(s.begin(), s.end());
    return s;
}
template <class T> T pop(vector<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T> T pop_back(vector<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T, class V, class C> T pop(priority_queue<T, V, C> &a) { auto x = a.top(); a.pop(); return x; }
template <class T> T pop(queue<T> &a) { auto x = a.front(); a.pop(); return x; }
template <class T> T pop_front(deque<T> &a) { auto x = a.front(); a.pop_front(); return x; }
template <class T> T pop_back(deque<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T> T pop_front(set<T> &a) { auto x = *a.begin(); a.erase(a.begin()); return x; }
template <class T> T pop_back(set<T> &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; }
template <class T> T pop_front(multiset<T> &a) { auto it = a.begin(); auto x = *it; a.erase(it); return x; }
template <class T> T pop_back(multiset<T> &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; }
// <<<
// >>> BIT

template <class T> struct BIT {
    int n;
    const T zero;
    vector<T> v; // use v[1..n]
    BIT(int n = 0, T zero = 0) : n(n), zero(zero), v(n+1, zero) {}
    int size() const { return n; }
    void clear() { fill(v.begin(), v.end(), zero); }
    T operator[](int i) const { return get(i); }
    T get(int i) const { return sum(i+1)-sum(i); }
    void set(int i, T x) { add(i, x-get(i)); }
    void add(int i, T x) {
        assert(0 <= i); assert(i < n);
        for (i++; i <= n; i += i&(-i)) v[i] += x;
    }
    T sum(int r) const { // [0, r)
        assert(0 <= r); assert(r <= n);
        T s = zero;
        for (int i = r; i > 0; i -= i&(-i)) s += v[i];
        return s;
    }
    T sum(int l, int r) const { // [l, r)
        return sum(r)-sum(l);
    }
    vector<T> dat() const {
        auto ret = v;
        for (int i = n; i >= 1; --i) {
            int j = i + (i&-i);
            if (j <= n) ret[j] -= ret[i];
        }
        ret.erase(ret.begin());
        return ret;
    }
#ifdef LOCAL
    friend string to_s(BIT const& bit) {
        return to_s(bit.dat());
    }
#endif
};

// <<<
// >>> coordinate compression

template <class T> struct Compress {
    vector<T> v;
    bool ok = false;
    template <class... Ts> Compress(Ts const&... xs) { add(xs...); build(); }
    int size() const { return v.size(); }
    void build() {
        sort(begin(v), end(v));
        v.erase(unique(begin(v), end(v)), end(v));
        ok = true;
    }

    T operator[](int i) const { assert(ok); return v[i]; }
    int lbd(T const& x) const {
        assert(ok);
        return lower_bound(begin(v), end(v), x) - begin(v);
    }
    int find(T const& x) const {
        int i = lbd(x);
        assert(i < size() and v[i] == x);
        return i;
    }

    void add(T const& x) { ok = false; v.push_back(x); }
    template <class V, class = decltype(begin(declval<V&>()))>
    void add(V const& u) { ok = false; copy(begin(u), end(u), back_inserter(v)); }
    template <class... Ts, enable_if_t<sizeof...(Ts) >= 2, int> = 0>
    void add(Ts const&... xs) { (add(xs), ...); }
    void add() {}

    void set(T& x) const { x = find(x); }
    template <class V, class = decltype(begin(declval<V&>()))>
    void set(V& u) const { for (auto &x : u) x = find(x); }
    template <class... Ts> void set(Ts&... xs) const { (set(xs), ...); }
    void set() {}
};

// <<<

int32_t main() {
    int n, q; cin >> n >> q;
    vector<int> a(n); cin >> a;
    vector<int> l(q), r(q), x(q);
    rep (i, q) cin >> l[i] >> r[i] >> x[i], --l[i];

    Compress<int> Z(a, x);
    Z.set(a, x);

    vector<int> ans(q);
    vector<tuple<int, int, int, int>> qs;
    rep (i, q) {
        qs.eb(l[i], -1, i, -1);
        qs.eb(r[i], -1, i, +1);
    }
    rep (i, n) {
        qs.eb(i, 1, 0, 0);
    }
    sort(all(qs));

    BIT<int> cnt(Z.size()), sum(Z.size());
    for (auto [i, t, qi, add] : qs) {
        if (t < 0) {
            int c = cnt.sum(x[qi]), s = sum.sum(x[qi]);
            int val = s + (i-c) * Z[x[qi]];
            ans[qi] += val * add;
        } else {
            cnt.add(a[i], +1);
            sum.add(a[i], Z[a[i]]);
        }
    }

    rep (i, q) cout << ans[i] << '\n';




}
0