結果

問題 No.2220 Range Insert & Point Mex
ユーザー 👑 rin204rin204
提出日時 2023-02-17 21:59:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 328 ms / 2,000 ms
コード長 9,322 bytes
コンパイル時間 2,923 ms
コンパイル使用メモリ 241,696 KB
実行使用メモリ 59,664 KB
最終ジャッジ日時 2024-07-21 12:42:42
合計ジャッジ時間 10,886 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 324 ms
49,852 KB
testcase_14 AC 323 ms
49,832 KB
testcase_15 AC 328 ms
49,792 KB
testcase_16 AC 322 ms
49,904 KB
testcase_17 AC 319 ms
49,836 KB
testcase_18 AC 318 ms
49,792 KB
testcase_19 AC 315 ms
49,644 KB
testcase_20 AC 311 ms
59,568 KB
testcase_21 AC 308 ms
59,508 KB
testcase_22 AC 300 ms
59,664 KB
testcase_23 AC 232 ms
29,532 KB
testcase_24 AC 199 ms
28,892 KB
testcase_25 AC 167 ms
23,604 KB
testcase_26 AC 193 ms
29,328 KB
testcase_27 AC 94 ms
15,596 KB
testcase_28 AC 83 ms
17,696 KB
testcase_29 AC 80 ms
17,608 KB
testcase_30 AC 82 ms
17,692 KB
testcase_31 AC 129 ms
19,952 KB
testcase_32 AC 114 ms
18,976 KB
testcase_33 AC 129 ms
18,976 KB
testcase_34 AC 202 ms
33,248 KB
testcase_35 AC 222 ms
33,264 KB
testcase_36 AC 159 ms
22,880 KB
testcase_37 AC 184 ms
23,008 KB
testcase_38 AC 257 ms
38,120 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "A.cpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));

#ifndef RIN__LOCAL
#define endl "\n"
#endif
#define spa ' '
#define len(A) A.size()
#define all(A) begin(A), end(A)

#define fori1(a) for(ll _ = 0; _ < (a); _++)
#define fori2(i, a) for(ll i = 0; i < (a); i++)
#define fori3(i, a, b) for(ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for(ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

template <typename T>
vector<tuple<ll, T>> ENUMERATE(vector<T> &A, ll s = 0){
    vector<tuple<ll, T>> ret(A.size());
    for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]};
    return ret;
}

vector<tuple<ll, char>> ENUMERATE(string &A, ll s = 0){
    vector<tuple<ll, char>> ret(A.size());
    for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]};
    return ret;
}

#define enum1(A) fori(A.size())
#define enum2(a, A) for(auto a:A)
#define enum3(i, a, A) for(auto&& [i, a]: ENUMERATE(A))
#define enum4(i, a, A, s) for(auto&& [i, a]: ENUMERATE(A, s))
#define enum(...) overload4(__VA_ARGS__, enum4, enum3, enum2, enum1)(__VA_ARGS__)

template <typename T, typename S>
vector<tuple<T, S>> ZIP(vector<T> &A, vector<S> &B){
    int n = min(A.size(), B.size());
    vector<tuple<T, S>> ret(n);
    for(int i = 0; i < n; i++) ret[i] = {A[i], B[i]};
    return ret;
}

template <typename T, typename S>
vector<tuple<ll, T, S>> ENUMZIP(vector<T> &A, vector<S> &B, ll s = 0){
    int n = min(A.size(), B.size());
    vector<tuple<ll, T, S>> ret(n);
    for(int i = 0; i < n; i++) ret[i] = {i + s, A[i], B[i]};
    return ret;
}

#define zip4(a, b, A, B) for(auto&& [a, b]: ZIP(A, B))
#define enumzip5(i, a, b, A, B) for(auto&& [i, a, b]: ENUMZIP(A, B))
#define enumzip6(i, a, b, A, B, s) for(auto&& [i, a, b]: ENUMZIP(A, B, s))
#define overload6(a, b, c, d, e, f, g, ...) g
#define zip(...) overload6(__VA_ARGS__, enumzip6, enumzip5, zip4, _, _, _)(__VA_ARGS__)

vector<char> stoc(string &S){
    int n = S.size();
    vector<char> ret(n);
    for(int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}

#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);

const ll MOD1 = 1000000007;
const ll MOD9 = 998244353;

template<class T> auto min(const T& a){
    return *min_element(all(a));
}
template<class T> auto max(const T& a){
    return *max_element(all(a));
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}

void FLUSH(){cout << flush;}
void print(){cout << endl;}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(forward<Tail>(tail)...);
}
template<typename T>
void print(vector<T> &A){
    int n = A.size();
    for(int i = 0; i < n; i++){
        cout << A[i];
        if(i == n - 1) cout << endl;
        else cout << spa;
    }
}
template<typename T>
void print(vector<vector<T>> &A){
    for(auto &row: A) print(row);
}
template<typename T, typename S>
void print(pair<T, S> &A){
    cout << A.first << spa << A.second << endl;
}
template<typename T, typename S>
void print(vector<pair<T, S>> &A){
    for(auto &row: A) print(row);
}
template<typename T, typename S>
void prisep(vector<T> &A, S sep){
    int n = A.size();
    for(int i = 0; i < n; i++){
        cout << A[i];
        if(i == n - 1) cout << endl;
        else cout << sep;
    }
}
template<typename T, typename S>
void priend(T A, S end){
    cout << A << end;
}
template<typename T>
void priend(T A){
    priend(A, spa);
}
template<class... T>
void inp(T&... a){
    (cin >> ... >> a);
}
template<typename T>
void inp(vector<T> &A){
    for(auto &a:A) cin >> a;
}
template<typename T>
void inp(vector<vector<T>> &A){
    for(auto &row:A) inp(row);
}
template<typename T, typename S>
void inp(pair<T, S> &A){
    inp(A.first, A.second);
}
template<typename T, typename S>
void inp(vector<pair<T, S>> &A){
    for(auto &row: A) inp(row.first, row.second);
}

