#396613 (C++14) No.924 紲星

提出ソース

結果

問題	No.924 紲星
ユーザー	hitonanode
提出日時	2019-11-08 22:15:00
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	6,571 bytes
コンパイル時間	2,283 ms
コンパイル使用メモリ	184,004 KB
実行使用メモリ	134,716 KB
最終ジャッジ日時	2024-09-15 01:34:13
合計ジャッジ時間	8,211 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 10,752 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	10 ms 5,376 KB
testcase_04	AC	5 ms 5,376 KB
testcase_05	AC	11 ms 5,376 KB
testcase_06	AC	11 ms 5,376 KB
testcase_07	AC	5 ms 5,376 KB
testcase_08	TLE	-
testcase_09	--	-
testcase_10	--	-
testcase_11	--	-
testcase_12	--	-
testcase_13	--	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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 /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

struct Node
{
    vector<lint> v;
    vector<lint> acc;
    Node() {}
};

struct LazySegTree
{
    using T_NODE = Node;
    using T_RETVAL = plint; // number, sum
    T_NODE zero_node = Node();
    T_RETVAL zero_retval = plint(0, 0);

    int N;
    int head;
    vector<T_NODE> vvalue;

    void merge_node(int pos)
    {
        // Here, you have to calculate vvalue[pos] from children (vvalue[l], vvalue[r]),
        // Assumptions: `vdelay[pos] = vdelay[l] = vdelay[r] = zero_delay`
        int l = pos * 2 + 1, r = pos * 2 + 2;
        vvalue[pos].v = vvalue[l].v;
        vvalue[pos].v.insert(vvalue[pos].v.end(), vvalue[r].v.begin(), vvalue[r].v.end());
        sort(ALL(vvalue[pos].v));
        vvalue[pos].acc.assign(vvalue[pos].v.size() + 1, 0);
        REP(i, vvalue[pos].v.size()) vvalue[pos].acc[i + 1] = vvalue[pos].acc[i] + vvalue[pos].v[i];
    }

    T_RETVAL calc_retval(int pos, int query)
    {
        // Assumption: `vdelay[pos] = zero_delay`
        auto itr = lower_bound(ALL(vvalue[pos].v), query);
        int i = itr - vvalue[pos].v.begin();
        return make_pair(i, vvalue[pos].acc[i]); // query未満の数の個数、総和
    }
    T_RETVAL merge_retval(const T_RETVAL &l, const T_RETVAL &r)
    {
        return l + r;
    }

    ////// general description //////
    LazySegTree(const vector<T_NODE> &val_init) : N(val_init.size())
    {
        int N_tmp = 1;
        while (N_tmp < N) N_tmp <<= 1;
        vvalue.assign(N_tmp * 2, zero_node);
        head = N_tmp - 1;
        copy(val_init.begin(), val_init.end(), vvalue.begin() + head);
        for (int pos = head - 1; pos >= 0; pos--)
        {
            merge_node(pos);
        }
    }

    T_RETVAL getvalue(int begin, int end, int query, int pos=0, int l=0, int r=-1) // Get value in [begin, end)
    {
        if (r < 0) r = head + 1;
        if (begin <= l and r <= end) return calc_retval(pos, query);
        else if (begin < r and l < end) {
            T_RETVAL vl = getvalue(begin, end, query, pos * 2 + 1, l, (l + r) / 2);
            T_RETVAL vr = getvalue(begin, end, query, pos * 2 + 2, (l + r) / 2, r);
            return merge_retval(vl, vr);
        }
        else return zero_retval;
    }
};

int main()
{
    int N, Q;
    cin >> N >> Q;
    vector<lint> A(N);
    cin >> A;
    vector<Node> nodes(N);
    REP(i, N)
    {
        nodes[i].v.push_back(A[i]);
        nodes[i].acc.push_back(0);
        nodes[i].acc.push_back(A[i]);
    }
    LazySegTree lst(nodes);
    REP(_, Q)
    {
        int L, R;
        cin >> L >> R;
        L--;
        lint lo = -1e9 - 10, hi = 1e9 + 10;
        while (hi > lo + 1)
        {
            int c = (lo + hi) / 2;
            plint p = lst.getvalue(L, R, c);
            if (p.first <= (R - L) / 2) lo = c;
            else hi = c;
        }
        plint upper = lst.getvalue(L, R, 1e9 + 10);
        lint q = lo;
        plint lower = lst.getvalue(L, R, q);
        upper = upper - lower;
        lint ret = upper.second - upper.first * q + lower.first * q - lower.second;
        printf("%lld\n", ret);
    }
}

yukicoder

結果

テストケース

ソースコード