結果

問題 No.924 紲星
ユーザー 👑 hitonanodehitonanode
提出日時 2019-11-08 22:38:36
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 4,989 bytes
コンパイル時間 2,114 ms
コンパイル使用メモリ 179,552 KB
実行使用メモリ 113,816 KB
最終ジャッジ日時 2023-10-13 04:14:58
合計ジャッジ時間 8,734 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
36,508 KB
testcase_01 AC 30 ms
36,328 KB
testcase_02 AC 30 ms
36,264 KB
testcase_03 AC 35 ms
36,408 KB
testcase_04 AC 32 ms
36,396 KB
testcase_05 AC 39 ms
36,564 KB
testcase_06 AC 34 ms
36,412 KB
testcase_07 AC 34 ms
36,632 KB
testcase_08 TLE -
testcase_09 TLE -
testcase_10 TLE -
testcase_11 TLE -
testcase_12 TLE -
testcase_13 AC 2,294 ms
62,336 KB
testcase_14 AC 2,366 ms
52,556 KB
testcase_15 AC 2,064 ms
57,064 KB
testcase_16 AC 1,291 ms
99,296 KB
testcase_17 AC 3,632 ms
62,928 KB
testcase_18 AC 30 ms
36,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3", "unroll-loops")
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 /////


vector<lint> v[1 << 19];
vector<lint> acc[1 << 19];

constexpr int Ntmp = 1 << 18;
constexpr int head = Ntmp - 1;

plint getvalue(int begin, int end, lint 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)
    {
        auto itr = lower_bound(ALL(v[pos]), query);
        int i = itr - v[pos].begin();
        return make_pair(i, acc[pos][i]); // query未満の数の個数、総和
    }
    else if (begin < r and l < end) {
        plint vl = getvalue(begin, end, query, pos * 2 + 1, l, (l + r) / 2);
        plint vr = getvalue(begin, end, query, pos * 2 + 2, (l + r) / 2, r);
        return vl + vr;
    }
    else return plint(0, 0);
}

int main()
{
    int N, Q;
    cin >> N >> Q;
    vector<lint> A(N);
    cin >> A;
    REP(i, N)
    {
        v[head + i].push_back(A[i]);
        acc[head + i].push_back(0);
        acc[head + i].push_back(A[i]);
    }
    for (int pos = head - 1; pos >= 0; pos--)
    {
        int l = pos * 2 + 1, r = pos * 2 + 2;
        merge(ALL(v[l]), ALL(v[r]), back_inserter(v[pos]));
        acc[pos].assign(v[pos].size() + 1, 0);
        REP(i, v[pos].size()) acc[pos][i + 1] = acc[pos][i] + v[pos][i];
    }

    A.push_back(-1e9 - 5);
    A.push_back(1e9 + 5);
    sort(ALL(A));

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