結果

問題 No.2220 Range Insert & Point Mex
ユーザー minatominato
提出日時 2023-02-17 22:37:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 298 ms / 2,000 ms
コード長 13,075 bytes
コンパイル時間 2,942 ms
コンパイル使用メモリ 225,424 KB
実行使用メモリ 31,096 KB
最終ジャッジ日時 2024-07-21 12:48:56
合計ジャッジ時間 9,333 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 198 ms
25,768 KB
testcase_14 AC 196 ms
25,768 KB
testcase_15 AC 192 ms
25,760 KB
testcase_16 AC 193 ms
25,772 KB
testcase_17 AC 198 ms
25,648 KB
testcase_18 AC 196 ms
25,772 KB
testcase_19 AC 198 ms
25,768 KB
testcase_20 AC 169 ms
25,772 KB
testcase_21 AC 171 ms
25,776 KB
testcase_22 AC 170 ms
25,772 KB
testcase_23 AC 194 ms
29,416 KB
testcase_24 AC 183 ms
29,292 KB
testcase_25 AC 142 ms
17,648 KB
testcase_26 AC 118 ms
26,980 KB
testcase_27 AC 100 ms
27,096 KB
testcase_28 AC 18 ms
6,944 KB
testcase_29 AC 21 ms
6,944 KB
testcase_30 AC 21 ms
6,940 KB
testcase_31 AC 97 ms
22,412 KB
testcase_32 AC 90 ms
16,500 KB
testcase_33 AC 150 ms
20,212 KB
testcase_34 AC 175 ms
25,188 KB
testcase_35 AC 290 ms
28,440 KB
testcase_36 AC 148 ms
23,724 KB
testcase_37 AC 262 ms
26,760 KB
testcase_38 AC 298 ms
31,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "library-cpp/other/template.hpp"
// clang-format off
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using maxheap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vector<T>>;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP0(n) for (auto minato = decay_t<decltype(n)>{}; minato < (n); ++minato)
#define REP1(i, n) for (auto i = decay_t<decltype(n)>{}; (i) < (n); (i)++)
#define REP2(i, l, r) for (auto i = (l); (i) < (r); (i)++)
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define OVERLOAD_RREP(_1, _2, _3, name, ...) name
#define RREP1(i, n) for (auto i = (n) - 1; (i) >= decay_t<decltype(n)>{}; (i)--)
#define RREP2(i, l, r) for (auto i = (r) - 1; (i) >= (l); (i)--)
#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)
#define all(x) begin(x), end(x)
template <class Container> int SZ(const Container& v) { return int(v.size()); }
template <class T> void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template <class T> T MAX(const vector<T>& v) { return *max_element(v.begin(), v.end()); }
template <class T> T MIN(const vector<T>& v) { return *min_element(v.begin(), v.end()); }
template <class T> T SUM(const vector<T>& v) { return accumulate(v.begin(), v.end(), T(0)); }
template <class T1, class T2> bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2> bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }
int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
int popcount(ull x) { return __builtin_popcountll(x); }
int kthbit(ull x, int k) { return (x >> k) & 1; }
constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }
template <typename S> void rearrange(const vector<S>& id) {}
template <typename S, typename T> void rearrange_exec(const vector<S>& id, vector<T>& v) { vector<T> w(v.size()); for (size_t i = 0; i < id.size(); i++) { w[i] = v[id[i]]; } v.swap(w); }
template <typename S, typename Head, typename... Tail> void rearrange(const vector<S>& id, Head& a, Tail& ...tail) { rearrange_exec(id, a); rearrange(id, tail...); }
constexpr char ln = '\n';
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
void YES(bool t = true) { cout << YESNO[t] << "\n"; }
void Yes(bool t = true) { cout << YesNo[t] << "\n"; }
template <class T> void drop(T x) { cout << x << "\n"; exit(0); }
#define INT(...)     \
    int __VA_ARGS__; \
    IN(__VA_ARGS__)
#define LL(...)     \
    ll __VA_ARGS__; \
    IN(__VA_ARGS__)
