結果

問題 No.1526 Sum of Mex 2
ユーザー yuto1115yuto1115
提出日時 2021-05-06 20:59:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 320 ms / 3,000 ms
コード長 8,258 bytes
コンパイル時間 2,938 ms
コンパイル使用メモリ 227,800 KB
実行使用メモリ 12,032 KB
最終ジャッジ日時 2024-11-08 21:29:50
合計ジャッジ時間 7,091 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 3 ms
5,248 KB
testcase_13 AC 16 ms
5,248 KB
testcase_14 AC 17 ms
5,248 KB
testcase_15 AC 22 ms
5,376 KB
testcase_16 AC 110 ms
11,776 KB
testcase_17 AC 77 ms
10,496 KB
testcase_18 AC 9 ms
5,248 KB
testcase_19 AC 8 ms
5,248 KB
testcase_20 AC 47 ms
7,296 KB
testcase_21 AC 105 ms
11,520 KB
testcase_22 AC 60 ms
7,936 KB
testcase_23 AC 108 ms
11,776 KB
testcase_24 AC 113 ms
12,032 KB
testcase_25 AC 108 ms
11,520 KB
testcase_26 AC 113 ms
11,776 KB
testcase_27 AC 116 ms
11,904 KB
testcase_28 AC 118 ms
11,904 KB
testcase_29 AC 118 ms
11,776 KB
testcase_30 AC 122 ms
11,904 KB
testcase_31 AC 117 ms
11,904 KB
testcase_32 AC 110 ms
11,648 KB
testcase_33 AC 320 ms
10,624 KB
evil_largest AC 1,176 ms
29,184 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(i, n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--)
#define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)
#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define SUM(a) accumulate(all(a),0LL)
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define popcount(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vp = vector<P>;
using vvp = vector<vp>;

template<class S, class T>
istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }

template<class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '{' << p.first << "," << p.second << '}'; }

template<class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &t:v) { is >> t; }
    return is;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '[';
    rep(i, v.size())os << v[i] << (i == int(v.size() - 1) ? "" : ",");
    return os << ']';
}

template<class T>
void vecout(const vector<T> &v, char div = '\n') {
    rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div);
}

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

void scan() {}

template<class Head, class... Tail>
void scan(Head &head, Tail &... tail) {
    cin >> head;
    scan(tail...);
}

template<class T>
void print(const T &t) { cout << t << '\n'; }

template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail) {
    cout << head << ' ';
    print(tail...);
}

template<class... T>
void fin(const T &... a) {
    print(a...);
    exit(0);
}

struct Init_io {
    Init_io() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << boolalpha << fixed << setprecision(15);
        cerr << boolalpha << fixed << setprecision(15);
    }
} init_io;

