結果

問題 No.877 Range ReLU Query
ユーザー hitonanodehitonanode
提出日時 2019-10-23 23:39:19
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 517 ms / 2,000 ms
コード長 6,445 bytes
コンパイル時間 3,561 ms
コンパイル使用メモリ 204,236 KB
実行使用メモリ 47,800 KB
最終ジャッジ日時 2024-11-15 04:49:37
合計ジャッジ時間 9,032 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 3 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 4 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 3 ms
5,248 KB
testcase_11 AC 476 ms
38,876 KB
testcase_12 AC 410 ms
38,260 KB
testcase_13 AC 311 ms
29,260 KB
testcase_14 AC 319 ms
26,880 KB
testcase_15 AC 510 ms
46,532 KB
testcase_16 AC 499 ms
45,404 KB
testcase_17 AC 517 ms
46,372 KB
testcase_18 AC 509 ms
46,864 KB
testcase_19 AC 226 ms
47,732 KB
testcase_20 AC 400 ms
47,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////

using T = vector<plint>;
struct SegTree
{
    int N;
    int head;
    vector<T> x;
    T defaultT;
    using func = function<T(const T&, const T&)>;
    func merger;
    lint _get(int begin, int end, int pos, int l, int r, lint q) const
    {
        if (r <= begin or l >= end) return 0;
        if (l >= begin and r <= end)
        {
            int i = lower_bound(ALL(x[pos]), plint(q, 0)) - x[pos].begin();
            if (i == (int)x[pos].size()) return 0;
            else return x[pos].back().second - (i ? x[pos][i - 1].second : 0) - q * (x[pos].size() - i);
        }
        return _get(begin, end, 2 * pos + 1, l, (l + r) / 2, q) + _get(begin, end, 2 * pos + 2, (l + r) / 2, r, q);
    }
    SegTree(int N, T defaultT, func merger) : N(N), defaultT(defaultT), merger(merger)
    {
        int N_tmp = 1; while (N_tmp < N) N_tmp <<= 1;
        x.assign(N_tmp*2, defaultT), head = N_tmp - 1;
    }
    SegTree(const vector<T> &vals, T defaultT, func merger) : N(vals.size()), defaultT(defaultT), merger(merger)
    {
        int N_tmp = 1; while (N_tmp < N) N_tmp <<= 1;
        x.assign(N_tmp*2, defaultT), head = N_tmp - 1;
        copy(vals.begin(), vals.end(), x.begin() + head);
        IREP(i, head) x[i] = merger(x[i * 2 + 1], x[i * 2 + 2]);
    }
    SegTree() : SegTree(0, T(), [](T, T) { return T(); }) {}
    void build(const vector<T> &vals) { copy(vals.begin(), vals.end(), x.begin() + head); IREP(i, head) x[i] = merger(x[i * 2 + 1], x[i * 2 + 2]); }
    void update(int pos, T val) { pos += head, x[pos] = val; while (pos) pos = (pos - 1) / 2, x[pos] = merger(x[pos*2+1], x[pos*2+2]); }
    lint get(int begin, int end, lint q) const { return _get(begin, end, 0, 0, (int)x.size() / 2, q); }
    // friend ostream &operator<<(ostream &os, const SegTree &s) { os << "["; REP(i, s.N) os << s.get(i, i + 1) << ","; os << "]"; return os; }
};
// 参考 要素数N・非負入力を想定したRange Maximum Query
// SegTree<int> rMq(N, 0, [](int a, int b) { return max(a, b); });


int main()
{
    int N, Q;
    cin >> N >> Q;
    vector<vector<plint>> A(N);
    REP(i, N)
    {
        lint a;
        cin >> a;
        A[i].emplace_back(a, a);
    }
    SegTree st(A, vector<plint>(), [](const T &l, const T &r) {
        if (l.empty()) return r;
        if (r.empty()) return l;
        // vector<plint> ret;
        // int N = l.size();
        // int M = r.size();
        // int i = 0, j = 0;
        // while (true)
        // {
        //     if (i >= N and j >= M) break;
        //     if (i >= N or (j < M and l[i].first >= r[j].first))
        //     {
        //         ret.emplace_back(r[j].first, r[j].first);
        //         j++;
        //     }
        //     else
        //     {
        //         ret.emplace_back(l[i].first, l[i].first);
        //         i++;
        //     }
        //     REP(i, ret.size() - 1) ret[i + 1].second = ret[i + 1].first + ret[i].second;
        // }
        vector<plint> ret = l;
        ret.insert(ret.end(), ALL(r));
        sort(ALL(ret));
        ret[0].second = ret[0].first;
        FOR(i, 1, ret.size()) ret[i].second = ret[i].first + ret[i - 1].second;
        return ret;
    });

    REP(_, Q)
    {
        int q, l, r, x;
        cin >> q >> l >> r >> x;
        printf("%lld\n", st.get(l - 1, r, x));
    }
}
0