#define STR(...)        \
    string __VA_ARGS__; \
    IN(__VA_ARGS__)
#define CHR(...)      \
    char __VA_ARGS__; \
    IN(__VA_ARGS__)
#define LDB(...)             \
    long double __VA_ARGS__; \
    IN(__VA_ARGS__)
#define VEC(type, name, size) \
    vector<type> name(size);  \
    IN(name)
#define VEC2(type, name1, name2, size)     \
    vector<type> name1(size), name2(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i])
#define VEC3(type, name1, name2, name3, size)           \
    vector<type> name1(size), name2(size), name3(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])
#define VEC4(type, name1, name2, name3, name4, size)                 \
    vector<type> name1(size), name2(size), name3(size), name4(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);
#define VV(type, name, N, M)                       \
    vector<vector<type>> name(N, vector<type>(M)); \
    IN(name)
template <class T> void scan(T& a) { cin >> a; }
template <class T> void scan(vector<T>& a) { for (auto& i : a) scan(i); }
void IN() {}
template <class Head, class... Tail> void IN(Head& head, Tail&... tail) { scan(head); IN(tail...); }
void print() { cout << "\n"; }
template <class T> void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); }
template <class T, class... Args> void print(const T& x, const Args& ... args) { cout << x; if (sizeof...(Args)) cout << " "; print(args...); }
#ifdef MINATO_LOCAL
template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }
template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }
template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; }
string debug_delim(int& i) { return i++ == 0 ? "" : ", "; }
#define debug_embrace(x) { int i = 0; os << "{";  { x } return os << "}"; }
template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }
template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }
template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
void debug_out() { cerr << endl; }
template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); }
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_;
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// clang-format on
#line 2 "library-cpp/datastructure/BinaryIndexedTree.hpp"

template <class T> struct BinaryIndexedTree {
  private:
    int n;
    vector<T> data;

    // [0,i) (0-indexed) a[0] + … + a[i-1]
    T sum(int i) const {
        T ret = 0;
        for (; i > 0; i -= i & -i) ret += data[i];
        return ret;
    }

  public:
    BinaryIndexedTree() {
    }
    BinaryIndexedTree(int n) : n(n), data(n + 1, 0) {
    }

    int size() const {
        return n;
    }

    /**
     * (0-indexed)
     * a[i] += x
     */
    void add(int i, T x) {
        assert(0 <= i and i < n);
        for (++i; i <= n; i += i & -i) data[i] += x;
    }

    /**
     * [l, r) (0-indexed)
     * @return a[l] + …　+ a[r-1]
     */
    T sum(int l, int r) const {
        if (l >= r) return T(0);
        assert(0 <= l and r <= n);
        return sum(r) - sum(l);
    }

    /**
     * (0-indexed)
     * r = 0 or a[0] + a[1] + ... + a[r-1] < x
     * r = n or a[0] + a[1] + ... + a[r] >= x
     * a[0] + a[1] + ... + a[r] >= x となる最小の r を返す。
     */
    int lower_bound(T x) const {
        int k = 1;
        int ret = 0;
        while ((k << 1) <= n) k <<= 1;
        while (k > 0) {
            if (ret + k <= n and data[ret + k] < x) {
                x -= data[ret + k];
                ret += k;
            }
            k >>= 1;
        }
        return ret;
    }

    int upper_bound(T x) const {
        return lower_bound(x + 1);
    }
};
#line 3 "E.cpp"