template<typename T>
T sum(vector<T> &A){
    T tot = 0;
    for(auto a:A) tot += a;
    return tot;
}

template<typename T>
pair<vector<T>, map<T, int>> compression(vector<T> X){
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    map<T, int> mp;
    for(int i = 0; i < X.size(); i++) mp[X[i]] = i;
    return {X, mp};
}

#line 2 "Library/C++/data_structure/lazySegTree.hpp"

template<class S, S(*op)(S, S), S(*e)(), class F,
            S (*mapping)(F, S), F(*composition)(F, F), F(*id)()>
struct lazy_segtree{
    public:
        explicit lazy_segtree(const vector<S> &v) : _n(int(v.size())){
            size = 1;
            log = 0;
            while(size < _n){
                log++;
                size <<= 1;
            }
            d = vector<S>(2 * size, e());
            lz = vector<F>(size, id());
            for(int i = 0; i < _n; i++) d[size + i] = v[i];
            for(int i = size - 1; i >= 1; i--) update(i);
        }
        explicit lazy_segtree(int n): lazy_segtree(vector<S>(n, e())){}


        S prod(int l, int r){
            if(l == r) return e();

            l += size;
            r += size;

            for(int i = log; i >= 1; i--){
                if(((l >> i) << i) != l) push(l >> i);
                if(((r >> i) << i) != r) push((r - 1) >> i);
            }

            S sml = e(), smr = e();
            while(l < r){
                if(l & 1) sml = op(sml, d[l++]);
                if(r & 1) smr = op(d[--r], smr);
                l >>= 1;
                r >>= 1;
            }
            return op(sml, smr);
        }

        S all_prod() {
            return d[1];
        }

        void apply(int l, int r, F f){
            if(l == r) return;

            l += size;
            r += size;

            for(int i = log; i >= 1; i--){
                if(((l >> i) << i) != l) push(l >> i);
                if(((r >> i) << i) != r) push((r - 1) >> i);
            }

            {
                int l2 = l, r2 = r;
                while(l < r){
                    if(l & 1) all_apply(l++, f);
                    if(r & 1) all_apply(--r, f);
                    l >>= 1;
                    r >>= 1;
                }
                l = l2;
                r = r2;
            }

            for(int i = 1; i <= log; i++){
                if(((l >> i) << i) != l) update(l >> i);
                if(((r >> i) << i) != r) update((r - 1) >> i);
            }
        }

    private:
        int _n, size, log;
        vector<S> d;
        vector<F> lz;
        void update(int k){
            d[k] = op(d[2 * k], d[2 * k + 1]);
        }
        void all_apply(int k, F f){
            d[k] = mapping(f, d[k]);
            if(k < size) lz[k] = composition(f, lz[k]);
        }
        void push(int k){
            all_apply(2 * k, lz[k]);
            all_apply(2 * k + 1, lz[k]);
            lz[k] = id();
        }
};
#line 188 "A.cpp"
using S = ll;
S op(S l, S r){
    return min(l, r);
}
S e(){
    return 1LL << 60;
}
using F = ll;
S mapping(F l, S r){
    if(l == -1) return r;
    else return l;
}
F composition(F l, F r){
    if(l == -1) return r;
    return l;
}
F id(){
    return -1;
}


void solve(){
    INT(n);
    vec(int, X, 0);
    map<int, vector<pair<int, int>>> upd;
    fori(n){
        INT(l, r, a);
        upd[a].push_back({l, r});
        X.push_back(l);
        X.push_back(r);
    }
    INT(Q);
    VEC(int, query, Q);
    fori(i, Q) X.push_back(query[i]);
    auto res = compression(X);
    X = res.first;
    auto mp = res.second;
    int ma = 0;
    while(1){
        if(!upd.count(ma)) break;
        ma++;
    }
    int le = len(X);
    vec(S, ini, le, ma);
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(ini);
    fori(i, ma - 1, -1, -1){
        auto lr = upd[i];
        sort(all(lr), [](pair<int, int> &lhs, pair<int, int> &rhs){
            return lhs.first < rhs.first;
        });
        int b = -1;
        for(auto tmp:lr){
            int l = mp[tmp.first];
            int r = mp[tmp.second];
            if(b < l) seg.apply(b + 1, l, i);
            chmax(b, r);
        }
        seg.apply(b + 1, le, i);
    }
    for(auto x:query){
        int p = mp[x];
        print(seg.prod(p, p + 1));
    }

}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(12);
    int t;
    t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}
0