結果

問題 No.924 紲星
ユーザー hitonanodehitonanode
提出日時 2019-11-08 22:57:05
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,028 bytes
コンパイル時間 2,143 ms
コンパイル使用メモリ 184,664 KB
実行使用メモリ 18,332 KB
最終ジャッジ日時 2024-09-15 02:04:50
合計ジャッジ時間 8,241 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,948 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 WA -
testcase_04 AC 2 ms
6,940 KB
testcase_05 WA -
testcase_06 AC 4 ms
6,944 KB
testcase_07 WA -
testcase_08 TLE -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
権限があれば一括ダウンロードができます

ソースコード

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;

vector<vector<lint>> vals;
vector<vector<lint>> accs;
constexpr int B = 400;

void bucket_resolve(int b)
{
    sort(ALL(vals[b]));
    accs[b].assign(vals[b].size() + 1, 0LL);
    REP(i, vals[b].size()) accs[b][i + 1] = accs[b][i] + vals[b][i];
}
vector<lint> A;

plint getvalue(int l, int r, lint q)
{
    lint n = 0;
    lint tot = 0;
    int bl = l / B;
    int br = (r - 1) / B;
    if (bl == br)
    {
        FOR(i, l, r) if (A[i] < q) n++, tot += A[i];
    }
    else
    {
        FOR(i, l, (bl + 1) * B) if (A[i] < q) n++, tot += A[i];
        FOR(i, (r - 1) / B * B, r) if (A[i] < q) n++, tot += A[i];
        FOR(b, bl + 1, (r - 1) / B + 1)
        {
            int i = lower_bound(ALL(vals[b]), q) - vals[b].begin();
            n += i, tot += accs[b][i];
        }
    }
    return make_pair(n, tot);
}

int main()
{
    int N, Q;
    cin >> N >> Q;
    int Nb = (N + B - 1) / B;
    A.resize(Nb * B);
    REP(i, N) cin >> A[i];
    vals.resize(Nb);
    accs.resize(Nb);
    REP(i, N)
    {
        vals[i / B].push_back(A[i]);
    }
    REP(i, Nb)
    {
        bucket_resolve(i);
    }
    vector<lint> AS = A;

    AS.push_back(-1e9 - 5);
    AS.push_back(1e9 + 5);
    sort(ALL(AS));
    REP(_, Q)
    {
        int L, R;
        cin >> L >> R;
        L--;
        int lo = 0, hi = AS.size() - 1;
        while (hi > lo + 1)
        {
            int c = (lo + hi) / 2;
            plint p = getvalue(L, R, AS[c]);
            if (p.first <= (R - L) / 2) lo = c;
            else hi = c;
        }
        plint upper = getvalue(L, R, 1e9 + 10);
        lint q = AS[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