template <typename Int> struct Rangeset {
    using P = pair<Int, Int>;
    Int INF;
    set<P> s;

    Rangeset() : INF(numeric_limits<Int>::max()) {
        s.emplace(-INF, -INF);
        s.emplace(INF, INF);
    }

    //[l,r)
    Int insert(Int l, Int r) {
        assert(l < r);
        Int ret = 0;
        auto it = s.lower_bound(P(l, l));
        while (it->first <= r) {
            r = max(r, it->second);
            ret -= it->second - it->first;
            it = s.erase(it);
        }
        it = prev(it);
        if (it->second >= l) {
            l = min(l, it->first);
            r = max(r, it->second);
            ret -= it->second - it->first;
            it = s.erase(it);
        }
        ret += r - l;
        s.emplace(l, r);
        return ret;
    }

    Int insert(Int x) {
        return insert(x, x + 1);
    }

    Int erase(Int l, Int r) {
        assert(l < r);
        Int ret = insert(l, r) - (r - l);
        auto it = prev(s.upper_bound(P(l, INF)));
        auto [newl, newr] = *it;
        s.erase(it);
        if (newl < l) s.emplace(newl, l);
        if (r < newr) s.emplace(r, newr);
        return ret;
    }

    Int erase(Int x) {
        return erase(x, x + 1);
    }

    void clear() {
        s.clear();
        s.emplace(-INF, -INF);
        s.emplace(INF, INF);
    }

    bool contains(Int l, Int r) {
        assert(l < r);
        auto it = prev(s.upper_bound(P(l, INF)));
        return it->first <= l and r <= it->second;
    }

    bool contains(Int x) {
        return contains(x, x + 1);
    }

    void output() {
        for (auto& [l, r] : s) {
            cerr << "[" << l << ", " << r << ")" << endl;
        }
    }

    int size() {
        return int(s.size()) - 2;
    }
};
template <class T> struct Compress {
  public:
    Compress() {
    }
    Compress(const vector<T>& vs) {
        add(vs);
    }
    Compress(const initializer_list<vector<T>>& vs) {
        for (T& e : vs) add(e);
    }

    void add(const vector<T>& vs) {
        copy(vs.begin(), vs.end(), back_inserter(xs));
    }
    void add(const T& x) {
        xs.emplace_back(x);
    }

    int build() {
        sort(xs.begin(), xs.end());
        xs.erase(unique(xs.begin(), xs.end()), xs.end());
        return int(xs.size());
    }

    int size() const {
        return int(xs.size());
    }

    vector<int> get(const vector<T>& vs) const {
        vector<int> ret;
        ret.reserve(vs.size());
        transform(vs.begin(), vs.end(), back_inserter(ret), [&](const T& e) {
            return lower_bound(xs.begin(), xs.end(), e) - xs.begin();
        });
        return ret;
    }

    int get(const T& x) const {
        return lower_bound(xs.begin(), xs.end(), x) - xs.begin();
    }

    const T& operator[](int k) const {
        return xs[k];
    }

  private:
    vector<T> xs;
};
void solve() {
    INT(N);
    VEC3(int, L, R, A, N);
    Compress<int> Com(R);
    rep(i, N) L[i]--;
    Com.add(0);
    Com.add(L);
    Com.add(TEN(9));
    int M = Com.build();

    vec<Rangeset<int>> G(N);
    rep(i, N) {
        if (A[i] < N) G[A[i]].insert(Com.get(L[i]), Com.get(R[i]));
    }

    vec<int> ok(M - 1), ng(M - 1, N + 1);
    while (true) {
        bool run = false;
        vvec<int> B(N + 1);
        rep(i, M - 1) {
            if (ng[i] - ok[i] > 1) {
                run = true;

                B[(ng[i] + ok[i]) / 2].emplace_back(i);
            }
        }
        if (!run) break;
        BinaryIndexedTree<int> BIT(M);
        rep(i, N) {
            for (auto [l, r] : G[i].s) {
                if (l == 2 and r == 6) debug("ok");
                if (l < 0 or l >= 1000000) continue;
                BIT.add(l, 1);
                BIT.add(r, -1);
            }
            for (auto idx : B[i + 1]) {
                if (BIT.sum(0, idx + 1) == i + 1)
                    ok[idx] = i + 1;
                else
                    ng[idx] = i + 1;
            }
        }
        debug(ok);
        debug(ng);
    }

    INT(Q);
    rep(Q) {
        INT(x);
        int k = Com.get(x);
        k--;
        debug(k);
        print(ok[k]);
    }
}

int main() {
    int T = 1;
    // cin >> T;
    for (int i = 0; i < T; i++) {
        solve();
    }
}
0