結果

問題 No.956 Number of Unbalanced
ユーザー 👑 hitonanodehitonanode
提出日時 2019-12-19 23:08:17
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 888 ms / 2,000 ms
コード長 7,349 bytes
コンパイル時間 2,205 ms
コンパイル使用メモリ 193,400 KB
実行使用メモリ 20,076 KB
最終ジャッジ日時 2023-09-21 07:37:58
合計ジャッジ時間 16,787 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 513 ms
16,384 KB
testcase_07 AC 568 ms
15,516 KB
testcase_08 AC 482 ms
16,136 KB
testcase_09 AC 352 ms
14,472 KB
testcase_10 AC 461 ms
14,200 KB
testcase_11 AC 708 ms
18,020 KB
testcase_12 AC 525 ms
16,576 KB
testcase_13 AC 158 ms
16,180 KB
testcase_14 AC 880 ms
20,020 KB
testcase_15 AC 284 ms
15,844 KB
testcase_16 AC 614 ms
18,696 KB
testcase_17 AC 285 ms
15,980 KB
testcase_18 AC 886 ms
20,056 KB
testcase_19 AC 278 ms
15,800 KB
testcase_20 AC 888 ms
20,076 KB
testcase_21 AC 159 ms
16,292 KB
testcase_22 AC 286 ms
15,948 KB
testcase_23 AC 607 ms
18,732 KB
testcase_24 AC 278 ms
15,804 KB
testcase_25 AC 485 ms
14,020 KB
testcase_26 AC 296 ms
13,936 KB
testcase_27 AC 473 ms
13,972 KB
testcase_28 AC 484 ms
13,984 KB
testcase_29 AC 884 ms
20,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 /////

template <typename VAL, typename DVAL>
struct LazySegTree
{
    int N;
    int head;

    vector<VAL> val;
    vector<DVAL> dval;
    VAL I_val;
    DVAL I_dval;

    using vv2v = function<VAL(const VAL&, const VAL&)>;
    using d2d = function<void(DVAL&, const DVAL&)>;
    using d2v = function<void(VAL&, const DVAL&)>;
    vv2v merge_val;
    d2d add_dval;
    d2v refl_dval;

    LazySegTree(vector<VAL> val_init, VAL val_default, DVAL dval_default,
                vv2v f, d2d dadd, d2v dreflect)
            : N(val_init.size()), I_val(val_default), I_dval(dval_default),
              merge_val(f),
              add_dval(dadd),
              refl_dval(dreflect)
    {
        int N_tmp = 1;
        while (N_tmp < N) N_tmp <<= 1;
        val = vector<VAL>(N_tmp*2, I_val);
        dval = vector<DVAL>(N_tmp*2, I_dval);
        head = N_tmp - 1;
        for (int i=0; i<N; i++) val[head+i] = val_init[i];
        for (int pos=head-1; pos>=0; pos--) val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
    }

    void resolve_dval(int pos, int l, int r) { // posで遅延を解消して子孫に押し付ける
        refl_dval(val[pos], dval[pos]);
        if (pos < head)
        {
            add_dval(dval[pos*2+1], dval[pos]);
            add_dval(dval[pos*2+2], dval[pos]);
        }
        dval[pos] = I_dval;
    }
    vector<pair<pint, DVAL>> history;
    void update(int begin, int end, DVAL dval_q) {
        update(begin, end, dval_q, 0, 0, head+1);
        history.emplace_back(pint(begin, end), dval_q);
    }
    void roll_back() {
        for (auto p : history) {
            update(p.first.first, p.first.second, -p.second, 0, 0, head + 1);
        }
        history.clear();
    }
    void update(int begin, int end, DVAL dval_q, int pos, int l, int r)
    {
        // 後でリファクタリング
        if (begin <= l && r <= end) { // 担当区間全部使う
            add_dval(dval[pos], dval_q);
            resolve_dval(pos, l, r);
        }
        else if (begin < r && l < end) { // 少なくともどこかで交差
            resolve_dval(pos, l, r);
            update(begin, end, dval_q, pos*2+1, l, (l+r)/2);
            update(begin, end, dval_q, pos*2+2, (l+r)/2, r);
            val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
        }
        else resolve_dval(pos, l, r);
    }

    VAL getvalue(int begin, int end) { return getvalue(begin, end, 0, 0, head+1); }
    VAL getvalue(int begin, int end, int pos, int l, int r)
    {
        resolve_dval(pos, l, r);
        if (begin <= l && r <= end) return val[pos];
        else if (begin<r && l<end) {
            VAL vl = getvalue(begin, end, pos*2+1, l, (l+r)/2);
            VAL vr = getvalue(begin, end, pos*2+2, (l+r)/2, r);
            val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
            return merge_val(vl, vr);
        }
        else return I_val;
    }
};

int main()
{
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    map<int, vector<int>> B;
    REP(i, N) B[A[i]].emplace_back(i);

    lint ret = 0;
    LazySegTree<lint, lint> st(vector<lint>(N * 2 + 10), 0, 0,
                              [](lint a, lint b) { return a + b; }, // 本情報のmerge
                              [](lint &a, lint b) { a += b; },          // 遅延情報の子孫への伝播
                              [](lint &a, lint b) { a += b; });         // 遅延情報の本情報への反映

    for (auto p : B)
    {
        p.second.push_back(N);
        int now = -1;
        int v = N + 5;
        st.update(v, v + 1, 1);
        for (auto x : p.second)
        {
            while (now + 1 < x)
            {
                now++;
                v--;
                st.update(v, v + 1, 1);
                lint addv = st.getvalue(0, v);
                ret += addv;
                if (!addv) break;
            }
            int down = x - now - 1;
            if (down > 0)
            {
                st.update(v - down, v, 1);
                now += down;
                v -= down;
            }
            if (x != N)
            {
                v++;
                st.update(v, v + 1, 1);
                ret += st.getvalue(0, v);
            }
            now = x;
        }
        st.roll_back();
    }
    cout << ret << endl;
}
0