const string yes[] = {"no", "yes"};
const string Yes[] = {"No", "Yes"};
const string YES[] = {"NO", "YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;

vvi graph(int n, int m, bool directed = false, int origin = 1) {
    vvi G(n);
    rep(_, m) {
        INT(u, v);
        u -= origin, v -= origin;
        G[u].pb(v);
        if (!directed) G[v].pb(u);
    }
    return move(G);
}

template<class T>
vector<vector<pair<int, T>>> weighted_graph(int n, int m, bool directed = false, int origin = 1) {
    vector<vector<pair<int, T>>> G(n);
    rep(_, m) {
        int u, v;
        T w;
        scan(u, v, w);
        u -= origin, v -= origin;
        G[u].eb(v, w);
        if (!directed) G[v].pb(u, w);
    }
    return move(G);
}

template<class Node>
class lazy_segtree {
    using V = typename Node::value_structure;
    using VT = typename V::value_type;
    using O = typename Node::operate_structure;
    using OT = typename O::value_type;
    
    int n;
    vector<Node> tree;
    
    void propagate(int k, int l, int r) {
//        if (tree[k].op.value == O::identity) return;
        if (k < n) {
            tree[k * 2].op.value = O::operate(tree[k * 2].op.value, tree[k].op.value);
            tree[k * 2 + 1].op.value = O::operate(tree[k * 2 + 1].op.value, tree[k].op.value);
        }
        OT ot = O::duplicate(tree[k].op.value, r - l);
        tree[k].value.value = Node::operate(tree[k].value.value, ot);
        tree[k].op.value = O::identity;
    }

public:
    VT get(int i) { return Node::operate(tree[i].value.value, tree[i].op.value); }
    
    lazy_segtree(int _n, const vector<VT> &init = vector<VT>()) {
        n = 1;
        while (n < _n) n *= 2;
        tree.assign(n * 2, Node{V::identity, O::identity});
        if (init.size()) rep(i, _n) tree[i + n].value.value = init[i];
        rrep(i, n) tree[i].value.value = V::operate(tree[i * 2].value.value, tree[i * 2 + 1].value.value);
    }
    
    void update(int a, int b, OT x, int k = 1, int l = 0, int r = -1) {
        if (r == -1) r = n;
        propagate(k, l, r);
        if (a <= l && r <= b) {
            tree[k].op.value = O::operate(tree[k].op.value, x);
            propagate(k, l, r);
        } else if (a < r && l < b) {
            update(a, b, x, k * 2, l, (l + r) / 2);
            update(a, b, x, k * 2 + 1, (l + r) / 2, r);
            tree[k].value.value = V::operate(tree[k * 2].value.value, tree[k * 2 + 1].value.value);
        }
    }
    
    // segment [a,b)
    VT fold(int a, int b, int k = 1, int l = 0, int r = -1) {
        if (r == -1) r = n;
        propagate(k, l, r);
        if (b <= l || r <= a) return V::identity;
        if (a <= l && r <= b) return tree[k].value.value;
        VT lt = fold(a, b, k * 2, l, (l + r) / 2);
        VT rt = fold(a, b, k * 2 + 1, (l + r) / 2, r);
        return V::operate(lt, rt);
    }
};

class Value_structure {
public:
    using value_type = ll;
    
    value_type value;
    
    Value_structure(value_type value) : value(value) {}
    
    static constexpr value_type identity = 0;
    
    static constexpr value_type operate(const value_type &l, const value_type &r) {
        return l + r;
    }
};

class Operate_structure {
public:
    using value_type = ll;
    
    value_type value;
    
    Operate_structure(value_type value) : value(value) {}
    
    static constexpr value_type identity = -1;
    
    static constexpr value_type operate(const value_type &l, const value_type &r) {
        if (r == -1) return l;
        else return r;
    }
    
    static constexpr value_type duplicate(const value_type &v, int len) {
        return v * len;
    }
};

class Node {
public:
    using value_structure = Value_structure;
    using operate_structure = Operate_structure;
    
    value_structure value;
    operate_structure op;

private:
    using V = value_structure::value_type;
    using O = operate_structure::value_type;

public:
    Node(V value, O op) : value(value), op(op) {}
    
    static constexpr V operate(const V &l, const O &r) {
        if (r < 0) return l;
        return r;
    }
};


int main() {
    INT(n);
    vi a(n);
    cin >> a;
    map<int, int> mp;
    vi nx(n);
    rrep(i, n) {
        a[i]--;
        nx[i] = (mp.count(a[i]) ? mp[a[i]] : n);
        mp[a[i]] = i;
    }
    vl init(n);
    rep(i, n) {
        init[i] = (mp.count(i) ? mp[i] : n);
        if (i) chmax(init[i], init[i - 1]);
    }
    lazy_segtree<Node> st(n, init);
    ll ans = (ll) n * (n + 1) / 2;
    rep(i, n) {
        ans += (ll) n * n - st.fold(0, n);
        int ok = a[i], ng = n;
        auto f = [&](int x) -> bool {
            return st.fold(x, x + 1) < nx[i];
        };
        if (!f(ok)) continue;
        while (abs(ok - ng) > 1) {
            int mid = (ng + ok) / 2;
            if (f(mid)) ok = mid;
            else ng = mid;
        }
        st.update(a[i], ok + 1, nx[i]);
    }
    fin(ans);
}
0