結果

問題 No.924 紲星
コンテスト
ユーザー hitonanode
提出日時 2019-11-09 18:21:24
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2,809 ms / 4,000 ms
コード長 5,655 bytes
コンパイル時間 2,500 ms
コンパイル使用メモリ 192,500 KB
実行使用メモリ 31,140 KB
最終ジャッジ日時 2024-09-15 04:43:47
合計ジャッジ時間 24,807 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx")
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> A, Aacc;
// 1-indexed BIT (i : [1, len])
int N, Q;
struct BIT
{
    using T = lint;
    int len;
    vector<T> val;
    BIT(int num) : len(num), val(num + 1) {}
    BIT() : BIT(0) {}
    void reset() { fill(val.begin(), val.end(), 0); }
    void add(int pos, T v) { while (pos > 0 and pos <= len) val[pos] += v, pos += pos & -pos; }
    T sum(int pos) const // (0, pos]
    {
        T res = 0;
        while (pos > 0) res += val[pos], pos -= pos & -pos;
        return res;
    }
};
template<typename T> ostream &operator<<(ostream &os, const BIT &b){ T prv = 0; os << "["; REP(i, b.len) { T nxt = b.sum(i + 1); os << nxt - prv << ","; prv = nxt; } os << "]"; return os; }

BIT cou, tot;
vector<int> L, R;
vector<plint> solve(const vector<lint> &c)
{
    cou = BIT(N + 1);
    tot = BIT(N + 1);
    vector<plint> ret(Q);
    priority_queue<plint, vector<plint>, greater<plint>> pq, as;
    REP(i, Q) pq.emplace(c[i], i);
    REP(i, N) as.emplace(A[i], i);
    while (!pq.empty())
    {
        lint q, i;
        tie(q, i) = pq.top();
        while (!as.empty() and as.top().first < q)
        {
            lint i, val;
            tie(val, i) = as.top();
            as.pop();
            cou.add(i + 1, 1);
            tot.add(i + 1, val);
        }
        pq.pop();
        ret[i].first = cou.sum(R[i]) - cou.sum(L[i]);
        ret[i].second = tot.sum(R[i]) - tot.sum(L[i]);
    }
    return ret;
}

int main()
{
    cin >> N >> Q;
    A.resize(N);
    cin >> A;
    Aacc.resize(N + 1);
    REP(i, N) Aacc[i + 1] = Aacc[i] + A[i];
    L.resize(Q);
    R.resize(Q);
    REP(i, Q) cin >> L[i] >> R[i];
    REP(i, Q) L[i]--;
    vector<lint> B = A;
    B.emplace_back(-1e9 - 10);
    B.emplace_back(1e9 + 10);
    sort(ALL(B));
    B.erase(unique(ALL(B)), B.end());
    vector<int> lo(Q, 0), hi(Q, (int)B.size());
    REP(_, 19)
    {
        vector<int> cid(Q);
        vector<lint> c(Q);
        REP(i, Q)
        {
            cid[i] = (lo[i] + hi[i]) / 2;
            c[i] = B[cid[i]];
        }
        vector<plint> ret = solve(c);
        REP(i, Q)
        {
            if (ret[i].first <= (R[i] - L[i]) / 2) lo[i] = cid[i];
            else hi[i] = cid[i];
        }
    }
    vector<lint> q(Q);
    REP(i, Q) q[i] = B[lo[i]];
    vector<plint> ret = solve(q);
    REP(i, Q)
    {
        lint m = q[i];
        lint n = R[i] - L[i];
        lint T = Aacc[R[i]] - Aacc[L[i]];
        printf("%lld\n", (T - ret[i].second - (n - ret[i].first) * m) + ret[i].first * m - ret[i].second);
    }
}
0