結果

問題 No.924 紲星
ユーザー haruki_Kharuki_K
提出日時 2019-11-10 18:29:49
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 726 ms / 4,000 ms
コード長 6,078 bytes
コンパイル時間 2,166 ms
コンパイル使用メモリ 186,860 KB
実行使用メモリ 40,088 KB
最終ジャッジ日時 2024-09-15 05:02:38
合計ジャッジ時間 9,430 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 3 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 712 ms
40,088 KB
testcase_09 AC 712 ms
39,832 KB
testcase_10 AC 715 ms
39,956 KB
testcase_11 AC 716 ms
39,960 KB
testcase_12 AC 726 ms
40,088 KB
testcase_13 AC 258 ms
19,492 KB
testcase_14 AC 233 ms
17,028 KB
testcase_15 AC 228 ms
17,160 KB
testcase_16 AC 342 ms
27,736 KB
testcase_17 AC 379 ms
23,804 KB
testcase_18 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// {{{
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", my_dmp(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void my_dmp(const char*) { cerr << endl; }
template <class T, class... U> void my_dmp(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; my_dmp(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
#define int ll
#define double ld
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct my_Init { my_Init() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } my_init;
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// }}}
////////////////////////////////
//
template <class T>
struct Compress {
    vector<T> v;
    bool ok = false;
    void add(T const& x) { ok = false; v.push_back(x); }
    template <class It>
    void add(It f, It l) { ok = false; copy(f,l,back_inserter(v)); }
    void init() { sort(all(v)); v.erase(unique(all(v)), v.end()); ok = true; }
    int size() const { return v.size(); }
    T operator[](int i) const { assert(ok); return v[i]; }
    int find(T const& x) const { assert(ok); return lower_bound(all(v),x)-v.begin(); }
};
//
//
struct BIT {
    int n;
    vector<int> v; // use v[1..n]
    BIT(int n) : n(n), v(n+1) {}
    int get(int i) const { assert(0 <= i && i < n); return v[i+1]; }
    void add(int i, int x) {
        assert(0 <= i && i < n);
        for (i++; i <= n; i += i&(-i)) v[i] += x;
    }
    int sum(int r) const { // [0,r)
        assert(0 <= r && r <= n);
        int s = 0;
        for (int i = r; i > 0; i -= i&(-i)) s += v[i];
        return s;
    }
    int sum(int l, int r) const { // [l,r)
        return sum(r)-sum(l);
    }
};
//

int32_t main() {
    int n,q; cin >> n >> q;
    vector<int> a(n); cin >> a;
    vector<int> ql(q),qr(q);
    rep (i,q) cin >> ql[i] >> qr[i], ql[i]--;

    Compress<int> X;
    X.add(-INF); X.add(+INF);
    rep (i,n) X.add(a[i]);
    X.init();
    rep (i,n) a[i] = X.find(a[i]);

    vector<pair<int,int> > b(n);
    rep (i,n) b[i] = mp(a[i],i);
    sort(all(b));
    vec<int,2> u(X.size());
    rep (i,n) u[b[i].fst].eb(b[i].snd);

    //
    dump(X.v);

    vector<int> l(q, 0), r(q, X.size()-1), m(q);
    while (1) {
        rep (i,q) m[i] = (l[i]+r[i])/2;
        vec<int,2> v(X.size());
        rep (i,q) v[m[i]].eb(i);

        bool flag = false;
        BIT bit(n);
        rep (i,X.size()) {
            for (int pos : u[i]) bit.add(pos,1);
            for (int j : v[i]) {
                if (l[j]+1 < r[j]) {
                    int cnt = bit.sum(ql[j],qr[j]);
                    (cnt >= (qr[j]-ql[j]+1)/2 ? r[j] : l[j]) = m[j];
                    flag = true;
                }
            }
        }
        if (!flag) break;
    }

    rep (i,q) m[i] = r[i];
    vec<int,2> v(X.size());
    rep (i,q) v[m[i]].eb(i);

    //
    debug {
        dump(m);
        vector<int> m_actual(q);
        rep (i,q) m_actual[i] = X[m[i]];
        dump(m_actual);
    }

    vector<int> ans(q);
    rep (t,2) {
        BIT bcnt(n), bsum(n);
        rep (ii,X.size()) {
            int i = (t == 0 ? ii : X.size()-1-ii);
            for (int pos : u[i]) {
                bcnt.add(pos, 1);
                bsum.add(pos, X[i]);
            }
            for (int j : v[i]) {
                int val = X[m[j]]*bcnt.sum(ql[j],qr[j])
                    - bsum.sum(ql[j],qr[j]);
                if (t == 0) {
                    ans[j] += val;
                } else {
                    ans[j] -= val;
                }
            }
        }
    }

    rep (i,q) cout << ans[i] << "\n";

}
0