結果

問題 No.2223 Merged Med
ユーザー tokusakuraitokusakurai
提出日時 2023-02-17 22:54:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 535 ms / 7,000 ms
コード長 7,160 bytes
コンパイル時間 2,280 ms
コンパイル使用メモリ 210,264 KB
実行使用メモリ 11,460 KB
最終ジャッジ日時 2023-09-26 20:14:44
合計ジャッジ時間 12,611 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 164 ms
5,612 KB
testcase_14 AC 78 ms
4,376 KB
testcase_15 AC 283 ms
9,784 KB
testcase_16 AC 427 ms
10,240 KB
testcase_17 AC 162 ms
7,016 KB
testcase_18 AC 71 ms
4,448 KB
testcase_19 AC 143 ms
5,500 KB
testcase_20 AC 505 ms
11,008 KB
testcase_21 AC 535 ms
10,824 KB
testcase_22 AC 505 ms
10,908 KB
testcase_23 AC 535 ms
11,088 KB
testcase_24 AC 531 ms
10,932 KB
testcase_25 AC 524 ms
10,804 KB
testcase_26 AC 518 ms
10,924 KB
testcase_27 AC 529 ms
11,004 KB
testcase_28 AC 510 ms
10,884 KB
testcase_29 AC 529 ms
10,824 KB
testcase_30 AC 307 ms
11,356 KB
testcase_31 AC 305 ms
10,104 KB
testcase_32 AC 11 ms
4,380 KB
testcase_33 AC 474 ms
10,924 KB
testcase_34 AC 408 ms
11,460 KB
testcase_35 AC 415 ms
10,112 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

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

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

template <typename Monoid>
struct Segment_Tree {
    using F = function<Monoid(Monoid, Monoid)>;
    int n;
    vector<Monoid> seg;
    const F f;
    const Monoid e1;

    // f(f(a,b),c) = f(a,f(b,c)), f(e1,a) = f(a,e1) = a

    Segment_Tree(const vector<Monoid> &v, const F &f, const Monoid &e1) : f(f), e1(e1) {
        int m = v.size();
        n = 1;
        while (n < m) n <<= 1;
        seg.assign(2 * n, e1);
        copy(begin(v), end(v), seg.begin() + n);
        for (int i = n - 1; i > 0; i--) seg[i] = f(seg[2 * i], seg[2 * i + 1]);
    }

    Segment_Tree(int m, const Monoid &x, const F &f, const Monoid &e1) : Segment_Tree(vector<Monoid>(m, x), f, e1) {}

    void change(int i, const Monoid &x, bool update = true) {
        if (update) {
            seg[i + n] = x;
        } else {
            seg[i + n] = f(seg[i + n], x);
        }
        i += n;
        while (i >>= 1) seg[i] = f(seg[2 * i], seg[2 * i + 1]);
    }

    Monoid query(int l, int r) const {
        l = max(l, 0), r = min(r, n);
        Monoid L = e1, R = e1;
        l += n, r += n;
        while (l < r) {
            if (l & 1) L = f(L, seg[l++]);
            if (r & 1) R = f(seg[--r], R);
            l >>= 1, r >>= 1;
        }
        return f(L, R);
    }

    Monoid operator[](int i) const { return seg[n + i]; }

    template <typename C>
    int find_subtree(int i, const C &check, const Monoid &x, Monoid &M, int type) const {
        while (i < n) {
            Monoid nxt = type ? f(seg[2 * i + type], M) : f(M, seg[2 * i + type]);
            if (check(nxt, x)) {
                i = 2 * i + type;
            } else {
                M = nxt;
                i = 2 * i + (type ^ 1);
            }
        }
        return i - n;
    }

    // check((区間 [l,r] での演算結果), x) を満たす最小の r (存在しなければ n 以上の値)
    template <typename C>
    int find_first(int l, const C &check, const Monoid &x) const {
        Monoid L = e1;
        int a = l + n, b = n + n;
        while (a < b) {
            if (a & 1) {
                Monoid nxt = f(L, seg[a]);
                if (check(nxt, x)) return find_subtree(a, check, x, L, 0);
                L = nxt, a++;
            }
            a >>= 1, b >>= 1;
        }
        return n;
    }

    // check((区間 [l,r) での演算結果), x) を満たす最大の l (存在しなければ -1)
    template <typename C>
    int find_last(int r, const C &check, const Monoid &x) const {
        Monoid R = e1;
        int a = n, b = r + n;
        while (a < b) {
            if ((b & 1) || a == 1) {
                Monoid nxt = f(seg[--b], R);
                if (check(nxt, x)) return find_subtree(b, check, x, R, 1);
                R = nxt;
            }
            a >>= 1, b >>= 1;
        }
        return -1;
    }
};

struct Unko {
    int l, r, lr, e;

    Unko() : l(-inf), r(-inf), lr(-inf), e(-inf) {}

    Unko(int x) : l(min(0, x)), r(min(0, x)), lr(min(0, x)), e(x) {}

    int score() {
        int mi = min({0, l + 1, r + 1, lr + 1});
        return e - mi;
    }
};

int main() {
    int N, Q;
    cin >> N >> Q;

    vector<int> a(N);
    rep(i, N) cin >> a[i];

    vector<vector<int>> ids(N + 1);
    rep(i, N) ids[a[i]].eb(i);

    vector<int> l(Q), r(Q), L(Q, 0), R(Q, N), M(Q); // (L,R]
    rep(i, Q) {
        cin >> l[i] >> r[i];
        l[i]--;
    }

    auto merge = [](Unko a, Unko b) {
        if (a.l == -inf) return b;
        if (b.l == -inf) return a;
        Unko c = a;
        c.l = min(a.e + b.l, a.l);
        c.r = min(a.r + b.e, b.r);
        c.lr = min({a.lr, b.lr, a.r + b.l});
        c.e = a.e + b.e;
        return c;
    };

    while (true) {
        bool upd = false;
        vector<vector<int>> qs(N + 1);
        rep(i, Q) {
            if (R[i] - L[i] == 1) continue;
            M[i] = (L[i] + R[i]) / 2;
            qs[M[i]].eb(i);
            upd = true;
        }

        if (!upd) break;

        Segment_Tree<Unko> seg(N, Unko(-1), merge, Unko());

        rep(i, N + 1) {
            each(e, ids[i]) seg.change(e, Unko(1));
            each(e, qs[i]) {
                Unko u = seg.query(l[e], r[e]);
                (u.score() > 0 ? R[e] : L[e]) = M[e];
            }
        }
    }

    printn(R);
}
0